diff options
author | Checkmate50 <dgeisler50@gmail.com> | 2016-06-06 23:14:18 -0600 |
---|---|---|
committer | Checkmate50 <dgeisler50@gmail.com> | 2016-06-06 23:14:18 -0600 |
commit | d652155ae013f36a1ee17653a8e458baad2d9c2c (patch) | |
tree | 067d600fe3cd1723afc11682935f0123a1eab653 /Test/test20/TypeSynonyms2.bpl | |
parent | d7fc0deb2ca6d7ebee094b6ea5430d9b41f163ec (diff) |
Merging complete. Everything looks good *crosses fingers*
Diffstat (limited to 'Test/test20/TypeSynonyms2.bpl')
-rw-r--r-- | Test/test20/TypeSynonyms2.bpl | 48 |
1 files changed, 24 insertions, 24 deletions
diff --git a/Test/test20/TypeSynonyms2.bpl b/Test/test20/TypeSynonyms2.bpl index 1cb6e781..87a7451f 100644 --- a/Test/test20/TypeSynonyms2.bpl +++ b/Test/test20/TypeSynonyms2.bpl @@ -1,24 +1,24 @@ -// RUN: %boogie "%s" > "%t"
-// RUN: %diff "%s.expect" "%t"
-// RUN: %boogie -noVerify -print:- -pretty:0 -env:0 -printDesugared "%s" > "%t"
-// RUN: %diff "%s.print.expect" "%t"
-
-
-type Set a = [a]bool;
-
-function union<a>(x : Set a, y : Set a) returns (Set a);
-axiom (forall<a> x : Set a, y : Set a, z : a :: (x[z] || y[z]) == union(x, y)[z]);
-
-
-const intSet0 : Set int;
-axiom (forall x:int :: intSet0[x] == (x == 0 || x == 2 || x == 3));
-
-const intSet1 : Set int;
-axiom (forall x:int :: intSet1[x] == (x == -5 || x == 3));
-
-
-procedure P() returns () {
- assert (forall x:int :: union(intSet0, intSet1)[x] ==
- (x == -5 || x == 0 || x == 2 || x == 3));
-}
-
+// RUN: %boogie "%s" > "%t" +// RUN: %diff "%s.expect" "%t" +// RUN: %boogie -noVerify -print:- -pretty:0 -env:0 -printDesugared "%s" > "%t" +// RUN: %diff "%s.print.expect" "%t" + + +type Set a = [a]bool; + +function union<a>(x : Set a, y : Set a) returns (Set a); +axiom (forall<a> x : Set a, y : Set a, z : a :: (x[z] || y[z]) == union(x, y)[z]); + + +const intSet0 : Set int; +axiom (forall x:int :: intSet0[x] == (x == 0 || x == 2 || x == 3)); + +const intSet1 : Set int; +axiom (forall x:int :: intSet1[x] == (x == -5 || x == 3)); + + +procedure P() returns () { + assert (forall x:int :: union(intSet0, intSet1)[x] == + (x == -5 || x == 0 || x == 2 || x == 3)); +} + |