Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r107-oct2-155272231600808.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstools
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 r107-oct2-155272231600808
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 10K Feb 12 04:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 12 04:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 8 03:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 8 03:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 7.2K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 4 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 4 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 1 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 1 02:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 82K Mar 10 17:31 model.pnml

--------------------
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 1552955893707

Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/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 : !((X(G(F("(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))")))))
Formula 0 simplified : !XGF"(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
11 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.140185,22232,1,0,11,32377,24,7,2614,10870,25
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
Checking formula 1 : !(((F(X("(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))")))U((G("(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))"))U(F("(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))")))))
Formula 1 simplified : !(FX"(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))" U (G"(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))" U F"(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(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,0.143597,22580,1,0,11,32377,33,7,2694,10870,29
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X("(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))")))
Formula 2 simplified : !X"(((((((((((((((((((((Fork_1>=1)&&(Catch1_1>=1))||((Catch1_10>=1)&&(Fork_10>=1)))||((Fork_11>=1)&&(Catch1_11>=1)))||((Catch1_12>=1)&&(Fork_12>=1)))||((Catch1_13>=1)&&(Fork_13>=1)))||((Catch1_14>=1)&&(Fork_14>=1)))||((Catch1_15>=1)&&(Fork_15>=1)))||((Catch1_16>=1)&&(Fork_16>=1)))||((Catch1_17>=1)&&(Fork_17>=1)))||((Catch1_2>=1)&&(Fork_2>=1)))||((Catch1_3>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Catch1_4>=1)))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Fork_8>=1)&&(Catch1_8>=1)))||((Catch1_9>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch1_20>=1)))||((Catch1_19>=1)&&(Fork_19>=1)))||((Catch1_18>=1)&&(Fork_18>=1)))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.153199,23044,1,0,13,33348,38,8,2774,11482,38
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(F("(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=1)))"))))
Formula 3 simplified : !GF"(((((((((((((((((((((Fork_20>=1)&&(Think_1>=1))||((Fork_7>=1)&&(Think_8>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Think_7>=1)&&(Fork_6>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_2>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Think_3>=1)))||((Fork_16>=1)&&(Think_17>=1)))||((Think_16>=1)&&(Fork_15>=1)))||((Think_15>=1)&&(Fork_14>=1)))||((Think_14>=1)&&(Fork_13>=1)))||((Fork_12>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_11>=1)))||((Think_11>=1)&&(Fork_10>=1)))||((Fork_9>=1)&&(Think_10>=1)))||((Think_20>=1)&&(Fork_19>=1)))||((Think_19>=1)&&(Fork_18>=1)))||((Think_18>=1)&&(Fork_17>=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 :Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
invariant :Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
invariant :Think_16 + Catch1_16 + Catch2_16 + Eat_16 = 1
invariant :Fork_19 + Catch1_20 + Catch2_19 + Eat_20 + Eat_19 = 1
invariant :Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
invariant :Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
invariant :Think_18 + Catch1_18 + Catch2_18 + Eat_18 = 1
invariant :Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
invariant :Think_12 + Catch1_12 + Catch2_12 + Eat_12 = 1
invariant :Fork_3 + Catch1_4 + Catch2_3 + Eat_3 + Eat_4 = 1
invariant :Think_17 + Catch1_17 + Catch2_17 + Eat_17 = 1
invariant :Fork_13 + Catch1_14 + Catch2_13 + Eat_13 + Eat_14 = 1
invariant :Fork_9 + Catch1_10 + Catch2_9 + Eat_10 + Eat_9 = 1
invariant :Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 1
invariant :Fork_5 + Catch1_6 + Catch2_5 + Eat_5 + Eat_6 = 1
invariant :Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 1
invariant :Fork_14 + Catch1_15 + Catch2_14 + Eat_14 + Eat_15 = 1
invariant :Fork_16 + Catch1_17 + Catch2_16 + Eat_16 + Eat_17 = 1
invariant :Fork_11 + Catch1_12 + Catch2_11 + Eat_11 + Eat_12 = 1
invariant :Fork_18 + Catch1_19 + Catch2_18 + Eat_18 + Eat_19 = 1
invariant :Think_11 + Catch1_11 + Catch2_11 + Eat_11 = 1
invariant :Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
invariant :Think_15 + Catch1_15 + Catch2_15 + Eat_15 = 1
invariant :Fork_4 + Catch1_5 + Catch2_4 + Eat_5 + Eat_4 = 1
invariant :Fork_12 + Catch1_13 + Catch2_12 + Eat_13 + Eat_12 = 1
invariant :Think_20 + Catch1_20 + Catch2_20 + Eat_20 = 1
invariant :Fork_7 + Catch1_8 + Catch2_7 + Eat_7 + Eat_8 = 1
invariant :Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
invariant :Fork_10 + Catch1_11 + Catch2_10 + Eat_11 + Eat_10 = 1
invariant :Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
invariant :Think_19 + Catch1_19 + Catch2_19 + Eat_19 = 1
invariant :Think_14 + Catch1_14 + Catch2_14 + Eat_14 = 1
invariant :Fork_17 + Catch1_18 + Catch2_17 + Eat_18 + Eat_17 = 1
invariant :Fork_1 + Catch1_2 + Catch2_1 + Eat_2 + Eat_1 = 1
invariant :Fork_15 + Catch1_16 + Catch2_15 + Eat_16 + Eat_15 = 1
invariant :Fork_2 + Catch1_3 + Catch2_2 + Eat_3 + Eat_2 = 1
invariant :Think_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
invariant :Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
invariant :Think_13 + Catch1_13 + Catch2_13 + Eat_13 = 1
invariant :Fork_20 + Catch1_1 + Eat_1 + Catch2_20 + Eat_20 = 1
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
29 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.450304,32880,1,0,46,79400,38,31,2774,78364,108
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(X("(((((((((((((((((((((Think_5>=1)&&(Fork_5>=1))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Fork_17>=1)&&(Think_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Fork_18>=1)&&(Think_18>=1)))||((Fork_20>=1)&&(Think_20>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Think_10>=1)))||((Fork_13>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_12>=1)))"))))
Formula 4 simplified : !XX"(((((((((((((((((((((Think_5>=1)&&(Fork_5>=1))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_3>=1)&&(Think_3>=1)))||((Think_2>=1)&&(Fork_2>=1)))||((Think_1>=1)&&(Fork_1>=1)))||((Think_15>=1)&&(Fork_15>=1)))||((Think_14>=1)&&(Fork_14>=1)))||((Fork_17>=1)&&(Think_17>=1)))||((Fork_16>=1)&&(Think_16>=1)))||((Fork_19>=1)&&(Think_19>=1)))||((Fork_18>=1)&&(Think_18>=1)))||((Fork_20>=1)&&(Think_20>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Think_6>=1)))||((Think_9>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Think_11>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Think_10>=1)))||((Fork_13>=1)&&(Think_13>=1)))||((Think_12>=1)&&(Fork_12>=1)))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.472407,33124,1,0,47,80073,41,32,2834,78788,113
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(("((((((((((((((((((((Eat_4>=1)||(Eat_5>=1))||(Eat_2>=1))||(Eat_3>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_1>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_20>=1))||(Eat_15>=1))||(Eat_14>=1))||(Eat_17>=1))||(Eat_16>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))"))
Formula 5 simplified : !"((((((((((((((((((((Eat_4>=1)||(Eat_5>=1))||(Eat_2>=1))||(Eat_3>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_1>=1))||(Eat_19>=1))||(Eat_18>=1))||(Eat_20>=1))||(Eat_15>=1))||(Eat_14>=1))||(Eat_17>=1))||(Eat_16>=1))||(Eat_11>=1))||(Eat_10>=1))||(Eat_13>=1))||(Eat_12>=1))"
Computing Next relation with stutter on 2 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.474214,33388,1,0,47,80073,44,32,2874,78807,115
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))"))
Formula 6 simplified : !"(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))"
Computing Next relation with stutter on 2 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.47728,33388,1,0,47,80073,44,32,2874,78826,117
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))"))
Formula 7 simplified : !"(((((((((((((((((((((Fork_8>=1)&&(Catch2_9>=1))||((Catch2_8>=1)&&(Fork_7>=1)))||((Fork_6>=1)&&(Catch2_7>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Fork_12>=1)&&(Catch2_13>=1)))||((Catch2_12>=1)&&(Fork_11>=1)))||((Fork_10>=1)&&(Catch2_11>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Fork_20>=1)&&(Catch2_1>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_2>=1)&&(Catch2_3>=1)))||((Catch2_2>=1)&&(Fork_1>=1)))||((Fork_15>=1)&&(Catch2_16>=1)))||((Catch2_17>=1)&&(Fork_16>=1)))||((Fork_13>=1)&&(Catch2_14>=1)))||((Catch2_15>=1)&&(Fork_14>=1)))||((Catch2_20>=1)&&(Fork_19>=1)))||((Fork_17>=1)&&(Catch2_18>=1)))||((Catch2_19>=1)&&(Fork_18>=1)))"
Computing Next relation with stutter on 2 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.479784,33388,1,0,47,80073,44,32,2874,78826,117
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X("((Catch1_14>=1)&&(Fork_14>=1))")))
Formula 8 simplified : !X"((Catch1_14>=1)&&(Fork_14>=1))"
Computing Next relation with stutter on 2 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.481892,33388,1,0,48,80251,47,33,2874,78980,124
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((X(G(G("((Think_11>=1)&&(Fork_10>=1))"))))U(F(F(F("(Eat_17>=1)"))))))
Formula 9 simplified : !(XG"((Think_11>=1)&&(Fork_10>=1))" U F"(Eat_17>=1)")
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
16 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.636723,37048,1,0,87,101040,56,73,2874,111125,231
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("((Fork_7>=1)&&(Catch1_7>=1))"))
Formula 10 simplified : !"((Fork_7>=1)&&(Catch1_7>=1))"
Computing Next relation with stutter on 2 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.637338,37048,1,0,87,101040,59,73,2874,111125,233
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(X("((Fork_4>=1)&&(Catch2_5>=1))"))))
Formula 11 simplified : !GX"((Fork_4>=1)&&(Catch2_5>=1))"
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
16 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.800077,42584,1,0,147,130463,65,114,2874,157814,341
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((X(G(X(X(F("((Fork_6>=1)&&(Catch2_7>=1))")))))))
Formula 12 simplified : !XGXXF"((Fork_6>=1)&&(Catch2_7>=1))"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.807941,42932,1,0,148,131687,74,115,2874,159122,350
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("((Fork_17>=1)&&(Think_17>=1))"))
Formula 13 simplified : !"((Fork_17>=1)&&(Think_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,0.808439,43192,1,0,148,131687,77,115,2874,159122,352
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F((("((Fork_17>=1)&&(Think_17>=1))")U("((Think_14>=1)&&(Fork_14>=1))"))U(("((Think_18>=1)&&(Fork_17>=1))")U("((Catch1_16>=1)&&(Fork_16>=1))")))))
Formula 14 simplified : !F(("((Fork_17>=1)&&(Think_17>=1))" U "((Think_14>=1)&&(Fork_14>=1))") U ("((Think_18>=1)&&(Fork_17>=1))" U "((Catch1_16>=1)&&(Fork_16>=1))"))
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
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.83725,43984,1,0,168,136729,86,135,2874,165518,459
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(("((Fork_8>=1)&&(Think_9>=1))"))
Formula 15 simplified : !"((Fork_8>=1)&&(Think_9>=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,0.837748,43984,1,0,168,136729,89,135,2874,165518,461
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Philosophers-PT-000020-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552955896866

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 19, 2019 12:38:15 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 19, 2019 12:38:15 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 19, 2019 12:38:15 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 37 ms
Mar 19, 2019 12:38:15 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 places.
Mar 19, 2019 12:38:15 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 transitions.
Mar 19, 2019 12:38:15 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Mar 19, 2019 12:38:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 29 ms
Mar 19, 2019 12:38:15 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Mar 19, 2019 12:38:15 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 19, 2019 12:38:15 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 100 transitions.
Mar 19, 2019 12:38:15 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 40 place invariants in 15 ms
Mar 19, 2019 12:38:16 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 143 ms
Mar 19, 2019 12:38:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 100 transitions.
Mar 19, 2019 12:38:16 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)
Mar 19, 2019 12:38:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 12:38:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 100 transitions.
Mar 19, 2019 12:38:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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)
Mar 19, 2019 12:38:16 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 952ms 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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool itstools"
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 r107-oct2-155272231600808"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;