On improving efficiency of model checking through systematically ...

if not (pre avance) then diff >= 10 else diff >= 1;
retard = false ->
if not (pre retard) then (diff = 9 then not B else true);
c = 0 ->
if pre avance and pre (false -> pre avance) then
if B then pre c + 1 else pre c
else
0;
tel
-- Main node (without yet properties)
node main(B : bool^N; S : bool)
returns (ast: bool; nB : int^N; nS : int; diff:int^N; avance,retard : bool^N);
var H:bool^N;
let
nB = 0^N -> if B then pre nB + 1^N else pre nB;
nS = 0 -> if S then pre nS + 1 else pre nS;
H = hypothese(B,S^N,avance,retard);
(diff,avance,retard) = controleur(nB,nS^N);
ast = AND(N,H);
tel
-- ****************************************************************
-- Properties
-- ****************************************************************
node prop1(B : bool^N; S : bool)
returns (ok:bool;ast:bool);
var nB : int^N; nS : int; diff:int^N; avance,retard : bool^N;
pok:bool;
let
(ast,nB,nS,diff,avance,retard) = main(B,S);
pok = true -> not (pre avance[0] and retard[0] or pre retard[0] and avance[0]);
ok = true -> pre pok;
assert ast;
tel
node prop2(B : bool^N; S : bool)
returns (ok:bool;ast:bool);
var nB : int^N; nS : int; diff:int^N; avance,retard : bool^N;
83