New example ; minor fixes.

1 files changed, 38 insertions, 0 deletions

diff --git a/tests/source/counters.scade b/tests/source/counters.scade
new file mode 100644
index 0000000..334bca1
--- /dev/null
+++ b/tests/source/counters.scade
@@ -0,0 +1,38 @@
+/*
+   x = 10 | 9 | 8 | 7 | 6 | 5 | ... | 0  | 1 | 2 | ... | 10 | ...
+   y =  0 | 1 | 2 | 3 | 4 | 5 | ... | 10 | 9 | 8 | ... | 0  | ...
+
+   b1 = t | f | f | f | f | f | ... | f  | f | f | ... |  t | ...
+   b2 = t | f | f | f | f | f | ... | f  | f | f | ... |  t | ...
+
+   eq* = t | t | t | t | t | t | ... | t  | t | t | ... |  t | ...
+*/
+
+
+-- type t2 = subrange [0,10] of int;
+
+const bound: int = 1000;
+
+node counters(z: bool) returns (eq_nind : bool ; probe x, probe y : int)
+var
+  b1, b2 : bool;
+  a, b : bool;
+let
+
+  a = false -> (if pre a then pre x < bound else pre x <= 0);
+  --a = false -> pre(if a then x < bound else x <= 0);
+  x = bound -> (if a then pre x + 1 else pre x - 1);
+
+  b = true -> (if pre b then pre y < bound else pre y <= 0);
+  --b = true -> pre(if b then y < bound else y <= 0);
+  y = 0 -> (if b then pre y + 1 else pre y - 1);
+
+  b1 = x=bound;
+  b2 = y=0;
+
+
+  guarantee xy : x+y = bound;
+  guarantee bb : b1 = b2;
+  guarantee rp : -bound <= (x-y) and (x-y) <= bound;
+
+tel