About the Execution of ITS-Tools.L for PhilosophersDyn-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15745.060 | 4567.00 | 9976.00 | 165.10 | FFFFFFFFFFFFFTFF | normal |
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 itstoolsl
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 r261-csrt-152732586100250
=====================================================================
--------------------
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 1527509933727
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph1572232193646181314.txt, -o, /tmp/graph1572232193646181314.bin, -w, /tmp/graph1572232193646181314.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph1572232193646181314.bin, -l, -1, -v, -w, /tmp/graph1572232193646181314.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/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.201805241334/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 : !(("((((i2.u3.Forks_3>=1)&&(i2.u3.WaitLeft_3>=1))||((i1.u4.WaitLeft_1>=1)&&(i1.u4.Forks_1>=1)))||((i0.u2.Forks_2>=1)&&(i0.u2.WaitLeft_2>=1)))"))
Formula 0 simplified : !"((((i2.u3.Forks_3>=1)&&(i2.u3.WaitLeft_3>=1))||((i1.u4.WaitLeft_1>=1)&&(i1.u4.Forks_1>=1)))||((i0.u2.Forks_2>=1)&&(i0.u2.WaitLeft_2>=1)))"
built 7 ordering constraints for composite.
built 47 ordering constraints for composite.
built 47 ordering constraints for composite.
built 47 ordering constraints for composite.
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) :41/31/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.166333,18976,1,0,2384,1439,1345,5342,852,3620,11845
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 USE_NUPN
Checking formula 1 : !((G("((((((((((((((((((((((((((((((i0.u2.Think_2>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Neighbourhood_1_2>=1))&&(i0.u2.Forks_2>=1))||((((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1)))||((((i1.u4.Neighbourhood_1_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||((((i2.u3.Forks_3>=1)&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i2.u3.Think_3>=1)))||((((i2.u3.Forks_3>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Neighbourhood_1_1>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i1.u4.Think_1>=1))&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Neighbourhood_2_3>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Forks_3>=1))&&(i2.u3.Think_3>=1)))||((((i2.u3.Neighbourhood_3_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_3>=1)))||((((i0.u2.Think_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Think_2>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_1>=1)))||((((i0.u2.Neighbourhood_2_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||((((i1.u4.Neighbourhood_1_1>=1)&&(i1.u4.Think_1>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i1.u4.Forks_1>=1)))||((((i2.u3.Forks_3>=1)&&(i2.u3.Think_3>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_3>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||(((i2.u3.Think_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Think_3>=1))&&(i0.u2.Neighbourhood_2_3>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Forks_2>=1)))||((((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1)))||(((i0.u2.Forks_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_2>=2)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1)))||(((i1.u4.Neighbourhood_1_1>=2)&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Forks_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_2>=1))&&(i1.u4.Neighbourhood_1_2>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Neighbourhood_1_3>=1)))")))
Formula 1 simplified : !G"((((((((((((((((((((((((((((((i0.u2.Think_2>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Neighbourhood_1_2>=1))&&(i0.u2.Forks_2>=1))||((((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1)))||((((i1.u4.Neighbourhood_1_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||((((i2.u3.Forks_3>=1)&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i2.u3.Think_3>=1)))||((((i2.u3.Forks_3>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Neighbourhood_1_1>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i1.u4.Think_1>=1))&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Neighbourhood_2_3>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Forks_3>=1))&&(i2.u3.Think_3>=1)))||((((i2.u3.Neighbourhood_3_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_3>=1)))||((((i0.u2.Think_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Think_2>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_1>=1)))||((((i0.u2.Neighbourhood_2_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||((((i1.u4.Neighbourhood_1_1>=1)&&(i1.u4.Think_1>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i1.u4.Forks_1>=1)))||((((i2.u3.Forks_3>=1)&&(i2.u3.Think_3>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_3>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||(((i2.u3.Think_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Think_3>=1))&&(i0.u2.Neighbourhood_2_3>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Forks_2>=1)))||((((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1)))||(((i0.u2.Forks_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_2>=2)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1)))||(((i1.u4.Neighbourhood_1_1>=2)&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Forks_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_2>=1))&&(i1.u4.Neighbourhood_1_2>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.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
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.182203,19256,1,0,2384,1439,1802,5342,970,3620,11885
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 USE_NUPN
Checking formula 2 : !(((F(X(G("(((i1.u4.Think_1>=1)||(i2.u3.Think_3>=1))||(i0.u2.Think_2>=1))"))))U((F("((((((((((((((((((((((((((((((i0.u2.Think_2>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Neighbourhood_1_2>=1))&&(i0.u2.Forks_2>=1))||((((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1)))||((((i1.u4.Neighbourhood_1_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||((((i2.u3.Forks_3>=1)&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i2.u3.Think_3>=1)))||((((i2.u3.Forks_3>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Neighbourhood_1_1>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i1.u4.Think_1>=1))&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Neighbourhood_2_3>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Forks_3>=1))&&(i2.u3.Think_3>=1)))||((((i2.u3.Neighbourhood_3_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_3>=1)))||((((i0.u2.Think_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Think_2>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_1>=1)))||((((i0.u2.Neighbourhood_2_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||((((i1.u4.Neighbourhood_1_1>=1)&&(i1.u4.Think_1>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i1.u4.Forks_1>=1)))||((((i2.u3.Forks_3>=1)&&(i2.u3.Think_3>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_3>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||(((i2.u3.Think_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Think_3>=1))&&(i0.u2.Neighbourhood_2_3>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Forks_2>=1)))||((((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1)))||(((i0.u2.Forks_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_2>=2)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1)))||(((i1.u4.Neighbourhood_1_1>=2)&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Forks_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_2>=1))&&(i1.u4.Neighbourhood_1_2>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Neighbourhood_1_3>=1)))"))U(F("(((((((((((i1.u1.WaitRight_1>=1)&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=1))||(((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u0.WaitRight_2>=1)))||(((i0.u2.Neighbourhood_2_1>=1)&&(i0.u0.WaitRight_2>=1))&&(i1.u4.Forks_1>=1)))||(((i1.u4.Forks_1>=1)&&(i2.u3.Neighbourhood_3_1>=1))&&(i2.u5.WaitRight_3>=1)))||(((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i1.u1.WaitRight_1>=1)))||(((i2.u5.WaitRight_3>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||(((i1.u1.WaitRight_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i0.u2.Forks_2>=1)))||(((i0.u2.Forks_2>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u0.WaitRight_2>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i2.u5.WaitRight_3>=1))&&(i2.u3.Forks_3>=1)))")))))
Formula 2 simplified : !(FXG"(((i1.u4.Think_1>=1)||(i2.u3.Think_3>=1))||(i0.u2.Think_2>=1))" U (F"((((((((((((((((((((((((((((((i0.u2.Think_2>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Neighbourhood_1_2>=1))&&(i0.u2.Forks_2>=1))||((((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1)))||((((i1.u4.Neighbourhood_1_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||((((i2.u3.Forks_3>=1)&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i2.u3.Think_3>=1)))||((((i2.u3.Forks_3>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Neighbourhood_1_1>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i1.u4.Think_1>=1))&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Neighbourhood_2_3>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Forks_3>=1))&&(i2.u3.Think_3>=1)))||((((i2.u3.Neighbourhood_3_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_3>=1)))||((((i0.u2.Think_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Think_2>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_1>=1)))||((((i0.u2.Neighbourhood_2_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||((((i1.u4.Neighbourhood_1_1>=1)&&(i1.u4.Think_1>=1))&&(i2.u3.Neighbourhood_3_1>=1))&&(i1.u4.Forks_1>=1)))||((((i2.u3.Forks_3>=1)&&(i2.u3.Think_3>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Neighbourhood_3_3>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||(((i2.u3.Think_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_3>=2)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Think_3>=1))&&(i0.u2.Neighbourhood_2_3>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Forks_2>=1)))||((((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1)))||(((i0.u2.Forks_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_2>=2)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1)))||(((i1.u4.Neighbourhood_1_1>=2)&&(i1.u4.Think_1>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Forks_2>=1)&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_2>=1))&&(i1.u4.Neighbourhood_1_2>=1)))||((((i1.u4.Think_1>=1)&&(i1.u4.Forks_1>=1))&&(i0.u2.Neighbourhood_2_1>=1))&&(i1.u4.Neighbourhood_1_3>=1)))" U F"(((((((((((i1.u1.WaitRight_1>=1)&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=1))||(((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u0.WaitRight_2>=1)))||(((i0.u2.Neighbourhood_2_1>=1)&&(i0.u0.WaitRight_2>=1))&&(i1.u4.Forks_1>=1)))||(((i1.u4.Forks_1>=1)&&(i2.u3.Neighbourhood_3_1>=1))&&(i2.u5.WaitRight_3>=1)))||(((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i1.u1.WaitRight_1>=1)))||(((i2.u5.WaitRight_3>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||(((i1.u1.WaitRight_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i0.u2.Forks_2>=1)))||(((i0.u2.Forks_2>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u0.WaitRight_2>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i2.u5.WaitRight_3>=1))&&(i2.u3.Forks_3>=1)))"))
Computing Next relation with stutter on 45 deadlock states
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 :i0:u2:WaitLeft_2 + -1'i0:u2:Neighbourhood_2_2 + i0:u2:Think_2 + i0:u2:HasLeft_2 + -1'i1:u4:Neighbourhood_1_2 + -1'i2:u3:Neighbourhood_3_2 = 0
invariant :i1:u1:WaitRight_1 + i1:u1:HasRight_1 + -1'i1:u4:HasLeft_1 + -1'i1:u4:WaitLeft_1 = 0
invariant :i2:u3:Outside_3 + i2:u3:Neighbourhood_3_3 + i2:u3:Neighbourhood_3_2 + i2:u3:Neighbourhood_3_1 = 1
invariant :i0:u2:Neighbourhood_2_2 + i0:u2:Outside_2 + i1:u4:Neighbourhood_1_2 + i2:u3:Neighbourhood_3_2 = 1
invariant :i0:u0:HasRight_2 + i0:u0:WaitRight_2 + -1'i0:u2:WaitLeft_2 + -1'i0:u2:HasLeft_2 = 0
invariant :-1'i0:u2:Neighbourhood_2_1 + i1:u4:Neighbourhood_1_2 + i1:u4:Neighbourhood_1_3 + -1'i2:u3:Neighbourhood_3_1 = 0
invariant :i0:u2:Neighbourhood_2_1 + i1:u4:Neighbourhood_1_1 + i1:u4:Outside_1 + i2:u3:Neighbourhood_3_1 = 1
invariant :i0:u2:Neighbourhood_2_3 + i0:u2:Neighbourhood_2_1 + -1'i1:u4:Neighbourhood_1_2 + -1'i2:u3:Neighbourhood_3_2 = 0
invariant :-1'i0:u2:Neighbourhood_2_1 + i1:u4:Think_1 + -1'i1:u4:Neighbourhood_1_1 + i1:u4:HasLeft_1 + i1:u4:WaitLeft_1 + -1'i2:u3:Neighbourhood_3_1 = 0
invariant :i2:u3:HasLeft_3 + i2:u3:WaitLeft_3 + -1'i2:u5:WaitRight_3 + -1'i2:u5:HasRight_3 = 0
invariant :i2:u3:Think_3 + -1'i2:u3:Neighbourhood_3_3 + -1'i2:u3:Neighbourhood_3_2 + -1'i2:u3:Neighbourhood_3_1 + i2:u5:WaitRight_3 + i2:u5:HasRight_3 = 0
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.210213,21296,1,0,3986,1467,1896,7138,973,3844,20370
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 USE_NUPN
Checking formula 3 : !((X("((((i2.u3.Forks_3>=1)&&(i2.u3.WaitLeft_3>=1))||((i1.u4.WaitLeft_1>=1)&&(i1.u4.Forks_1>=1)))||((i0.u2.Forks_2>=1)&&(i0.u2.WaitLeft_2>=1)))")))
Formula 3 simplified : !X"((((i2.u3.Forks_3>=1)&&(i2.u3.WaitLeft_3>=1))||((i1.u4.WaitLeft_1>=1)&&(i1.u4.Forks_1>=1)))||((i0.u2.Forks_2>=1)&&(i0.u2.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.213859,21560,1,0,4121,1468,1896,7387,973,3877,21416
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 USE_NUPN
Checking formula 4 : !(("((((i2.u3.Forks_3>=1)&&(i2.u3.WaitLeft_3>=1))||((i1.u4.WaitLeft_1>=1)&&(i1.u4.Forks_1>=1)))||((i0.u2.Forks_2>=1)&&(i0.u2.WaitLeft_2>=1)))"))
Formula 4 simplified : !"((((i2.u3.Forks_3>=1)&&(i2.u3.WaitLeft_3>=1))||((i1.u4.WaitLeft_1>=1)&&(i1.u4.Forks_1>=1)))||((i0.u2.Forks_2>=1)&&(i0.u2.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.214517,21560,1,0,4121,1468,1896,7387,973,3877,21416
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 USE_NUPN
Checking formula 5 : !((("(((((((((((i1.u1.WaitRight_1>=1)&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=1))||(((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u0.WaitRight_2>=1)))||(((i0.u2.Neighbourhood_2_1>=1)&&(i0.u0.WaitRight_2>=1))&&(i1.u4.Forks_1>=1)))||(((i1.u4.Forks_1>=1)&&(i2.u3.Neighbourhood_3_1>=1))&&(i2.u5.WaitRight_3>=1)))||(((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i1.u1.WaitRight_1>=1)))||(((i2.u5.WaitRight_3>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||(((i1.u1.WaitRight_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i0.u2.Forks_2>=1)))||(((i0.u2.Forks_2>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u0.WaitRight_2>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i2.u5.WaitRight_3>=1))&&(i2.u3.Forks_3>=1)))")U(X("((((((((i2.u3.Outside_3>=1)&&(i1.u4.Outside_1>=1))&&(i0.u2.Outside_2>=1))||(((i1.u4.Outside_1>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Outside_3>=1)))||(((i2.u3.Outside_3>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Outside_1>=1)))||(((i0.u2.Outside_2>=1)&&(i1.u4.Outside_1>=1))&&(i2.u3.Outside_3>=1)))||(((i1.u4.Outside_1>=1)&&(i2.u3.Outside_3>=1))&&(i0.u2.Outside_2>=1)))||(((i2.u3.Outside_3>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Outside_1>=1)))"))))
Formula 5 simplified : !("(((((((((((i1.u1.WaitRight_1>=1)&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=1))||(((i2.u3.Forks_3>=1)&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u0.WaitRight_2>=1)))||(((i0.u2.Neighbourhood_2_1>=1)&&(i0.u0.WaitRight_2>=1))&&(i1.u4.Forks_1>=1)))||(((i1.u4.Forks_1>=1)&&(i2.u3.Neighbourhood_3_1>=1))&&(i2.u5.WaitRight_3>=1)))||(((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i1.u1.WaitRight_1>=1)))||(((i2.u5.WaitRight_3>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1)))||(((i1.u1.WaitRight_1>=1)&&(i1.u4.Neighbourhood_1_2>=1))&&(i0.u2.Forks_2>=1)))||(((i0.u2.Forks_2>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u0.WaitRight_2>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i2.u5.WaitRight_3>=1))&&(i2.u3.Forks_3>=1)))" U X"((((((((i2.u3.Outside_3>=1)&&(i1.u4.Outside_1>=1))&&(i0.u2.Outside_2>=1))||(((i1.u4.Outside_1>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Outside_3>=1)))||(((i2.u3.Outside_3>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Outside_1>=1)))||(((i0.u2.Outside_2>=1)&&(i1.u4.Outside_1>=1))&&(i2.u3.Outside_3>=1)))||(((i1.u4.Outside_1>=1)&&(i2.u3.Outside_3>=1))&&(i0.u2.Outside_2>=1)))||(((i2.u3.Outside_3>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.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.218512,21560,1,0,4121,1468,1926,7387,973,3877,21424
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 USE_NUPN
Checking formula 6 : !((G(X(F(X(F("((((i2.u3.Forks_3>=1)&&(i2.u3.WaitLeft_3>=1))||((i1.u4.WaitLeft_1>=1)&&(i1.u4.Forks_1>=1)))||((i0.u2.Forks_2>=1)&&(i0.u2.WaitLeft_2>=1)))")))))))
Formula 6 simplified : !GXFXF"((((i2.u3.Forks_3>=1)&&(i2.u3.WaitLeft_3>=1))||((i1.u4.WaitLeft_1>=1)&&(i1.u4.Forks_1>=1)))||((i0.u2.Forks_2>=1)&&(i0.u2.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
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.241179,22320,1,0,5710,1500,1932,9567,973,4028,28713
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 USE_NUPN
Checking formula 7 : !((G((F(G("((((((((i2.u3.Outside_3>=1)&&(i1.u4.Outside_1>=1))&&(i0.u2.Outside_2>=1))||(((i1.u4.Outside_1>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Outside_3>=1)))||(((i2.u3.Outside_3>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Outside_1>=1)))||(((i0.u2.Outside_2>=1)&&(i1.u4.Outside_1>=1))&&(i2.u3.Outside_3>=1)))||(((i1.u4.Outside_1>=1)&&(i2.u3.Outside_3>=1))&&(i0.u2.Outside_2>=1)))||(((i2.u3.Outside_3>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Outside_1>=1)))")))U(G("((((((((((((((((((((((((((((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Outside_2>=1))&&(i0.u2.Forks_2>=1))&&(i1.u4.Forks_1>=1))||(((i1.u4.Forks_1>=2)&&(i1.u4.Neighbourhood_1_1>=1))&&(i0.u2.Outside_2>=1)))||((((i2.u3.Neighbourhood_3_2>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Forks_3>=1))&&(i0.u2.Outside_2>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Forks_2>=1))&&(i1.u4.Forks_1>=1))&&(i1.u4.Outside_1>=1)))||(((i1.u4.Forks_1>=2)&&(i2.u3.Outside_3>=1))&&(i1.u4.Neighbourhood_1_1>=1)))||((((i0.u2.Forks_2>=1)&&(i2.u3.Forks_3>=1))&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Outside_3>=1)))||((((i0.u2.Forks_2>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Outside_1>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i2.u3.Outside_3>=1)&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Forks_3>=1))&&(i0.u2.Forks_2>=1)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Outside_3>=1))&&(i2.u3.Forks_3>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Forks_2>=1)&&(i0.u2.Outside_2>=1))&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Forks_3>=1)))||((((i1.u4.Forks_1>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_1>=1)))||(((i0.u2.Neighbourhood_2_2>=1)&&(i0.u2.Forks_2>=2))&&(i2.u3.Outside_3>=1)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Forks_3>=1))&&(i1.u4.Outside_1>=1))&&(i1.u4.Forks_1>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i2.u3.Forks_3>=2))&&(i1.u4.Outside_1>=1)))||((((i2.u3.Neighbourhood_3_2>=1)&&(i1.u4.Outside_1>=1))&&(i2.u3.Forks_3>=1))&&(i0.u2.Forks_2>=1)))||(((i1.u4.Outside_1>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Forks_2>=2)))||((((i1.u4.Forks_1>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Forks_3>=1)))||((((i1.u4.Forks_1>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i0.u2.Forks_2>=1))&&(i2.u3.Outside_3>=1)))||(((i0.u2.Forks_2>=2)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Outside_2>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Forks_3>=2)))||((((i0.u2.Neighbourhood_2_1>=1)&&(i1.u4.Forks_1>=1))&&(i0.u2.Forks_2>=1))&&(i0.u2.Outside_2>=1)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i1.u4.Outside_1>=1))&&(i1.u4.Forks_1>=1))&&(i2.u3.Forks_3>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i2.u3.Forks_3>=2))&&(i2.u3.Outside_3>=1)))||((((i1.u4.Outside_1>=1)&&(i2.u3.Forks_3>=1))&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u2.Forks_2>=1)))||(((i1.u4.Outside_1>=1)&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=2)))||((((i2.u3.Outside_3>=1)&&(i1.u4.Forks_1>=1))&&(i2.u3.Forks_3>=1))&&(i1.u4.Neighbourhood_1_3>=1)))||((((i1.u4.Forks_1>=1)&&(i0.u2.Forks_2>=1))&&(i1.u4.Neighbourhood_1_2>=1))&&(i2.u3.Outside_3>=1)))")))))
Formula 7 simplified : !G(FG"((((((((i2.u3.Outside_3>=1)&&(i1.u4.Outside_1>=1))&&(i0.u2.Outside_2>=1))||(((i1.u4.Outside_1>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Outside_3>=1)))||(((i2.u3.Outside_3>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Outside_1>=1)))||(((i0.u2.Outside_2>=1)&&(i1.u4.Outside_1>=1))&&(i2.u3.Outside_3>=1)))||(((i1.u4.Outside_1>=1)&&(i2.u3.Outside_3>=1))&&(i0.u2.Outside_2>=1)))||(((i2.u3.Outside_3>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Outside_1>=1)))" U G"((((((((((((((((((((((((((((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Outside_2>=1))&&(i0.u2.Forks_2>=1))&&(i1.u4.Forks_1>=1))||(((i1.u4.Forks_1>=2)&&(i1.u4.Neighbourhood_1_1>=1))&&(i0.u2.Outside_2>=1)))||((((i2.u3.Neighbourhood_3_2>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Forks_3>=1))&&(i0.u2.Outside_2>=1)))||((((i1.u4.Neighbourhood_1_2>=1)&&(i0.u2.Forks_2>=1))&&(i1.u4.Forks_1>=1))&&(i1.u4.Outside_1>=1)))||(((i1.u4.Forks_1>=2)&&(i2.u3.Outside_3>=1))&&(i1.u4.Neighbourhood_1_1>=1)))||((((i0.u2.Forks_2>=1)&&(i2.u3.Forks_3>=1))&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Outside_3>=1)))||((((i0.u2.Forks_2>=1)&&(i1.u4.Forks_1>=1))&&(i1.u4.Outside_1>=1))&&(i0.u2.Neighbourhood_2_1>=1)))||((((i2.u3.Outside_3>=1)&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Forks_3>=1))&&(i0.u2.Forks_2>=1)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Outside_3>=1))&&(i2.u3.Forks_3>=1))&&(i1.u4.Forks_1>=1)))||((((i0.u2.Forks_2>=1)&&(i0.u2.Outside_2>=1))&&(i0.u2.Neighbourhood_2_3>=1))&&(i2.u3.Forks_3>=1)))||((((i1.u4.Forks_1>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_1>=1)))||(((i0.u2.Neighbourhood_2_2>=1)&&(i0.u2.Forks_2>=2))&&(i2.u3.Outside_3>=1)))||((((i2.u3.Neighbourhood_3_1>=1)&&(i2.u3.Forks_3>=1))&&(i1.u4.Outside_1>=1))&&(i1.u4.Forks_1>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i2.u3.Forks_3>=2))&&(i1.u4.Outside_1>=1)))||((((i2.u3.Neighbourhood_3_2>=1)&&(i1.u4.Outside_1>=1))&&(i2.u3.Forks_3>=1))&&(i0.u2.Forks_2>=1)))||(((i1.u4.Outside_1>=1)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Forks_2>=2)))||((((i1.u4.Forks_1>=1)&&(i0.u2.Outside_2>=1))&&(i1.u4.Neighbourhood_1_3>=1))&&(i2.u3.Forks_3>=1)))||((((i1.u4.Forks_1>=1)&&(i0.u2.Neighbourhood_2_1>=1))&&(i0.u2.Forks_2>=1))&&(i2.u3.Outside_3>=1)))||(((i0.u2.Forks_2>=2)&&(i0.u2.Neighbourhood_2_2>=1))&&(i0.u2.Outside_2>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Forks_3>=2)))||((((i0.u2.Neighbourhood_2_1>=1)&&(i1.u4.Forks_1>=1))&&(i0.u2.Forks_2>=1))&&(i0.u2.Outside_2>=1)))||((((i1.u4.Neighbourhood_1_3>=1)&&(i1.u4.Outside_1>=1))&&(i1.u4.Forks_1>=1))&&(i2.u3.Forks_3>=1)))||(((i2.u3.Neighbourhood_3_3>=1)&&(i2.u3.Forks_3>=2))&&(i2.u3.Outside_3>=1)))||((((i1.u4.Outside_1>=1)&&(i2.u3.Forks_3>=1))&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u2.Forks_2>=1)))||(((i1.u4.Outside_1>=1)&&(i1.u4.Neighbourhood_1_1>=1))&&(i1.u4.Forks_1>=2)))||((((i2.u3.Outside_3>=1)&&(i1.u4.Forks_1>=1))&&(i2.u3.Forks_3>=1))&&(i1.u4.Neighbourhood_1_3>=1)))||((((i1.u4.Forks_1>=1)&&(i0.u2.Forks_2>=1))&&(i1.u4.Neighbourhood_1_2>=1))&&(i2.u3.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.262957,22824,1,0,6060,1515,2234,10165,1005,4151,32134
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 USE_NUPN
Checking formula 8 : !(("(((i1.u4.Forks_1>=2)&&(i1.u4.Neighbourhood_1_1>=1))&&(i0.u2.Outside_2>=1))"))
Formula 8 simplified : !"(((i1.u4.Forks_1>=2)&&(i1.u4.Neighbourhood_1_1>=1))&&(i0.u2.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.263634,23088,1,0,6060,1515,2236,10165,1005,4151,32137
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 USE_NUPN
Checking formula 9 : !(("((((i2.u3.Forks_3>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))"))
Formula 9 simplified : !"((((i2.u3.Forks_3>=1)&&(i2.u3.Neighbourhood_3_3>=1))&&(i2.u3.Think_3>=1))&&(i2.u3.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
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.264069,23088,1,0,6060,1515,2240,10165,1012,4151,32142
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 USE_NUPN
Checking formula 10 : !(((X(X("(((i2.u5.WaitRight_3>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1))")))U("(((i0.u2.Neighbourhood_2_2>=1)&&(i0.u2.Forks_2>=2))&&(i2.u3.Outside_3>=1))")))
Formula 10 simplified : !(XX"(((i2.u5.WaitRight_3>=1)&&(i0.u2.Forks_2>=1))&&(i2.u3.Neighbourhood_3_2>=1))" U "(((i0.u2.Neighbourhood_2_2>=1)&&(i0.u2.Forks_2>=2))&&(i2.u3.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
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.27531,23344,1,0,6866,1520,2253,11078,1012,4181,34764
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 USE_NUPN
Checking formula 11 : !((X("(((i2.u3.Outside_3>=1)&&(i1.u4.Outside_1>=1))&&(i0.u2.Outside_2>=1))")))
Formula 11 simplified : !X"(((i2.u3.Outside_3>=1)&&(i1.u4.Outside_1>=1))&&(i0.u2.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.275985,23608,1,0,6866,1520,2255,11078,1012,4181,34768
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 USE_NUPN
Checking formula 12 : !((G("((((i1.u4.Outside_1>=1)&&(i2.u3.Forks_3>=1))&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u2.Forks_2>=1))")))
Formula 12 simplified : !G"((((i1.u4.Outside_1>=1)&&(i2.u3.Forks_3>=1))&&(i0.u2.Neighbourhood_2_3>=1))&&(i0.u2.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.276705,23608,1,0,6866,1520,2264,11078,1012,4181,34775
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 USE_NUPN
Checking formula 13 : !((F("(((i1.u4.Outside_1>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.Outside_3>=1))")))
Formula 13 simplified : !F"(((i1.u4.Outside_1>=1)&&(i0.u2.Outside_2>=1))&&(i2.u3.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.27713,23608,1,0,6866,1520,2272,11078,1012,4181,34782
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA PhilosophersDyn-PT-03-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(F(G("((((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.Think_3>=1))")))))
Formula 14 simplified : !GFG"((((i1.u4.Neighbourhood_1_3>=1)&&(i2.u3.Forks_3>=1))&&(i2.u3.Neighbourhood_3_2>=1))&&(i2.u3.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
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.288998,23608,1,0,7717,1532,2294,12096,1012,4273,38065
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 USE_NUPN
Checking formula 15 : !(("((((i2.u3.Neighbourhood_3_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.Neighbourhood_2_3>=1))"))
Formula 15 simplified : !"((((i2.u3.Neighbourhood_3_2>=1)&&(i0.u2.Forks_2>=1))&&(i0.u2.Think_2>=1))&&(i0.u2.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.290182,23852,1,0,7717,1532,2296,12096,1012,4273,38068
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 USE_NUPN
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 1527509938294
--------------------
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/ -louvain -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/ -louvain -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 12:18:56 PM 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/, -louvain, -smt]
May 28, 2018 12:18:56 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 12:18:56 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 61 ms
May 28, 2018 12:18:56 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 30 places.
May 28, 2018 12:18:56 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 84 transitions.
May 28, 2018 12:18:56 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 18 ms
May 28, 2018 12:18:56 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 12:18:57 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 86 ms
May 28, 2018 12:18:57 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 22 ms
Begin: Mon May 28 12:18:57 2018
Computation of communities with the Newman-Girvan Modularity quality function
level 0:
start computation: Mon May 28 12:18:57 2018
network size: 30 nodes, 330 links, 168 weight
quality increased from -0.0467909 to 0.307061
end computation: Mon May 28 12:18:57 2018
level 1:
start computation: Mon May 28 12:18:57 2018
network size: 6 nodes, 30 links, 168 weight
quality increased from 0.307061 to 0.34127
end computation: Mon May 28 12:18:57 2018
level 2:
start computation: Mon May 28 12:18:57 2018
network size: 3 nodes, 9 links, 168 weight
quality increased from 0.34127 to 0.34127
end computation: Mon May 28 12:18:57 2018
End: Mon May 28 12:18:57 2018
Total duration: 0 sec
0.34127
May 28, 2018 12:18:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 12:18:57 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 27 ms
May 28, 2018 12:18:57 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 12:18:57 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 49 redundant transitions.
May 28, 2018 12:18:57 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
May 28, 2018 12:18:57 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms
May 28, 2018 12:18:57 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 2 identical transitions.
May 28, 2018 12:18:57 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 82 transitions.
May 28, 2018 12:18:58 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 11 ms
May 28, 2018 12:18:58 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
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 12:18:58 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 317ms 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="itstoolsl"
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 itstoolsl"
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 r261-csrt-152732586100250"
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 '
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 ;