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 436K
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 82K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Philosophers-PT-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-csrt-152732586100222
=====================================================================

--------------------
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 Philosophers-PT-000020-LTLFireability-00
FORMULA_NAME Philosophers-PT-000020-LTLFireability-01
FORMULA_NAME Philosophers-PT-000020-LTLFireability-02
FORMULA_NAME Philosophers-PT-000020-LTLFireability-03
FORMULA_NAME Philosophers-PT-000020-LTLFireability-04
FORMULA_NAME Philosophers-PT-000020-LTLFireability-05
FORMULA_NAME Philosophers-PT-000020-LTLFireability-06
FORMULA_NAME Philosophers-PT-000020-LTLFireability-07
FORMULA_NAME Philosophers-PT-000020-LTLFireability-08
FORMULA_NAME Philosophers-PT-000020-LTLFireability-09
FORMULA_NAME Philosophers-PT-000020-LTLFireability-10
FORMULA_NAME Philosophers-PT-000020-LTLFireability-11
FORMULA_NAME Philosophers-PT-000020-LTLFireability-12
FORMULA_NAME Philosophers-PT-000020-LTLFireability-13
FORMULA_NAME Philosophers-PT-000020-LTLFireability-14
FORMULA_NAME Philosophers-PT-000020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527507531082

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/graph7726933465731134635.txt, -o, /tmp/graph7726933465731134635.bin, -w, /tmp/graph7726933465731134635.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/graph7726933465731134635.bin, -l, -1, -v, -w, /tmp/graph7726933465731134635.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 : !((F(F(F(("(((((((((((((((((((((i7.u16.Fork_20>=1)&&(i7.u16.Think_1>=1))||((i2.u6.Fork_7>=1)&&(i2.u6.Think_8>=1)))||((i2.u1.Fork_8>=1)&&(i2.u1.Think_9>=1)))||((i0.u0.Think_6>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Think_7>=1)&&(i0.u18.Fork_6>=1)))||((i1.u5.Think_4>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u4.Think_5>=1)))||((i8.u3.Think_2>=1)&&(i8.u3.Fork_1>=1)))||((i8.u15.Fork_2>=1)&&(i8.u15.Think_3>=1)))||((i5.u9.Fork_16>=1)&&(i5.u9.Think_17>=1)))||((i5.u2.Think_16>=1)&&(i4.u13.Fork_15>=1)))||((i4.u13.Think_15>=1)&&(i4.u11.Fork_14>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_13>=1)))||((i6.u7.Fork_12>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Think_11>=1)&&(i3.u8.Fork_10>=1)))||((i3.u17.Fork_9>=1)&&(i3.u17.Think_10>=1)))||((i7.u19.Think_20>=1)&&(i7.u19.Fork_19>=1)))||((i7.u14.Think_19>=1)&&(i7.u14.Fork_18>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))")U("((((((((((((((((((((i1.u5.Eat_4>=1)||(i1.u4.Eat_5>=1))||(i8.u3.Eat_2>=1))||(i8.u15.Eat_3>=1))||(i2.u6.Eat_8>=1))||(i2.u1.Eat_9>=1))||(i0.u0.Eat_6>=1))||(i0.u18.Eat_7>=1))||(i7.u16.Eat_1>=1))||(i7.u14.Eat_19>=1))||(i5.u10.Eat_18>=1))||(i7.u19.Eat_20>=1))||(i4.u13.Eat_15>=1))||(i4.u11.Eat_14>=1))||(i5.u9.Eat_17>=1))||(i5.u2.Eat_16>=1))||(i3.u8.Eat_11>=1))||(i3.u17.Eat_10>=1))||(i6.u7.Eat_13>=1))||(i6.u12.Eat_12>=1))"))))))
Formula 0 simplified : !F("(((((((((((((((((((((i7.u16.Fork_20>=1)&&(i7.u16.Think_1>=1))||((i2.u6.Fork_7>=1)&&(i2.u6.Think_8>=1)))||((i2.u1.Fork_8>=1)&&(i2.u1.Think_9>=1)))||((i0.u0.Think_6>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Think_7>=1)&&(i0.u18.Fork_6>=1)))||((i1.u5.Think_4>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u4.Think_5>=1)))||((i8.u3.Think_2>=1)&&(i8.u3.Fork_1>=1)))||((i8.u15.Fork_2>=1)&&(i8.u15.Think_3>=1)))||((i5.u9.Fork_16>=1)&&(i5.u9.Think_17>=1)))||((i5.u2.Think_16>=1)&&(i4.u13.Fork_15>=1)))||((i4.u13.Think_15>=1)&&(i4.u11.Fork_14>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_13>=1)))||((i6.u7.Fork_12>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Think_11>=1)&&(i3.u8.Fork_10>=1)))||((i3.u17.Fork_9>=1)&&(i3.u17.Think_10>=1)))||((i7.u19.Think_20>=1)&&(i7.u19.Fork_19>=1)))||((i7.u14.Think_19>=1)&&(i7.u14.Fork_18>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))" U "((((((((((((((((((((i1.u5.Eat_4>=1)||(i1.u4.Eat_5>=1))||(i8.u3.Eat_2>=1))||(i8.u15.Eat_3>=1))||(i2.u6.Eat_8>=1))||(i2.u1.Eat_9>=1))||(i0.u0.Eat_6>=1))||(i0.u18.Eat_7>=1))||(i7.u16.Eat_1>=1))||(i7.u14.Eat_19>=1))||(i5.u10.Eat_18>=1))||(i7.u19.Eat_20>=1))||(i4.u13.Eat_15>=1))||(i4.u11.Eat_14>=1))||(i5.u9.Eat_17>=1))||(i5.u2.Eat_16>=1))||(i3.u8.Eat_11>=1))||(i3.u17.Eat_10>=1))||(i6.u7.Eat_13>=1))||(i6.u12.Eat_12>=1))")
built 18 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
19 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.220797,25208,1,0,25033,367,718,16921,227,763,23562
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((X("(((((((((((((((((((((i8.u3.Fork_1>=1)&&(i7.u16.Catch1_1>=1))||((i3.u17.Catch1_10>=1)&&(i3.u8.Fork_10>=1)))||((i6.u12.Fork_11>=1)&&(i3.u8.Catch1_11>=1)))||((i6.u12.Catch1_12>=1)&&(i6.u7.Fork_12>=1)))||((i6.u7.Catch1_13>=1)&&(i4.u11.Fork_13>=1)))||((i4.u11.Catch1_14>=1)&&(i4.u11.Fork_14>=1)))||((i4.u13.Catch1_15>=1)&&(i4.u13.Fork_15>=1)))||((i5.u2.Catch1_16>=1)&&(i5.u9.Fork_16>=1)))||((i5.u9.Catch1_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u3.Catch1_2>=1)&&(i8.u15.Fork_2>=1)))||((i8.u15.Catch1_3>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u5.Catch1_4>=1)))||((i1.u4.Catch1_5>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Catch1_6>=1)))||((i2.u6.Fork_7>=1)&&(i0.u18.Catch1_7>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Catch1_8>=1)))||((i2.u1.Catch1_9>=1)&&(i3.u17.Fork_9>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Catch1_20>=1)))||((i7.u14.Catch1_19>=1)&&(i7.u19.Fork_19>=1)))||((i5.u10.Catch1_18>=1)&&(i7.u14.Fork_18>=1)))"))U(G("(((((((((((((((((((((i7.u16.Fork_20>=1)&&(i7.u16.Think_1>=1))||((i2.u6.Fork_7>=1)&&(i2.u6.Think_8>=1)))||((i2.u1.Fork_8>=1)&&(i2.u1.Think_9>=1)))||((i0.u0.Think_6>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Think_7>=1)&&(i0.u18.Fork_6>=1)))||((i1.u5.Think_4>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u4.Think_5>=1)))||((i8.u3.Think_2>=1)&&(i8.u3.Fork_1>=1)))||((i8.u15.Fork_2>=1)&&(i8.u15.Think_3>=1)))||((i5.u9.Fork_16>=1)&&(i5.u9.Think_17>=1)))||((i5.u2.Think_16>=1)&&(i4.u13.Fork_15>=1)))||((i4.u13.Think_15>=1)&&(i4.u11.Fork_14>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_13>=1)))||((i6.u7.Fork_12>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Think_11>=1)&&(i3.u8.Fork_10>=1)))||((i3.u17.Fork_9>=1)&&(i3.u17.Think_10>=1)))||((i7.u19.Think_20>=1)&&(i7.u19.Fork_19>=1)))||((i7.u14.Think_19>=1)&&(i7.u14.Fork_18>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))")))U(F(G(G("(((((((((((((((((((((i1.u4.Think_5>=1)&&(i1.u4.Fork_5>=1))||((i1.u5.Think_4>=1)&&(i1.u5.Fork_4>=1)))||((i8.u15.Fork_3>=1)&&(i8.u15.Think_3>=1)))||((i8.u3.Think_2>=1)&&(i8.u15.Fork_2>=1)))||((i7.u16.Think_1>=1)&&(i8.u3.Fork_1>=1)))||((i4.u13.Think_15>=1)&&(i4.u13.Fork_15>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_14>=1)))||((i5.u10.Fork_17>=1)&&(i5.u9.Think_17>=1)))||((i5.u9.Fork_16>=1)&&(i5.u2.Think_16>=1)))||((i7.u19.Fork_19>=1)&&(i7.u14.Think_19>=1)))||((i7.u14.Fork_18>=1)&&(i5.u10.Think_18>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Think_20>=1)))||((i0.u18.Think_7>=1)&&(i2.u6.Fork_7>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Think_6>=1)))||((i2.u1.Think_9>=1)&&(i3.u17.Fork_9>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Think_8>=1)))||((i3.u8.Think_11>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Fork_10>=1)&&(i3.u17.Think_10>=1)))||((i4.u11.Fork_13>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u7.Fork_12>=1)))"))))))
Formula 1 simplified : !((X"(((((((((((((((((((((i8.u3.Fork_1>=1)&&(i7.u16.Catch1_1>=1))||((i3.u17.Catch1_10>=1)&&(i3.u8.Fork_10>=1)))||((i6.u12.Fork_11>=1)&&(i3.u8.Catch1_11>=1)))||((i6.u12.Catch1_12>=1)&&(i6.u7.Fork_12>=1)))||((i6.u7.Catch1_13>=1)&&(i4.u11.Fork_13>=1)))||((i4.u11.Catch1_14>=1)&&(i4.u11.Fork_14>=1)))||((i4.u13.Catch1_15>=1)&&(i4.u13.Fork_15>=1)))||((i5.u2.Catch1_16>=1)&&(i5.u9.Fork_16>=1)))||((i5.u9.Catch1_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u3.Catch1_2>=1)&&(i8.u15.Fork_2>=1)))||((i8.u15.Catch1_3>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u5.Catch1_4>=1)))||((i1.u4.Catch1_5>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Catch1_6>=1)))||((i2.u6.Fork_7>=1)&&(i0.u18.Catch1_7>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Catch1_8>=1)))||((i2.u1.Catch1_9>=1)&&(i3.u17.Fork_9>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Catch1_20>=1)))||((i7.u14.Catch1_19>=1)&&(i7.u19.Fork_19>=1)))||((i5.u10.Catch1_18>=1)&&(i7.u14.Fork_18>=1)))" U G"(((((((((((((((((((((i7.u16.Fork_20>=1)&&(i7.u16.Think_1>=1))||((i2.u6.Fork_7>=1)&&(i2.u6.Think_8>=1)))||((i2.u1.Fork_8>=1)&&(i2.u1.Think_9>=1)))||((i0.u0.Think_6>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Think_7>=1)&&(i0.u18.Fork_6>=1)))||((i1.u5.Think_4>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u4.Think_5>=1)))||((i8.u3.Think_2>=1)&&(i8.u3.Fork_1>=1)))||((i8.u15.Fork_2>=1)&&(i8.u15.Think_3>=1)))||((i5.u9.Fork_16>=1)&&(i5.u9.Think_17>=1)))||((i5.u2.Think_16>=1)&&(i4.u13.Fork_15>=1)))||((i4.u13.Think_15>=1)&&(i4.u11.Fork_14>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_13>=1)))||((i6.u7.Fork_12>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Think_11>=1)&&(i3.u8.Fork_10>=1)))||((i3.u17.Fork_9>=1)&&(i3.u17.Think_10>=1)))||((i7.u19.Think_20>=1)&&(i7.u19.Fork_19>=1)))||((i7.u14.Think_19>=1)&&(i7.u14.Fork_18>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))") U FG"(((((((((((((((((((((i1.u4.Think_5>=1)&&(i1.u4.Fork_5>=1))||((i1.u5.Think_4>=1)&&(i1.u5.Fork_4>=1)))||((i8.u15.Fork_3>=1)&&(i8.u15.Think_3>=1)))||((i8.u3.Think_2>=1)&&(i8.u15.Fork_2>=1)))||((i7.u16.Think_1>=1)&&(i8.u3.Fork_1>=1)))||((i4.u13.Think_15>=1)&&(i4.u13.Fork_15>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_14>=1)))||((i5.u10.Fork_17>=1)&&(i5.u9.Think_17>=1)))||((i5.u9.Fork_16>=1)&&(i5.u2.Think_16>=1)))||((i7.u19.Fork_19>=1)&&(i7.u14.Think_19>=1)))||((i7.u14.Fork_18>=1)&&(i5.u10.Think_18>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Think_20>=1)))||((i0.u18.Think_7>=1)&&(i2.u6.Fork_7>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Think_6>=1)))||((i2.u1.Think_9>=1)&&(i3.u17.Fork_9>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Think_8>=1)))||((i3.u8.Think_11>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Fork_10>=1)&&(i3.u17.Think_10>=1)))||((i4.u11.Fork_13>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u7.Fork_12>=1)))")
Computing Next relation with stutter on 2 deadlock states
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 100 rows 100 cols
invariant :i7:u16:Think_1 + i7:u16:Catch1_1 + -1'i8:u3:Fork_1 + -1'i8:u3:Catch1_2 + i8:u3:Catch2_2 + i8:u15:Fork_2 + i8:u15:Catch1_3 + i8:u15:Eat_3 = 1
invariant :i4:u11:Fork_13 + i4:u11:Catch1_14 + i4:u11:Eat_14 + i6:u7:Catch2_13 + i6:u7:Eat_13 = 1
invariant :i6:u12:Think_12 + i6:u12:Catch1_12 + i6:u12:Catch2_12 + i6:u12:Eat_12 = 1
invariant :i2:u1:Think_9 + i2:u1:Catch1_9 + -1'i3:u17:Fork_9 + -1'i3:u17:Catch1_10 + -1'i3:u17:Eat_10 = 0
invariant :i3:u8:Catch2_11 + i3:u8:Eat_11 + i6:u12:Fork_11 + i6:u12:Catch1_12 + i6:u12:Eat_12 = 1
invariant :i5:u2:Think_16 + i5:u2:Catch1_16 + -1'i5:u9:Fork_16 + -1'i5:u9:Catch1_17 + i5:u9:Catch2_17 + i5:u10:Fork_17 + i5:u10:Catch1_18 + -1'i5:u10:Catch2_18 + -1'i7:u14:Fork_18 + -1'i7:u14:Catch1_19 + i7:u14:Catch2_19 + i7:u19:Fork_19 + i7:u19:Catch1_20 + i7:u19:Eat_20 = 1
invariant :i7:u16:Fork_20 + i7:u16:Catch1_1 + -1'i7:u16:Catch2_1 + i7:u19:Catch2_20 + i7:u19:Eat_20 + -1'i8:u3:Fork_1 + -1'i8:u3:Catch1_2 + i8:u3:Catch2_2 + i8:u15:Fork_2 + i8:u15:Catch1_3 + i8:u15:Eat_3 = 1
invariant :i7:u14:Catch2_19 + i7:u14:Eat_19 + i7:u19:Fork_19 + i7:u19:Catch1_20 + i7:u19:Eat_20 = 1
invariant :i3:u8:Fork_10 + i3:u8:Catch1_11 + -1'i3:u8:Catch2_11 + i3:u17:Catch2_10 + i3:u17:Eat_10 + -1'i6:u12:Fork_11 + -1'i6:u12:Catch1_12 + -1'i6:u12:Eat_12 = 0
invariant :i8:u3:Think_2 + i8:u3:Catch1_2 + -1'i8:u15:Fork_2 + -1'i8:u15:Catch1_3 + -1'i8:u15:Eat_3 = 0
invariant :i8:u3:Catch2_2 + i8:u3:Eat_2 + i8:u15:Fork_2 + i8:u15:Catch1_3 + i8:u15:Eat_3 = 1
invariant :i0:u0:Catch1_6 + i0:u0:Eat_6 + i1:u4:Fork_5 + -1'i1:u4:Catch1_5 + i1:u4:Catch2_5 + -1'i1:u5:Fork_4 + i1:u5:Catch1_4 + -1'i1:u5:Catch2_4 + i8:u15:Fork_3 + i8:u15:Catch2_3 + i8:u15:Eat_3 = 1
invariant :i0:u0:Think_6 + i0:u0:Catch2_6 + -1'i1:u4:Fork_5 + i1:u4:Catch1_5 + -1'i1:u4:Catch2_5 + i1:u5:Fork_4 + -1'i1:u5:Catch1_4 + i1:u5:Catch2_4 + -1'i8:u15:Fork_3 + -1'i8:u15:Catch2_3 + -1'i8:u15:Eat_3 = 0
invariant :i2:u1:Catch2_9 + i2:u1:Eat_9 + i3:u17:Fork_9 + i3:u17:Catch1_10 + i3:u17:Eat_10 = 1
invariant :i5:u10:Catch2_18 + i5:u10:Eat_18 + i7:u14:Fork_18 + i7:u14:Catch1_19 + -1'i7:u14:Catch2_19 + -1'i7:u19:Fork_19 + -1'i7:u19:Catch1_20 + -1'i7:u19:Eat_20 = 0
invariant :i4:u13:Think_15 + i4:u13:Catch1_15 + i4:u13:Catch2_15 + i4:u13:Eat_15 = 1
invariant :i0:u18:Think_7 + i0:u18:Catch1_7 + -1'i2:u6:Fork_7 + -1'i2:u6:Catch1_8 + -1'i2:u6:Eat_8 = 0
invariant :i6:u7:Think_13 + i6:u7:Catch1_13 + i6:u7:Catch2_13 + i6:u7:Eat_13 = 1
invariant :i7:u16:Catch2_1 + i7:u16:Eat_1 + i8:u3:Fork_1 + i8:u3:Catch1_2 + -1'i8:u3:Catch2_2 + -1'i8:u15:Fork_2 + -1'i8:u15:Catch1_3 + -1'i8:u15:Eat_3 = 0
invariant :i2:u6:Think_8 + i2:u6:Catch1_8 + i2:u6:Catch2_8 + i2:u6:Eat_8 = 1
invariant :i4:u11:Fork_14 + i4:u11:Catch2_14 + i4:u11:Eat_14 + i4:u13:Catch1_15 + i4:u13:Eat_15 = 1
invariant :i3:u17:Think_10 + i3:u17:Catch1_10 + i3:u17:Catch2_10 + i3:u17:Eat_10 = 1
invariant :i6:u7:Fork_12 + i6:u7:Catch1_13 + i6:u7:Eat_13 + i6:u12:Catch2_12 + i6:u12:Eat_12 = 1
invariant :i4:u11:Think_14 + i4:u11:Catch1_14 + i4:u11:Catch2_14 + i4:u11:Eat_14 = 1
invariant :i7:u14:Think_19 + i7:u14:Catch1_19 + -1'i7:u19:Fork_19 + -1'i7:u19:Catch1_20 + -1'i7:u19:Eat_20 = 0
invariant :i8:u15:Think_3 + i8:u15:Catch1_3 + i8:u15:Catch2_3 + i8:u15:Eat_3 = 1
invariant :-1'i0:u0:Catch1_6 + i0:u0:Catch2_6 + i0:u18:Fork_6 + i0:u18:Catch1_7 + -1'i0:u18:Catch2_7 + -1'i1:u4:Fork_5 + i1:u4:Catch1_5 + -1'i1:u4:Catch2_5 + i1:u5:Fork_4 + -1'i1:u5:Catch1_4 + i1:u5:Catch2_4 + -1'i2:u6:Fork_7 + -1'i2:u6:Catch1_8 + -1'i2:u6:Eat_8 + -1'i8:u15:Fork_3 + -1'i8:u15:Catch2_3 + -1'i8:u15:Eat_3 = -1
invariant :i4:u13:Fork_15 + i4:u13:Catch2_15 + i4:u13:Eat_15 + i5:u2:Catch1_16 + -1'i5:u2:Catch2_16 + -1'i5:u9:Fork_16 + -1'i5:u9:Catch1_17 + i5:u9:Catch2_17 + i5:u10:Fork_17 + i5:u10:Catch1_18 + -1'i5:u10:Catch2_18 + -1'i7:u14:Fork_18 + -1'i7:u14:Catch1_19 + i7:u14:Catch2_19 + i7:u19:Fork_19 + i7:u19:Catch1_20 + i7:u19:Eat_20 = 1
invariant :i3:u8:Think_11 + i3:u8:Catch1_11 + -1'i6:u12:Fork_11 + -1'i6:u12:Catch1_12 + -1'i6:u12:Eat_12 = 0
invariant :i1:u5:Think_4 + i1:u5:Catch2_4 + -1'i8:u15:Fork_3 + -1'i8:u15:Catch2_3 + -1'i8:u15:Eat_3 = 0
invariant :i5:u9:Think_17 + i5:u9:Catch1_17 + -1'i5:u10:Fork_17 + -1'i5:u10:Catch1_18 + i5:u10:Catch2_18 + i7:u14:Fork_18 + i7:u14:Catch1_19 + -1'i7:u14:Catch2_19 + -1'i7:u19:Fork_19 + -1'i7:u19:Catch1_20 + -1'i7:u19:Eat_20 = 0
invariant :i0:u18:Catch2_7 + i0:u18:Eat_7 + i2:u6:Fork_7 + i2:u6:Catch1_8 + i2:u6:Eat_8 = 1
invariant :i1:u4:Think_5 + i1:u4:Catch2_5 + -1'i1:u5:Fork_4 + i1:u5:Catch1_4 + -1'i1:u5:Catch2_4 + i8:u15:Fork_3 + i8:u15:Catch2_3 + i8:u15:Eat_3 = 1
invariant :i1:u5:Catch1_4 + i1:u5:Eat_4 + i8:u15:Fork_3 + i8:u15:Catch2_3 + i8:u15:Eat_3 = 1
invariant :i5:u9:Catch2_17 + i5:u9:Eat_17 + i5:u10:Fork_17 + i5:u10:Catch1_18 + -1'i5:u10:Catch2_18 + -1'i7:u14:Fork_18 + -1'i7:u14:Catch1_19 + i7:u14:Catch2_19 + i7:u19:Fork_19 + i7:u19:Catch1_20 + i7:u19:Eat_20 = 1
invariant :i7:u19:Think_20 + i7:u19:Catch1_20 + i7:u19:Catch2_20 + i7:u19:Eat_20 = 1
invariant :i1:u4:Catch1_5 + i1:u4:Eat_5 + i1:u5:Fork_4 + -1'i1:u5:Catch1_4 + i1:u5:Catch2_4 + -1'i8:u15:Fork_3 + -1'i8:u15:Catch2_3 + -1'i8:u15:Eat_3 = 0
invariant :i5:u10:Think_18 + i5:u10:Catch1_18 + -1'i7:u14:Fork_18 + -1'i7:u14:Catch1_19 + i7:u14:Catch2_19 + i7:u19:Fork_19 + i7:u19:Catch1_20 + i7:u19:Eat_20 = 1
invariant :i5:u2:Catch2_16 + i5:u2:Eat_16 + i5:u9:Fork_16 + i5:u9:Catch1_17 + -1'i5:u9:Catch2_17 + -1'i5:u10:Fork_17 + -1'i5:u10:Catch1_18 + i5:u10:Catch2_18 + i7:u14:Fork_18 + i7:u14:Catch1_19 + -1'i7:u14:Catch2_19 + -1'i7:u19:Fork_19 + -1'i7:u19:Catch1_20 + -1'i7:u19:Eat_20 = 0
invariant :i2:u1:Fork_8 + i2:u1:Catch1_9 + -1'i2:u1:Catch2_9 + i2:u6:Catch2_8 + i2:u6:Eat_8 + -1'i3:u17:Fork_9 + -1'i3:u17:Catch1_10 + -1'i3:u17:Eat_10 = 0
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
314 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,3.36384,112912,1,0,217677,410,901,262623,233,1190,150806
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X("(((((((((((((((((((((i1.u4.Think_5>=1)&&(i1.u4.Fork_5>=1))||((i1.u5.Think_4>=1)&&(i1.u5.Fork_4>=1)))||((i8.u15.Fork_3>=1)&&(i8.u15.Think_3>=1)))||((i8.u3.Think_2>=1)&&(i8.u15.Fork_2>=1)))||((i7.u16.Think_1>=1)&&(i8.u3.Fork_1>=1)))||((i4.u13.Think_15>=1)&&(i4.u13.Fork_15>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_14>=1)))||((i5.u10.Fork_17>=1)&&(i5.u9.Think_17>=1)))||((i5.u9.Fork_16>=1)&&(i5.u2.Think_16>=1)))||((i7.u19.Fork_19>=1)&&(i7.u14.Think_19>=1)))||((i7.u14.Fork_18>=1)&&(i5.u10.Think_18>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Think_20>=1)))||((i0.u18.Think_7>=1)&&(i2.u6.Fork_7>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Think_6>=1)))||((i2.u1.Think_9>=1)&&(i3.u17.Fork_9>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Think_8>=1)))||((i3.u8.Think_11>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Fork_10>=1)&&(i3.u17.Think_10>=1)))||((i4.u11.Fork_13>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u7.Fork_12>=1)))")))
Formula 2 simplified : !X"(((((((((((((((((((((i1.u4.Think_5>=1)&&(i1.u4.Fork_5>=1))||((i1.u5.Think_4>=1)&&(i1.u5.Fork_4>=1)))||((i8.u15.Fork_3>=1)&&(i8.u15.Think_3>=1)))||((i8.u3.Think_2>=1)&&(i8.u15.Fork_2>=1)))||((i7.u16.Think_1>=1)&&(i8.u3.Fork_1>=1)))||((i4.u13.Think_15>=1)&&(i4.u13.Fork_15>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_14>=1)))||((i5.u10.Fork_17>=1)&&(i5.u9.Think_17>=1)))||((i5.u9.Fork_16>=1)&&(i5.u2.Think_16>=1)))||((i7.u19.Fork_19>=1)&&(i7.u14.Think_19>=1)))||((i7.u14.Fork_18>=1)&&(i5.u10.Think_18>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Think_20>=1)))||((i0.u18.Think_7>=1)&&(i2.u6.Fork_7>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Think_6>=1)))||((i2.u1.Think_9>=1)&&(i3.u17.Fork_9>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Think_8>=1)))||((i3.u8.Think_11>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Fork_10>=1)&&(i3.u17.Think_10>=1)))||((i4.u11.Fork_13>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u7.Fork_12>=1)))"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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,3.36746,113176,1,0,217707,410,901,262660,233,1190,150860
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(((((((((((((((((((((i7.u16.Fork_20>=1)&&(i7.u16.Think_1>=1))||((i2.u6.Fork_7>=1)&&(i2.u6.Think_8>=1)))||((i2.u1.Fork_8>=1)&&(i2.u1.Think_9>=1)))||((i0.u0.Think_6>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Think_7>=1)&&(i0.u18.Fork_6>=1)))||((i1.u5.Think_4>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u4.Think_5>=1)))||((i8.u3.Think_2>=1)&&(i8.u3.Fork_1>=1)))||((i8.u15.Fork_2>=1)&&(i8.u15.Think_3>=1)))||((i5.u9.Fork_16>=1)&&(i5.u9.Think_17>=1)))||((i5.u2.Think_16>=1)&&(i4.u13.Fork_15>=1)))||((i4.u13.Think_15>=1)&&(i4.u11.Fork_14>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_13>=1)))||((i6.u7.Fork_12>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Think_11>=1)&&(i3.u8.Fork_10>=1)))||((i3.u17.Fork_9>=1)&&(i3.u17.Think_10>=1)))||((i7.u19.Think_20>=1)&&(i7.u19.Fork_19>=1)))||((i7.u14.Think_19>=1)&&(i7.u14.Fork_18>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))"))
Formula 3 simplified : !"(((((((((((((((((((((i7.u16.Fork_20>=1)&&(i7.u16.Think_1>=1))||((i2.u6.Fork_7>=1)&&(i2.u6.Think_8>=1)))||((i2.u1.Fork_8>=1)&&(i2.u1.Think_9>=1)))||((i0.u0.Think_6>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Think_7>=1)&&(i0.u18.Fork_6>=1)))||((i1.u5.Think_4>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u4.Think_5>=1)))||((i8.u3.Think_2>=1)&&(i8.u3.Fork_1>=1)))||((i8.u15.Fork_2>=1)&&(i8.u15.Think_3>=1)))||((i5.u9.Fork_16>=1)&&(i5.u9.Think_17>=1)))||((i5.u2.Think_16>=1)&&(i4.u13.Fork_15>=1)))||((i4.u13.Think_15>=1)&&(i4.u11.Fork_14>=1)))||((i4.u11.Think_14>=1)&&(i4.u11.Fork_13>=1)))||((i6.u7.Fork_12>=1)&&(i6.u7.Think_13>=1)))||((i6.u12.Think_12>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Think_11>=1)&&(i3.u8.Fork_10>=1)))||((i3.u17.Fork_9>=1)&&(i3.u17.Think_10>=1)))||((i7.u19.Think_20>=1)&&(i7.u19.Fork_19>=1)))||((i7.u14.Think_19>=1)&&(i7.u14.Fork_18>=1)))||((i5.u10.Think_18>=1)&&(i5.u10.Fork_17>=1)))"
Computing Next relation with stutter on 2 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,3.37125,113440,1,0,217707,410,1016,262660,241,1190,150950
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G("(((((((((((((((((((((i8.u3.Fork_1>=1)&&(i7.u16.Catch1_1>=1))||((i3.u17.Catch1_10>=1)&&(i3.u8.Fork_10>=1)))||((i6.u12.Fork_11>=1)&&(i3.u8.Catch1_11>=1)))||((i6.u12.Catch1_12>=1)&&(i6.u7.Fork_12>=1)))||((i6.u7.Catch1_13>=1)&&(i4.u11.Fork_13>=1)))||((i4.u11.Catch1_14>=1)&&(i4.u11.Fork_14>=1)))||((i4.u13.Catch1_15>=1)&&(i4.u13.Fork_15>=1)))||((i5.u2.Catch1_16>=1)&&(i5.u9.Fork_16>=1)))||((i5.u9.Catch1_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u3.Catch1_2>=1)&&(i8.u15.Fork_2>=1)))||((i8.u15.Catch1_3>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u5.Catch1_4>=1)))||((i1.u4.Catch1_5>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Catch1_6>=1)))||((i2.u6.Fork_7>=1)&&(i0.u18.Catch1_7>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Catch1_8>=1)))||((i2.u1.Catch1_9>=1)&&(i3.u17.Fork_9>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Catch1_20>=1)))||((i7.u14.Catch1_19>=1)&&(i7.u19.Fork_19>=1)))||((i5.u10.Catch1_18>=1)&&(i7.u14.Fork_18>=1)))"))))
Formula 4 simplified : !FG"(((((((((((((((((((((i8.u3.Fork_1>=1)&&(i7.u16.Catch1_1>=1))||((i3.u17.Catch1_10>=1)&&(i3.u8.Fork_10>=1)))||((i6.u12.Fork_11>=1)&&(i3.u8.Catch1_11>=1)))||((i6.u12.Catch1_12>=1)&&(i6.u7.Fork_12>=1)))||((i6.u7.Catch1_13>=1)&&(i4.u11.Fork_13>=1)))||((i4.u11.Catch1_14>=1)&&(i4.u11.Fork_14>=1)))||((i4.u13.Catch1_15>=1)&&(i4.u13.Fork_15>=1)))||((i5.u2.Catch1_16>=1)&&(i5.u9.Fork_16>=1)))||((i5.u9.Catch1_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u3.Catch1_2>=1)&&(i8.u15.Fork_2>=1)))||((i8.u15.Catch1_3>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u5.Catch1_4>=1)))||((i1.u4.Catch1_5>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Catch1_6>=1)))||((i2.u6.Fork_7>=1)&&(i0.u18.Catch1_7>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Catch1_8>=1)))||((i2.u1.Catch1_9>=1)&&(i3.u17.Fork_9>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Catch1_20>=1)))||((i7.u14.Catch1_19>=1)&&(i7.u19.Fork_19>=1)))||((i5.u10.Catch1_18>=1)&&(i7.u14.Fork_18>=1)))"
Computing Next relation with stutter on 2 deadlock states
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]
Compilation finished in 2147 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 73 ms.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
867 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,12.0434,315660,1,0,633154,438,1169,812629,247,1344,466870
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((F(G("(((((((((((((((((((((i2.u1.Fork_8>=1)&&(i2.u1.Catch2_9>=1))||((i2.u6.Catch2_8>=1)&&(i2.u6.Fork_7>=1)))||((i0.u18.Fork_6>=1)&&(i0.u18.Catch2_7>=1)))||((i1.u4.Fork_5>=1)&&(i0.u0.Catch2_6>=1)))||((i6.u7.Fork_12>=1)&&(i6.u7.Catch2_13>=1)))||((i6.u12.Catch2_12>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Fork_10>=1)&&(i3.u8.Catch2_11>=1)))||((i3.u17.Catch2_10>=1)&&(i3.u17.Fork_9>=1)))||((i7.u16.Fork_20>=1)&&(i7.u16.Catch2_1>=1)))||((i1.u5.Fork_4>=1)&&(i1.u4.Catch2_5>=1)))||((i8.u15.Fork_3>=1)&&(i1.u5.Catch2_4>=1)))||((i8.u15.Fork_2>=1)&&(i8.u15.Catch2_3>=1)))||((i8.u3.Catch2_2>=1)&&(i8.u3.Fork_1>=1)))||((i4.u13.Fork_15>=1)&&(i5.u2.Catch2_16>=1)))||((i5.u9.Catch2_17>=1)&&(i5.u9.Fork_16>=1)))||((i4.u11.Fork_13>=1)&&(i4.u11.Catch2_14>=1)))||((i4.u13.Catch2_15>=1)&&(i4.u11.Fork_14>=1)))||((i7.u19.Catch2_20>=1)&&(i7.u19.Fork_19>=1)))||((i5.u10.Fork_17>=1)&&(i5.u10.Catch2_18>=1)))||((i7.u14.Catch2_19>=1)&&(i7.u14.Fork_18>=1)))")))U(X(G("(((((((((((((((((((((i8.u3.Fork_1>=1)&&(i7.u16.Catch1_1>=1))||((i3.u17.Catch1_10>=1)&&(i3.u8.Fork_10>=1)))||((i6.u12.Fork_11>=1)&&(i3.u8.Catch1_11>=1)))||((i6.u12.Catch1_12>=1)&&(i6.u7.Fork_12>=1)))||((i6.u7.Catch1_13>=1)&&(i4.u11.Fork_13>=1)))||((i4.u11.Catch1_14>=1)&&(i4.u11.Fork_14>=1)))||((i4.u13.Catch1_15>=1)&&(i4.u13.Fork_15>=1)))||((i5.u2.Catch1_16>=1)&&(i5.u9.Fork_16>=1)))||((i5.u9.Catch1_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u3.Catch1_2>=1)&&(i8.u15.Fork_2>=1)))||((i8.u15.Catch1_3>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u5.Catch1_4>=1)))||((i1.u4.Catch1_5>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Catch1_6>=1)))||((i2.u6.Fork_7>=1)&&(i0.u18.Catch1_7>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Catch1_8>=1)))||((i2.u1.Catch1_9>=1)&&(i3.u17.Fork_9>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Catch1_20>=1)))||((i7.u14.Catch1_19>=1)&&(i7.u19.Fork_19>=1)))||((i5.u10.Catch1_18>=1)&&(i7.u14.Fork_18>=1)))"))))))
Formula 5 simplified : !F(FG"(((((((((((((((((((((i2.u1.Fork_8>=1)&&(i2.u1.Catch2_9>=1))||((i2.u6.Catch2_8>=1)&&(i2.u6.Fork_7>=1)))||((i0.u18.Fork_6>=1)&&(i0.u18.Catch2_7>=1)))||((i1.u4.Fork_5>=1)&&(i0.u0.Catch2_6>=1)))||((i6.u7.Fork_12>=1)&&(i6.u7.Catch2_13>=1)))||((i6.u12.Catch2_12>=1)&&(i6.u12.Fork_11>=1)))||((i3.u8.Fork_10>=1)&&(i3.u8.Catch2_11>=1)))||((i3.u17.Catch2_10>=1)&&(i3.u17.Fork_9>=1)))||((i7.u16.Fork_20>=1)&&(i7.u16.Catch2_1>=1)))||((i1.u5.Fork_4>=1)&&(i1.u4.Catch2_5>=1)))||((i8.u15.Fork_3>=1)&&(i1.u5.Catch2_4>=1)))||((i8.u15.Fork_2>=1)&&(i8.u15.Catch2_3>=1)))||((i8.u3.Catch2_2>=1)&&(i8.u3.Fork_1>=1)))||((i4.u13.Fork_15>=1)&&(i5.u2.Catch2_16>=1)))||((i5.u9.Catch2_17>=1)&&(i5.u9.Fork_16>=1)))||((i4.u11.Fork_13>=1)&&(i4.u11.Catch2_14>=1)))||((i4.u13.Catch2_15>=1)&&(i4.u11.Fork_14>=1)))||((i7.u19.Catch2_20>=1)&&(i7.u19.Fork_19>=1)))||((i5.u10.Fork_17>=1)&&(i5.u10.Catch2_18>=1)))||((i7.u14.Catch2_19>=1)&&(i7.u14.Fork_18>=1)))" U XG"(((((((((((((((((((((i8.u3.Fork_1>=1)&&(i7.u16.Catch1_1>=1))||((i3.u17.Catch1_10>=1)&&(i3.u8.Fork_10>=1)))||((i6.u12.Fork_11>=1)&&(i3.u8.Catch1_11>=1)))||((i6.u12.Catch1_12>=1)&&(i6.u7.Fork_12>=1)))||((i6.u7.Catch1_13>=1)&&(i4.u11.Fork_13>=1)))||((i4.u11.Catch1_14>=1)&&(i4.u11.Fork_14>=1)))||((i4.u13.Catch1_15>=1)&&(i4.u13.Fork_15>=1)))||((i5.u2.Catch1_16>=1)&&(i5.u9.Fork_16>=1)))||((i5.u9.Catch1_17>=1)&&(i5.u10.Fork_17>=1)))||((i8.u3.Catch1_2>=1)&&(i8.u15.Fork_2>=1)))||((i8.u15.Catch1_3>=1)&&(i8.u15.Fork_3>=1)))||((i1.u5.Fork_4>=1)&&(i1.u5.Catch1_4>=1)))||((i1.u4.Catch1_5>=1)&&(i1.u4.Fork_5>=1)))||((i0.u18.Fork_6>=1)&&(i0.u0.Catch1_6>=1)))||((i2.u6.Fork_7>=1)&&(i0.u18.Catch1_7>=1)))||((i2.u1.Fork_8>=1)&&(i2.u6.Catch1_8>=1)))||((i2.u1.Catch1_9>=1)&&(i3.u17.Fork_9>=1)))||((i7.u16.Fork_20>=1)&&(i7.u19.Catch1_20>=1)))||((i7.u14.Catch1_19>=1)&&(i7.u19.Fork_19>=1)))||((i5.u10.Catch1_18>=1)&&(i7.u14.Fork_18>=1)))")
Computing Next relation with stutter on 2 deadlock states
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, <>([]((LTLAP2==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 88 ms.
FORMULA Philosophers-PT-000020-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, <>((<>([]((LTLAP4==true))))U(X([]((LTLAP2==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 58 ms.
FORMULA Philosophers-PT-000020-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, (((LTLAP2==true))U(<>((LTLAP2==true))))U([](<>((LTLAP4==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 55 ms.
FORMULA Philosophers-PT-000020-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, <>([](([]((LTLAP2==true)))U([]((LTLAP1==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 43 ms.
FORMULA Philosophers-PT-000020-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, ((<>((LTLAP5==true)))U(X((LTLAP6==true))))U(X(X((LTLAP7==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 46 ms.
FORMULA Philosophers-PT-000020-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, (<>(<>(X((LTLAP8==true)))))U((LTLAP9==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 18 ms.
FORMULA Philosophers-PT-000020-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, (LTLAP10==true), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 35 ms.
FORMULA Philosophers-PT-000020-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, ((<>((LTLAP11==true)))U(<>((LTLAP12==true))))U((<>((LTLAP13==true)))U((LTLAP14==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 30 ms.
FORMULA Philosophers-PT-000020-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, ([]((LTLAP15==true)))U([]((LTLAP16==true))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 31 ms.
FORMULA Philosophers-PT-000020-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, --when, --ltl, (X(((LTLAP17==true))U((LTLAP18==true))))U([](((LTLAP19==true))U((LTLAP20==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 43 ms.
FORMULA Philosophers-PT-000020-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, []((LTLAP21==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 70 ms.
FORMULA Philosophers-PT-000020-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=1, -p, --pins-guards, --when, --ltl, (LTLAP14==true), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 23 ms.
FORMULA Philosophers-PT-000020-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1527507547399

--------------------
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 11:38:53 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/, -louvain, -smt]
May 28, 2018 11:38:53 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 11:38:53 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 64 ms
May 28, 2018 11:38:53 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 places.
May 28, 2018 11:38:53 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 transitions.
May 28, 2018 11:38:53 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 19 ms
May 28, 2018 11:38:54 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 11:38:54 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 42 ms
May 28, 2018 11:38:54 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 29 ms
Begin: Mon May 28 11:38:54 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Mon May 28 11:38:54 2018
network size: 100 nodes, 360 links, 200 weight
quality increased from -0.0111944 to 0.682622
end computation: Mon May 28 11:38:54 2018
level 1:
start computation: Mon May 28 11:38:54 2018
network size: 20 nodes, 60 links, 200 weight
quality increased from 0.682622 to 0.765622
end computation: Mon May 28 11:38:54 2018
level 2:
start computation: Mon May 28 11:38:54 2018
network size: 9 nodes, 27 links, 200 weight
quality increased from 0.765622 to 0.765622
end computation: Mon May 28 11:38:54 2018
End: Mon May 28 11:38:54 2018
Total duration: 0 sec
0.765622
May 28, 2018 11:38:54 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 11:38:54 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 19 ms
May 28, 2018 11:38:54 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 11:38:54 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 20 redundant transitions.
May 28, 2018 11:38:54 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
May 28, 2018 11:38:54 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 ms
May 28, 2018 11:38:54 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 100 transitions.
May 28, 2018 11:38:54 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 35 ms
May 28, 2018 11:38:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 232 ms
May 28, 2018 11:38:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 100 transitions.
May 28, 2018 11:38:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/100 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 11:38:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 11:38:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 100 transitions.
May 28, 2018 11:38:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 11:39:01 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 100 transitions.
May 28, 2018 11:39:02 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/100) took 62 ms. Total solver calls (SAT/UNSAT): 24(21/3)
May 28, 2018 11:39:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 2277 ms. Total solver calls (SAT/UNSAT): 996(711/285)
May 28, 2018 11:39:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 100 transitions.
May 28, 2018 11:39:04 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 74(0/74)
May 28, 2018 11:39:04 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 9778ms 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="Philosophers-PT-000020"
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/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 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 Philosophers-PT-000020, 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-152732586100222"
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 ;