Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 87K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585500250
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527494082004

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))"))
Formula 0 simplified : !"((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))"
Reverse transition relation is NOT exact ! Due to transitions Leave_2_1_1, Leave_3_1_1, Leave_2_3_3, Leave_1_3_2, Leave_2_3_1, Leave_1_3_3, Leave_1_2_2, Leave_3_2_1, Leave_2_1_3, Leave_3_2_2, Leave_3_1_2, Leave_1_2_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :40/32/12/84
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
12 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.165938,20144,1,0,100,12252,153,44,2411,10859,149
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G("((((((((((((((((((((((((((((((Think_2>=1)&&(Neighbourhood_2_1>=1))&&(Neighbourhood_1_2>=1))&&(Forks_2>=1))||((((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_3>=1))&&(Think_3>=1)))||((((Neighbourhood_1_1>=1)&&(Neighbourhood_1_2>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Forks_3>=1)&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1))&&(Think_3>=1)))||((((Forks_3>=1)&&(Neighbourhood_3_3>=1))&&(Think_3>=1))&&(Neighbourhood_3_2>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_1_1>=1))&&(Neighbourhood_2_1>=1)))||((((Neighbourhood_1_3>=1)&&(Think_1>=1))&&(Neighbourhood_1_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_2_3>=1)&&(Neighbourhood_2_2>=1))&&(Forks_2>=1))&&(Think_2>=1)))||((((Neighbourhood_3_1>=1)&&(Neighbourhood_3_3>=1))&&(Forks_3>=1))&&(Think_3>=1)))||((((Neighbourhood_3_2>=1)&&(Forks_2>=1))&&(Think_2>=1))&&(Neighbourhood_2_3>=1)))||((((Think_2>=1)&&(Forks_2>=1))&&(Neighbourhood_2_2>=1))&&(Neighbourhood_2_1>=1)))||((((Think_1>=1)&&(Neighbourhood_1_2>=1))&&(Neighbourhood_3_1>=1))&&(Forks_1>=1)))||((((Think_2>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1))&&(Neighbourhood_2_1>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1)))||((((Neighbourhood_2_2>=1)&&(Think_2>=1))&&(Forks_2>=1))&&(Neighbourhood_3_2>=1)))||((((Neighbourhood_1_1>=1)&&(Think_1>=1))&&(Neighbourhood_3_1>=1))&&(Forks_1>=1)))||((((Forks_3>=1)&&(Think_3>=1))&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_3>=1)))||((((Neighbourhood_1_2>=1)&&(Neighbourhood_2_1>=1))&&(Think_1>=1))&&(Forks_1>=1)))||(((Think_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_3>=2)))||((((Neighbourhood_3_1>=1)&&(Forks_3>=1))&&(Think_3>=1))&&(Neighbourhood_2_3>=1)))||((((Neighbourhood_1_2>=1)&&(Neighbourhood_2_3>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1)))||(((Forks_2>=1)&&(Think_2>=1))&&(Neighbourhood_2_2>=2)))||((((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1)))||(((Neighbourhood_1_1>=2)&&(Think_1>=1))&&(Forks_1>=1)))||((((Forks_2>=1)&&(Think_2>=1))&&(Neighbourhood_2_2>=1))&&(Neighbourhood_1_2>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_2_1>=1))&&(Neighbourhood_1_3>=1)))")))
Formula 1 simplified : !G"((((((((((((((((((((((((((((((Think_2>=1)&&(Neighbourhood_2_1>=1))&&(Neighbourhood_1_2>=1))&&(Forks_2>=1))||((((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_3>=1))&&(Think_3>=1)))||((((Neighbourhood_1_1>=1)&&(Neighbourhood_1_2>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Forks_3>=1)&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1))&&(Think_3>=1)))||((((Forks_3>=1)&&(Neighbourhood_3_3>=1))&&(Think_3>=1))&&(Neighbourhood_3_2>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_1_1>=1))&&(Neighbourhood_2_1>=1)))||((((Neighbourhood_1_3>=1)&&(Think_1>=1))&&(Neighbourhood_1_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_2_3>=1)&&(Neighbourhood_2_2>=1))&&(Forks_2>=1))&&(Think_2>=1)))||((((Neighbourhood_3_1>=1)&&(Neighbourhood_3_3>=1))&&(Forks_3>=1))&&(Think_3>=1)))||((((Neighbourhood_3_2>=1)&&(Forks_2>=1))&&(Think_2>=1))&&(Neighbourhood_2_3>=1)))||((((Think_2>=1)&&(Forks_2>=1))&&(Neighbourhood_2_2>=1))&&(Neighbourhood_2_1>=1)))||((((Think_1>=1)&&(Neighbourhood_1_2>=1))&&(Neighbourhood_3_1>=1))&&(Forks_1>=1)))||((((Think_2>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1))&&(Neighbourhood_2_1>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1)))||((((Neighbourhood_2_2>=1)&&(Think_2>=1))&&(Forks_2>=1))&&(Neighbourhood_3_2>=1)))||((((Neighbourhood_1_1>=1)&&(Think_1>=1))&&(Neighbourhood_3_1>=1))&&(Forks_1>=1)))||((((Forks_3>=1)&&(Think_3>=1))&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_3>=1)))||((((Neighbourhood_1_2>=1)&&(Neighbourhood_2_1>=1))&&(Think_1>=1))&&(Forks_1>=1)))||(((Think_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_3>=2)))||((((Neighbourhood_3_1>=1)&&(Forks_3>=1))&&(Think_3>=1))&&(Neighbourhood_2_3>=1)))||((((Neighbourhood_1_2>=1)&&(Neighbourhood_2_3>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1)))||(((Forks_2>=1)&&(Think_2>=1))&&(Neighbourhood_2_2>=2)))||((((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1)))||(((Neighbourhood_1_1>=2)&&(Think_1>=1))&&(Forks_1>=1)))||((((Forks_2>=1)&&(Think_2>=1))&&(Neighbourhood_2_2>=1))&&(Neighbourhood_1_2>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_2_1>=1))&&(Neighbourhood_1_3>=1)))"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.179914,20840,1,0,100,12252,159,44,2549,10860,154
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F(X(G("(((Think_1>=1)||(Think_3>=1))||(Think_2>=1))"))))U((F("((((((((((((((((((((((((((((((Think_2>=1)&&(Neighbourhood_2_1>=1))&&(Neighbourhood_1_2>=1))&&(Forks_2>=1))||((((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_3>=1))&&(Think_3>=1)))||((((Neighbourhood_1_1>=1)&&(Neighbourhood_1_2>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Forks_3>=1)&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1))&&(Think_3>=1)))||((((Forks_3>=1)&&(Neighbourhood_3_3>=1))&&(Think_3>=1))&&(Neighbourhood_3_2>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_1_1>=1))&&(Neighbourhood_2_1>=1)))||((((Neighbourhood_1_3>=1)&&(Think_1>=1))&&(Neighbourhood_1_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_2_3>=1)&&(Neighbourhood_2_2>=1))&&(Forks_2>=1))&&(Think_2>=1)))||((((Neighbourhood_3_1>=1)&&(Neighbourhood_3_3>=1))&&(Forks_3>=1))&&(Think_3>=1)))||((((Neighbourhood_3_2>=1)&&(Forks_2>=1))&&(Think_2>=1))&&(Neighbourhood_2_3>=1)))||((((Think_2>=1)&&(Forks_2>=1))&&(Neighbourhood_2_2>=1))&&(Neighbourhood_2_1>=1)))||((((Think_1>=1)&&(Neighbourhood_1_2>=1))&&(Neighbourhood_3_1>=1))&&(Forks_1>=1)))||((((Think_2>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1))&&(Neighbourhood_2_1>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1)))||((((Neighbourhood_2_2>=1)&&(Think_2>=1))&&(Forks_2>=1))&&(Neighbourhood_3_2>=1)))||((((Neighbourhood_1_1>=1)&&(Think_1>=1))&&(Neighbourhood_3_1>=1))&&(Forks_1>=1)))||((((Forks_3>=1)&&(Think_3>=1))&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_3>=1)))||((((Neighbourhood_1_2>=1)&&(Neighbourhood_2_1>=1))&&(Think_1>=1))&&(Forks_1>=1)))||(((Think_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_3>=2)))||((((Neighbourhood_3_1>=1)&&(Forks_3>=1))&&(Think_3>=1))&&(Neighbourhood_2_3>=1)))||((((Neighbourhood_1_2>=1)&&(Neighbourhood_2_3>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1)))||(((Forks_2>=1)&&(Think_2>=1))&&(Neighbourhood_2_2>=2)))||((((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1)))||(((Neighbourhood_1_1>=2)&&(Think_1>=1))&&(Forks_1>=1)))||((((Forks_2>=1)&&(Think_2>=1))&&(Neighbourhood_2_2>=1))&&(Neighbourhood_1_2>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_2_1>=1))&&(Neighbourhood_1_3>=1)))"))U(F("(((((((((((WaitRight_1>=1)&&(Neighbourhood_1_1>=1))&&(Forks_1>=1))||(((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(WaitRight_2>=1)))||(((Neighbourhood_2_1>=1)&&(WaitRight_2>=1))&&(Forks_1>=1)))||(((Forks_1>=1)&&(Neighbourhood_3_1>=1))&&(WaitRight_3>=1)))||(((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(WaitRight_1>=1)))||(((WaitRight_3>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1)))||(((WaitRight_1>=1)&&(Neighbourhood_1_2>=1))&&(Forks_2>=1)))||(((Forks_2>=1)&&(Neighbourhood_2_2>=1))&&(WaitRight_2>=1)))||(((Neighbourhood_3_3>=1)&&(WaitRight_3>=1))&&(Forks_3>=1)))")))))
Formula 2 simplified : !(FXG"(((Think_1>=1)||(Think_3>=1))||(Think_2>=1))" U (F"((((((((((((((((((((((((((((((Think_2>=1)&&(Neighbourhood_2_1>=1))&&(Neighbourhood_1_2>=1))&&(Forks_2>=1))||((((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_3>=1))&&(Think_3>=1)))||((((Neighbourhood_1_1>=1)&&(Neighbourhood_1_2>=1))&&(Think_1>=1))&&(Forks_1>=1)))||((((Forks_3>=1)&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1))&&(Think_3>=1)))||((((Forks_3>=1)&&(Neighbourhood_3_3>=1))&&(Think_3>=1))&&(Neighbourhood_3_2>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_1_1>=1))&&(Neighbourhood_2_1>=1)))||((((Neighbourhood_1_3>=1)&&(Think_1>=1))&&(Neighbourhood_1_1>=1))&&(Forks_1>=1)))||((((Neighbourhood_2_3>=1)&&(Neighbourhood_2_2>=1))&&(Forks_2>=1))&&(Think_2>=1)))||((((Neighbourhood_3_1>=1)&&(Neighbourhood_3_3>=1))&&(Forks_3>=1))&&(Think_3>=1)))||((((Neighbourhood_3_2>=1)&&(Forks_2>=1))&&(Think_2>=1))&&(Neighbourhood_2_3>=1)))||((((Think_2>=1)&&(Forks_2>=1))&&(Neighbourhood_2_2>=1))&&(Neighbourhood_2_1>=1)))||((((Think_1>=1)&&(Neighbourhood_1_2>=1))&&(Neighbourhood_3_1>=1))&&(Forks_1>=1)))||((((Think_2>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1))&&(Neighbourhood_2_1>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_1>=1)))||((((Neighbourhood_2_2>=1)&&(Think_2>=1))&&(Forks_2>=1))&&(Neighbourhood_3_2>=1)))||((((Neighbourhood_1_1>=1)&&(Think_1>=1))&&(Neighbourhood_3_1>=1))&&(Forks_1>=1)))||((((Forks_3>=1)&&(Think_3>=1))&&(Neighbourhood_1_3>=1))&&(Neighbourhood_3_3>=1)))||((((Neighbourhood_1_2>=1)&&(Neighbourhood_2_1>=1))&&(Think_1>=1))&&(Forks_1>=1)))||(((Think_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_3>=2)))||((((Neighbourhood_3_1>=1)&&(Forks_3>=1))&&(Think_3>=1))&&(Neighbourhood_2_3>=1)))||((((Neighbourhood_1_2>=1)&&(Neighbourhood_2_3>=1))&&(Think_2>=1))&&(Forks_2>=1)))||((((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1)))||(((Forks_2>=1)&&(Think_2>=1))&&(Neighbourhood_2_2>=2)))||((((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1)))||(((Neighbourhood_1_1>=2)&&(Think_1>=1))&&(Forks_1>=1)))||((((Forks_2>=1)&&(Think_2>=1))&&(Neighbourhood_2_2>=1))&&(Neighbourhood_1_2>=1)))||((((Think_1>=1)&&(Forks_1>=1))&&(Neighbourhood_2_1>=1))&&(Neighbourhood_1_3>=1)))" U F"(((((((((((WaitRight_1>=1)&&(Neighbourhood_1_1>=1))&&(Forks_1>=1))||(((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(WaitRight_2>=1)))||(((Neighbourhood_2_1>=1)&&(WaitRight_2>=1))&&(Forks_1>=1)))||(((Forks_1>=1)&&(Neighbourhood_3_1>=1))&&(WaitRight_3>=1)))||(((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(WaitRight_1>=1)))||(((WaitRight_3>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1)))||(((WaitRight_1>=1)&&(Neighbourhood_1_2>=1))&&(Forks_2>=1)))||(((Forks_2>=1)&&(Neighbourhood_2_2>=1))&&(WaitRight_2>=1)))||(((Neighbourhood_3_3>=1)&&(WaitRight_3>=1))&&(Forks_3>=1)))"))
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.239207,23104,1,0,135,15913,168,75,2574,17398,232
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X("((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))")))
Formula 3 simplified : !X"((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))"
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.243289,23104,1,0,136,16045,168,76,2574,17671,239
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(("((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))"))
Formula 4 simplified : !"((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.244092,23368,1,0,136,16045,168,76,2574,17671,239
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((("(((((((((((WaitRight_1>=1)&&(Neighbourhood_1_1>=1))&&(Forks_1>=1))||(((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(WaitRight_2>=1)))||(((Neighbourhood_2_1>=1)&&(WaitRight_2>=1))&&(Forks_1>=1)))||(((Forks_1>=1)&&(Neighbourhood_3_1>=1))&&(WaitRight_3>=1)))||(((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(WaitRight_1>=1)))||(((WaitRight_3>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1)))||(((WaitRight_1>=1)&&(Neighbourhood_1_2>=1))&&(Forks_2>=1)))||(((Forks_2>=1)&&(Neighbourhood_2_2>=1))&&(WaitRight_2>=1)))||(((Neighbourhood_3_3>=1)&&(WaitRight_3>=1))&&(Forks_3>=1)))")U(X("((((((((Outside_3>=1)&&(Outside_1>=1))&&(Outside_2>=1))||(((Outside_1>=1)&&(Outside_2>=1))&&(Outside_3>=1)))||(((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)))||(((Outside_2>=1)&&(Outside_1>=1))&&(Outside_3>=1)))||(((Outside_1>=1)&&(Outside_3>=1))&&(Outside_2>=1)))||(((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)))"))))
Formula 5 simplified : !("(((((((((((WaitRight_1>=1)&&(Neighbourhood_1_1>=1))&&(Forks_1>=1))||(((Forks_3>=1)&&(Neighbourhood_2_3>=1))&&(WaitRight_2>=1)))||(((Neighbourhood_2_1>=1)&&(WaitRight_2>=1))&&(Forks_1>=1)))||(((Forks_1>=1)&&(Neighbourhood_3_1>=1))&&(WaitRight_3>=1)))||(((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(WaitRight_1>=1)))||(((WaitRight_3>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1)))||(((WaitRight_1>=1)&&(Neighbourhood_1_2>=1))&&(Forks_2>=1)))||(((Forks_2>=1)&&(Neighbourhood_2_2>=1))&&(WaitRight_2>=1)))||(((Neighbourhood_3_3>=1)&&(WaitRight_3>=1))&&(Forks_3>=1)))" U X"((((((((Outside_3>=1)&&(Outside_1>=1))&&(Outside_2>=1))||(((Outside_1>=1)&&(Outside_2>=1))&&(Outside_3>=1)))||(((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)))||(((Outside_2>=1)&&(Outside_1>=1))&&(Outside_3>=1)))||(((Outside_1>=1)&&(Outside_3>=1))&&(Outside_2>=1)))||(((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)))")
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.249157,23368,1,0,136,16045,172,76,2587,17672,243
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(X(F(X(F("((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))")))))))
Formula 6 simplified : !GXFXF"((((Forks_3>=1)&&(WaitLeft_3>=1))||((WaitLeft_1>=1)&&(Forks_1>=1)))||((Forks_2>=1)&&(WaitLeft_2>=1)))"
Computing Next relation with stutter on 45 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.281948,24656,1,0,159,20060,178,95,2587,23918,301
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G((F(G("((((((((Outside_3>=1)&&(Outside_1>=1))&&(Outside_2>=1))||(((Outside_1>=1)&&(Outside_2>=1))&&(Outside_3>=1)))||(((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)))||(((Outside_2>=1)&&(Outside_1>=1))&&(Outside_3>=1)))||(((Outside_1>=1)&&(Outside_3>=1))&&(Outside_2>=1)))||(((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)))")))U(G("((((((((((((((((((((((((((((((Neighbourhood_1_2>=1)&&(Outside_2>=1))&&(Forks_2>=1))&&(Forks_1>=1))||(((Forks_1>=2)&&(Neighbourhood_1_1>=1))&&(Outside_2>=1)))||((((Neighbourhood_3_2>=1)&&(Forks_2>=1))&&(Forks_3>=1))&&(Outside_2>=1)))||((((Neighbourhood_1_2>=1)&&(Forks_2>=1))&&(Forks_1>=1))&&(Outside_1>=1)))||(((Forks_1>=2)&&(Outside_3>=1))&&(Neighbourhood_1_1>=1)))||((((Forks_2>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Outside_3>=1)))||((((Forks_2>=1)&&(Forks_1>=1))&&(Outside_1>=1))&&(Neighbourhood_2_1>=1)))||((((Outside_3>=1)&&(Neighbourhood_3_2>=1))&&(Forks_3>=1))&&(Forks_2>=1)))||((((Neighbourhood_3_1>=1)&&(Outside_3>=1))&&(Forks_3>=1))&&(Forks_1>=1)))||((((Forks_2>=1)&&(Outside_2>=1))&&(Neighbourhood_2_3>=1))&&(Forks_3>=1)))||((((Forks_1>=1)&&(Outside_2>=1))&&(Forks_3>=1))&&(Neighbourhood_3_1>=1)))||(((Neighbourhood_2_2>=1)&&(Forks_2>=2))&&(Outside_3>=1)))||((((Neighbourhood_3_1>=1)&&(Forks_3>=1))&&(Outside_1>=1))&&(Forks_1>=1)))||(((Neighbourhood_3_3>=1)&&(Forks_3>=2))&&(Outside_1>=1)))||((((Neighbourhood_3_2>=1)&&(Outside_1>=1))&&(Forks_3>=1))&&(Forks_2>=1)))||(((Outside_1>=1)&&(Neighbourhood_2_2>=1))&&(Forks_2>=2)))||((((Forks_1>=1)&&(Outside_2>=1))&&(Neighbourhood_1_3>=1))&&(Forks_3>=1)))||((((Forks_1>=1)&&(Neighbourhood_2_1>=1))&&(Forks_2>=1))&&(Outside_3>=1)))||(((Forks_2>=2)&&(Neighbourhood_2_2>=1))&&(Outside_2>=1)))||(((Neighbourhood_3_3>=1)&&(Outside_2>=1))&&(Forks_3>=2)))||((((Neighbourhood_2_1>=1)&&(Forks_1>=1))&&(Forks_2>=1))&&(Outside_2>=1)))||((((Neighbourhood_1_3>=1)&&(Outside_1>=1))&&(Forks_1>=1))&&(Forks_3>=1)))||(((Neighbourhood_3_3>=1)&&(Forks_3>=2))&&(Outside_3>=1)))||((((Outside_1>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Forks_2>=1)))||(((Outside_1>=1)&&(Neighbourhood_1_1>=1))&&(Forks_1>=2)))||((((Outside_3>=1)&&(Forks_1>=1))&&(Forks_3>=1))&&(Neighbourhood_1_3>=1)))||((((Forks_1>=1)&&(Forks_2>=1))&&(Neighbourhood_1_2>=1))&&(Outside_3>=1)))")))))
Formula 7 simplified : !G(FG"((((((((Outside_3>=1)&&(Outside_1>=1))&&(Outside_2>=1))||(((Outside_1>=1)&&(Outside_2>=1))&&(Outside_3>=1)))||(((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)))||(((Outside_2>=1)&&(Outside_1>=1))&&(Outside_3>=1)))||(((Outside_1>=1)&&(Outside_3>=1))&&(Outside_2>=1)))||(((Outside_3>=1)&&(Outside_2>=1))&&(Outside_1>=1)))" U G"((((((((((((((((((((((((((((((Neighbourhood_1_2>=1)&&(Outside_2>=1))&&(Forks_2>=1))&&(Forks_1>=1))||(((Forks_1>=2)&&(Neighbourhood_1_1>=1))&&(Outside_2>=1)))||((((Neighbourhood_3_2>=1)&&(Forks_2>=1))&&(Forks_3>=1))&&(Outside_2>=1)))||((((Neighbourhood_1_2>=1)&&(Forks_2>=1))&&(Forks_1>=1))&&(Outside_1>=1)))||(((Forks_1>=2)&&(Outside_3>=1))&&(Neighbourhood_1_1>=1)))||((((Forks_2>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Outside_3>=1)))||((((Forks_2>=1)&&(Forks_1>=1))&&(Outside_1>=1))&&(Neighbourhood_2_1>=1)))||((((Outside_3>=1)&&(Neighbourhood_3_2>=1))&&(Forks_3>=1))&&(Forks_2>=1)))||((((Neighbourhood_3_1>=1)&&(Outside_3>=1))&&(Forks_3>=1))&&(Forks_1>=1)))||((((Forks_2>=1)&&(Outside_2>=1))&&(Neighbourhood_2_3>=1))&&(Forks_3>=1)))||((((Forks_1>=1)&&(Outside_2>=1))&&(Forks_3>=1))&&(Neighbourhood_3_1>=1)))||(((Neighbourhood_2_2>=1)&&(Forks_2>=2))&&(Outside_3>=1)))||((((Neighbourhood_3_1>=1)&&(Forks_3>=1))&&(Outside_1>=1))&&(Forks_1>=1)))||(((Neighbourhood_3_3>=1)&&(Forks_3>=2))&&(Outside_1>=1)))||((((Neighbourhood_3_2>=1)&&(Outside_1>=1))&&(Forks_3>=1))&&(Forks_2>=1)))||(((Outside_1>=1)&&(Neighbourhood_2_2>=1))&&(Forks_2>=2)))||((((Forks_1>=1)&&(Outside_2>=1))&&(Neighbourhood_1_3>=1))&&(Forks_3>=1)))||((((Forks_1>=1)&&(Neighbourhood_2_1>=1))&&(Forks_2>=1))&&(Outside_3>=1)))||(((Forks_2>=2)&&(Neighbourhood_2_2>=1))&&(Outside_2>=1)))||(((Neighbourhood_3_3>=1)&&(Outside_2>=1))&&(Forks_3>=2)))||((((Neighbourhood_2_1>=1)&&(Forks_1>=1))&&(Forks_2>=1))&&(Outside_2>=1)))||((((Neighbourhood_1_3>=1)&&(Outside_1>=1))&&(Forks_1>=1))&&(Forks_3>=1)))||(((Neighbourhood_3_3>=1)&&(Forks_3>=2))&&(Outside_3>=1)))||((((Outside_1>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Forks_2>=1)))||(((Outside_1>=1)&&(Neighbourhood_1_1>=1))&&(Forks_1>=2)))||((((Outside_3>=1)&&(Forks_1>=1))&&(Forks_3>=1))&&(Neighbourhood_1_3>=1)))||((((Forks_1>=1)&&(Forks_2>=1))&&(Neighbourhood_1_2>=1))&&(Outside_3>=1)))")
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.317085,25848,1,0,165,21068,187,100,2681,25740,327
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("(((Forks_1>=2)&&(Neighbourhood_1_1>=1))&&(Outside_2>=1))"))
Formula 8 simplified : !"(((Forks_1>=2)&&(Neighbourhood_1_1>=1))&&(Outside_2>=1))"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.3177,25848,1,0,165,21068,190,100,2681,25740,329
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(("((((Forks_3>=1)&&(Neighbourhood_3_3>=1))&&(Think_3>=1))&&(Neighbourhood_3_2>=1))"))
Formula 9 simplified : !"((((Forks_3>=1)&&(Neighbourhood_3_3>=1))&&(Think_3>=1))&&(Neighbourhood_3_2>=1))"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.318223,26112,1,0,165,21068,193,100,2681,25740,331
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((X(X("(((WaitRight_3>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1))")))U("(((Neighbourhood_2_2>=1)&&(Forks_2>=2))&&(Outside_3>=1))")))
Formula 10 simplified : !(XX"(((WaitRight_3>=1)&&(Forks_2>=1))&&(Neighbourhood_3_2>=1))" U "(((Neighbourhood_2_2>=1)&&(Forks_2>=2))&&(Outside_3>=1))")
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.343514,26632,1,0,174,22934,198,114,2681,29841,364
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X("(((Outside_3>=1)&&(Outside_1>=1))&&(Outside_2>=1))")))
Formula 11 simplified : !X"(((Outside_3>=1)&&(Outside_1>=1))&&(Outside_2>=1))"
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.3441,26632,1,0,174,22934,198,114,2681,29841,364
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G("((((Outside_1>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Forks_2>=1))")))
Formula 12 simplified : !G"((((Outside_1>=1)&&(Forks_3>=1))&&(Neighbourhood_2_3>=1))&&(Forks_2>=1))"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.344926,26896,1,0,174,22934,204,114,2681,29841,369
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F("(((Outside_1>=1)&&(Outside_2>=1))&&(Outside_3>=1))")))
Formula 13 simplified : !F"(((Outside_1>=1)&&(Outside_2>=1))&&(Outside_3>=1))"
Computing Next relation with stutter on 45 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.345355,26896,1,0,174,22934,210,114,2681,29841,373
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(F(G("((((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1))")))))
Formula 14 simplified : !GFG"((((Neighbourhood_1_3>=1)&&(Forks_3>=1))&&(Neighbourhood_3_2>=1))&&(Think_3>=1))"
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.36519,27404,1,0,209,25105,223,149,2681,34603,463
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("((((Neighbourhood_3_2>=1)&&(Forks_2>=1))&&(Think_2>=1))&&(Neighbourhood_2_3>=1))"))
Formula 15 simplified : !"((((Neighbourhood_3_2>=1)&&(Forks_2>=1))&&(Think_2>=1))&&(Neighbourhood_2_3>=1))"
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.365875,27404,1,0,209,25105,226,149,2681,34603,465
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 57
// Phase 1: matrix 57 rows 30 cols
invariant :Think_1 + HasLeft_1 + WaitLeft_1 + Outside_1 = 1
invariant :-1'WaitLeft_2 + HasRight_2 + WaitRight_2 + -1'HasLeft_2 = 0
invariant :Neighbourhood_1_1 + Neighbourhood_2_1 + Neighbourhood_3_1 + Outside_1 = 1
invariant :Neighbourhood_1_2 + Think_3 + Neighbourhood_2_2 + -1'Neighbourhood_3_3 + Neighbourhood_1_1 + Neighbourhood_2_1 + WaitRight_3 + HasRight_3 + Outside_2 + Outside_1 = 2
invariant :Neighbourhood_1_2 + Neighbourhood_1_1 + Neighbourhood_1_3 + Outside_1 = 1
invariant :WaitRight_1 + HasRight_1 + -1'HasLeft_1 + -1'WaitLeft_1 = 0
invariant :Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_1 + Outside_2 = 1
invariant :HasLeft_3 + WaitLeft_3 + -1'WaitRight_3 + -1'HasRight_3 = 0
invariant :WaitLeft_2 + Think_2 + HasLeft_2 + Outside_2 = 1
invariant :-1'Neighbourhood_1_2 + -1'Neighbourhood_2_2 + Outside_3 + Neighbourhood_3_3 + -1'Neighbourhood_1_1 + -1'Neighbourhood_2_1 + -1'Outside_2 + -1'Outside_1 = -1
invariant :Neighbourhood_1_2 + Neighbourhood_2_2 + Neighbourhood_3_2 + Outside_2 = 1
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527494085515

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 7:54:43 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
May 28, 2018 7:54:43 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 7:54:44 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 62 ms
May 28, 2018 7:54:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
May 28, 2018 7:54:44 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
May 28, 2018 7:54:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 15 ms
May 28, 2018 7:54:44 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 83 ms
May 28, 2018 7:54:44 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
May 28, 2018 7:54:44 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 ms
May 28, 2018 7:54:44 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 84 transitions.
May 28, 2018 7:54:45 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 15 ms
Skipping mayMatrices nes/nds SMT solver raised an exception :(error "Failed to assert expression: java.io.IOException: Stream closed (or (tr3 0) (tr4 0) (tr18 0) (tr33 0) (tr44 0) (tr49 0) (tr50 0) (tr52 0) (tr55 0) (tr61 0) (tr73 0) (tr79 0))")
java.lang.RuntimeException: SMT solver raised an exception :(error "Failed to assert expression: java.io.IOException: Stream closed (or (tr3 0) (tr4 0) (tr18 0) (tr33 0) (tr44 0) (tr49 0) (tr50 0) (tr52 0) (tr55 0) (tr61 0) (tr73 0) (tr79 0))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.assertCouldModifyNext(KInductionSolver.java:212)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:90)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 7:54:45 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 461ms conformant to PINS in folder :/home/mcc/execution

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r260-csrt-152732585500250"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;