diff options
author | Dan Liew <daniel.liew@imperial.ac.uk> | 2015-06-28 01:44:30 +0100 |
---|---|---|
committer | Dan Liew <daniel.liew@imperial.ac.uk> | 2015-06-28 01:44:30 +0100 |
commit | 962f8d5252b3f5ec4d19e0cd2a430934bd55cc6d (patch) | |
tree | 27d5f9b0d130c6c1a6758bc0b7456b0aa51e34e0 /Test/test20/TypeSynonyms2.bpl | |
parent | e11d65009d0b4ba1327f5f5dd6b26367330611f0 (diff) |
Normalise line endings using a .gitattributes file. Unfortunately
this required that this commit globally modify most files. If you
want to use git blame to see the real author of a line use the
``-w`` flag so that whitespace changes are ignored.
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)); +} + |