#define c1 client[1]@C
#define c2 client[2]@C


	/*
	 * Formula As Typed: [] !(c1 && c2)
	 * The Never Claim Below Corresponds
	 * To The Negated Formula !([] !(c1 && c2))
	 * (formalizing violations of the original)
	 */

never {    /* !([] !(c1 && c2)) */
T0_init:
	if
	:: ((c1) && (c2)) -> goto accept_all
	:: (1) -> goto T0_init
	fi;
accept_all:
	skip
}

#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 0: Claim reached state 5 (line 69)
(Spin Version 4.3.0 -- 22 June 2007)
	+ 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 137, errors: 0
     157 states, stored
      68 states, matched
     225 transitions (= stored+matched)
       0 atomic steps
hash conflicts: 0 (resolved)

Stats on memory usage (in Megabytes):
0.009 	equivalent memory usage for states (stored*(State-vector + overhead))
0.303 	actual memory usage for states (unsuccessful compression: 3215.63%)
	State-vector as stored = 1917 byte + 12 byte overhead
2.097 	memory used for hash table (-w19)
0.320 	memory used for DFS stack (-m10000)
0.098 	memory lost to fragmentation
2.622 	total actual memory usage

unreached in proctype client
	line 14, "pan.___", state 9, "-end-"
	(1 of 9 states)
unreached in proctype server
	line 46, "pan.___", state 27, "-end-"
	(1 of 27 states)
unreached in proctype :init:
	(0 of 4 states)
unreached in proctype :never:
	line 74, "pan.___", state 8, "-end-"
	(1 of 8 states)
0.00user 0.00system 0:00.00elapsed 114%CPU (0avgtext+0avgdata 0maxresident)k
0inputs+0outputs (0major+759minor)pagefaults 0swaps

#endif