#define c1 inC[0]==1 #define c2 inC[1]==1 #define w1 wait[0]==1 #define w2 wait[1]==1 /* * Formula As Typed: [] (w1 -> <>!w1) * The Never Claim Below Corresponds * To The Negated Formula !([] (w1 -> <>!w1)) * (formalizing violations of the original) */ never { /* !([] (w1 -> <>!w1)) */ T0_init: if :: ((w1)) -> goto accept_S4 :: (1) -> goto T0_init fi; accept_S4: if :: ((w1)) -> goto accept_S4 fi; } #ifdef NOTES Use Load to open a file or a template. #endif #ifdef RESULT warning: for p.o. reduction to be valid the never claim must be stutter-invariant (never claims generated from LTL formulae are stutter-invariant) depth 122: Claim reached state 9 (line 85) pan: acceptance cycle (at depth 228) pan: wrote pan_in.trail (Spin Version 4.2.2 -- 12 December 2004) Warning: Search not completed + Partial Order Reduction Full statespace search for: never claim + assertion violations + (if within scope of claim) acceptance cycles + (fairness disabled) invalid end states - (disabled by never claim) State-vector 48 byte, depth reached 282, errors: 1 263 states, stored (367 visited) 202 states, matched 569 transitions (= visited+matched) 0 atomic steps hash conflicts: 0 (resolved) Stats on memory usage (in Megabytes): 0.015 equivalent memory usage for states (stored*(State-vector + overhead)) 0.302 actual memory usage for states (unsuccessful compression: 2053.56%) State-vector as stored = 1142 byte + 8 byte overhead 2.097 memory used for hash table (-w19) 0.320 memory used for DFS stack (-m10000) 0.125 other (proc and chan stacks) 0.098 memory lost to fragmentation 2.622 total actual memory usage unreached in proctype client line 24, "pan.___", state 13, "-end-" (1 of 13 states) unreached in proctype server line 56, "pan.___", state 27, "-end-" (1 of 27 states) unreached in proctype :init: (0 of 4 states) unreached in proctype :never: line 88, "pan.___", state 11, "-end-" (1 of 11 states) 0.00user 0.01system 0:00.01elapsed 76%CPU (0avgtext+0avgdata 0maxresident)k 0inputs+0outputs (0major+741minor)pagefaults 0swaps #endif