1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
|
// RUN: %dafny "%s" > "%t"
// RUN: %diff "%s.expect" "%t"
// The tests in this file are designed to run through the compiler. They contain
// program snippets that are tricky to compile or whose compilation once was buggy.
module OnceBuggy {
datatype MyDt<T> = Nil | Cons(T, MyDt<T>)
method M<U>(x: MyDt<int>)
{
match (x) {
case Cons(head, tail) =>
var y: int := head;
case Nil =>
}
}
}
// --------------------------------------------------
module CoRecursion {
codatatype Stream<T> = More(head: T, rest: Stream)
function method AscendingChain(n: int): Stream<int>
{
More(n, AscendingChain(n+1))
}
datatype List<T> = Nil | Cons(car: T, cdr: List)
function method Prefix(n: nat, s: Stream): List
{
if n == 0 then Nil else
Cons(s.head, Prefix(n-1, s.rest))
}
class Cell { var data: int; }
// When run, the following method should print
// 400
// 320
// 40
// 41
// 42
method Main() {
var m := 17;
var cell := new Cell;
cell.data := 40;
var mr := More(400, More(320, AscendingChain(cell.data)));
m := 30;
cell.data := 60;
var l := Prefix(5, mr);
while (l != Nil)
decreases l;
{
match (l) { case Cons(x,y) => }
print l.car, "\n";
l := l.cdr;
}
}
}
abstract module S {
class C {
var f: int;
method m()
}
}
module T refines S {
class C {
method m() {
print "in T.C.m()";
}
}
}
module A {
import X as S default T
import Y as S default T
import Z = T
method run() {
var x := new X.C;
x.m();
var y := new Y.C;
y.m();
var z := new Z.C;
z.m();
}
}
method NotMain() {
A.run();
}
abstract module S1 {
import B as S default T
method do()
}
module T1 refines S1 {
method do() {
var x := 3;
}
}
module A1 {
import X as S1 default T1
method run() {
X.do();
var x := new X.B.C;
x.m();
}
}
// ----- keyword escapes (once buggy) -----
module M {
datatype fixed = A | B
function method F(): fixed
{
A
}
class public {
var private: int;
}
}
method Caller() {
var p := new M.public;
var x := p.private;
}
// ----- digits-identifiers for destructors -----
datatype Tuple<T,U> = Pair(0: T, 1: U, r: int, s': int)
method DigitsIdents(t: Tuple<int, Tuple<int, bool>>)
{
var x: int := t.0;
var y: bool := t.1.1;
var z: int := t.r + t.1.r + t.1.s';
}
class DigitsClass {
var 7: bool;
method M(c: DigitsClass)
requires c != null;
{
var x: int := if this.7 then 7 else if c.7 then 8 else 9;
}
}
// Should not get errors about methods or functions with empty bodies
// if they're marked with an :axiom attribute
ghost method {:axiom} m_nobody() returns (y:int)
ensures y > 5;
lemma {:axiom} l_nobody() returns (y:int)
ensures y > 5;
function {:axiom} f_nobody():int
ensures f_nobody() > 5;
// Make sure the lemma created for opaque functions doesn't produce compiler errors
function {:opaque} hidden():int
{
7
}
method hidden_test()
{
reveal_hidden();
assert hidden() == 7;
}
// ----- LetExpr with ghosts and in ghost contexts -----
module GhostLetExpr {
method M() {
ghost var y;
var x;
var g := G(x, y);
ghost var h := var ta := F(); 5;
var j := ghost var tb := F(); 5;
assert h == j;
}
function F(): int
{ 5 }
function method G(x: int, ghost y: int): int
{ assert y == y; x }
datatype Dt = MyRecord(a: int, ghost b: int)
method P(dt: Dt) {
match dt {
case MyRecord(aa, bb) =>
ghost var z := bb + F();
ghost var t0 := var y := z; z + 3;
ghost var t1 := ghost var y := z; z + 3;
var t2 := ghost var y := z; aa + 3;
}
}
function method FM(): int
{
ghost var xyz := F();
G(5, xyz)
}
}
class DigitUnderscore_Names {
// the following would be the same integers, but they are different fields
var 0_1_0: int;
var 010: int;
var 10: int;
// ... as we see here:
method M()
modifies this;
{
this.0_1_0 := 007;
this.010 := 000_008;
this.10 := 0x0000_0009;
assert this.0_1_0 == int(00_07.0_0) && this.010 == 8 && this.10 == 9;
this.10 := 20;
}
}
|
