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-155272231600799.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-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-oct2-155272231600799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 6.6K Feb 12 04:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 12 04:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 8 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 8 03:50 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 4.5K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 4 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 4 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 1 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 1 02:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 41K 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-000010-LTLFireability-00
FORMULA_NAME Philosophers-PT-000010-LTLFireability-01
FORMULA_NAME Philosophers-PT-000010-LTLFireability-02
FORMULA_NAME Philosophers-PT-000010-LTLFireability-03
FORMULA_NAME Philosophers-PT-000010-LTLFireability-04
FORMULA_NAME Philosophers-PT-000010-LTLFireability-05
FORMULA_NAME Philosophers-PT-000010-LTLFireability-06
FORMULA_NAME Philosophers-PT-000010-LTLFireability-07
FORMULA_NAME Philosophers-PT-000010-LTLFireability-08
FORMULA_NAME Philosophers-PT-000010-LTLFireability-09
FORMULA_NAME Philosophers-PT-000010-LTLFireability-10
FORMULA_NAME Philosophers-PT-000010-LTLFireability-11
FORMULA_NAME Philosophers-PT-000010-LTLFireability-12
FORMULA_NAME Philosophers-PT-000010-LTLFireability-13
FORMULA_NAME Philosophers-PT-000010-LTLFireability-14
FORMULA_NAME Philosophers-PT-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1552955841155

Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
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]
Built C files in :
/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 : !(("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))"))
Formula 0 simplified : !"(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
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.044834,17424,1,0,7,7044,14,2,1167,1590,4
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(X(G(G(X("(((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_10>=1)&&(Catch2_1>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Catch2_7>=1)&&(Fork_6>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1)))")))))))
Formula 1 simplified : !FXGX"(((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_10>=1)&&(Catch2_1>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Catch2_7>=1)&&(Fork_6>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1)))"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 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.068055,18668,1,0,11,10070,23,8,1352,7022,27
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((G("(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=1)))")))
Formula 2 simplified : !G"(((((((((((Fork_1>=1)&&(Think_1>=1))||((Think_6>=1)&&(Fork_6>=1)))||((Think_7>=1)&&(Fork_7>=1)))||((Fork_8>=1)&&(Think_8>=1)))||((Fork_9>=1)&&(Think_9>=1)))||((Fork_2>=1)&&(Think_2>=1)))||((Think_3>=1)&&(Fork_3>=1)))||((Think_4>=1)&&(Fork_4>=1)))||((Fork_5>=1)&&(Think_5>=1)))||((Fork_10>=1)&&(Think_10>=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
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.109381,20768,1,0,31,19205,28,29,1360,19487,87
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(("(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))"))
Formula 3 simplified : !"(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=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.111162,20768,1,0,31,19205,31,29,1400,19496,89
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(X(G(X(G("(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=1)))")))))))
Formula 4 simplified : !GXGXG"(((((((((((Think_3>=1)&&(Fork_2>=1))||((Fork_1>=1)&&(Think_2>=1)))||((Fork_10>=1)&&(Think_1>=1)))||((Fork_6>=1)&&(Think_7>=1)))||((Think_6>=1)&&(Fork_5>=1)))||((Fork_4>=1)&&(Think_5>=1)))||((Think_4>=1)&&(Fork_3>=1)))||((Think_10>=1)&&(Fork_9>=1)))||((Fork_8>=1)&&(Think_9>=1)))||((Think_8>=1)&&(Fork_7>=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 50 rows 50 cols
invariant :Fork_9 + Catch1_10 + Catch2_9 + Eat_9 + Eat_10 = 1
invariant :Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
invariant :Fork_6 + Catch1_7 + Catch2_6 + Eat_7 + Eat_6 = 1
invariant :Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
invariant :Fork_5 + Catch1_6 + Catch2_5 + Eat_5 + Eat_6 = 1
invariant :Think_6 + Catch1_6 + Catch2_6 + Eat_6 = 1
invariant :Catch1_1 + Fork_10 + Catch2_10 + Eat_1 + Eat_10 = 1
invariant :Fork_7 + Catch1_8 + Catch2_7 + Eat_8 + Eat_7 = 1
invariant :Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
invariant :Think_10 + Catch1_10 + Catch2_10 + Eat_10 = 1
invariant :Fork_1 + Catch1_2 + Catch2_1 + Eat_1 + Eat_2 = 1
invariant :Fork_4 + Catch1_5 + Catch2_4 + Eat_4 + Eat_5 = 1
invariant :Fork_8 + Catch1_9 + Catch2_8 + Eat_9 + Eat_8 = 1
invariant :Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
invariant :Fork_3 + Catch1_4 + Catch2_3 + Eat_4 + Eat_3 = 1
invariant :Fork_2 + Catch1_3 + Catch2_2 + Eat_2 + Eat_3 = 1
invariant :Think_8 + Catch1_8 + Catch2_8 + Eat_8 = 1
invariant :Think_7 + Catch1_7 + Catch2_7 + Eat_7 = 1
invariant :Think_9 + Catch1_9 + Catch2_9 + Eat_9 = 1
invariant :Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.149905,22056,1,0,45,25493,37,42,1438,29125,140
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(G(("(((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_10>=1)&&(Catch2_1>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Catch2_7>=1)&&(Fork_6>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1)))")U(X("(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))"))))))
Formula 5 simplified : !FG("(((((((((((Fork_2>=1)&&(Catch2_3>=1))||((Fork_1>=1)&&(Catch2_2>=1)))||((Fork_4>=1)&&(Catch2_5>=1)))||((Fork_3>=1)&&(Catch2_4>=1)))||((Fork_10>=1)&&(Catch2_1>=1)))||((Catch2_10>=1)&&(Fork_9>=1)))||((Catch2_7>=1)&&(Fork_6>=1)))||((Fork_5>=1)&&(Catch2_6>=1)))||((Catch2_9>=1)&&(Fork_8>=1)))||((Catch2_8>=1)&&(Fork_7>=1)))" U X"(((((((((((Fork_4>=1)&&(Catch1_4>=1))||((Catch1_5>=1)&&(Fork_5>=1)))||((Fork_6>=1)&&(Catch1_6>=1)))||((Fork_7>=1)&&(Catch1_7>=1)))||((Catch1_1>=1)&&(Fork_1>=1)))||((Fork_2>=1)&&(Catch1_2>=1)))||((Fork_3>=1)&&(Catch1_3>=1)))||((Fork_9>=1)&&(Catch1_9>=1)))||((Catch1_8>=1)&&(Fork_8>=1)))||((Catch1_10>=1)&&(Fork_10>=1)))")
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
10 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.248469,26228,1,0,58,43293,48,53,1468,62264,172
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(X(F(X("((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))"))))))
Formula 6 simplified : !GXFX"((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))"
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
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.274609,27276,1,0,78,47858,57,74,1488,67975,235
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=1))"))
Formula 7 simplified : !"((((((((((Eat_1>=1)||(Eat_3>=1))||(Eat_2>=1))||(Eat_10>=1))||(Eat_8>=1))||(Eat_9>=1))||(Eat_6>=1))||(Eat_7>=1))||(Eat_4>=1))||(Eat_5>=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.275649,27276,1,0,78,47858,57,74,1488,67975,237
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((X(X(X(F(F("((Catch1_5>=1)&&(Fork_5>=1))")))))))
Formula 8 simplified : !XXXF"((Catch1_5>=1)&&(Fork_5>=1))"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 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.295139,28044,1,0,88,52116,66,85,1488,73722,282
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(X(X(G("(Eat_4>=1)"))))))
Formula 9 simplified : !XXXG"(Eat_4>=1)"
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.334122,29568,1,0,114,59940,72,103,1488,86304,335
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(((X(X(F("((Catch2_7>=1)&&(Fork_6>=1))"))))U(F("((Think_6>=1)&&(Fork_5>=1))"))))
Formula 10 simplified : !(XXF"((Catch2_7>=1)&&(Fork_6>=1))" U F"((Think_6>=1)&&(Fork_5>=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.334861,29824,1,0,114,59940,81,103,1488,86304,339
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("((Fork_5>=1)&&(Think_5>=1))"))
Formula 11 simplified : !"((Fork_5>=1)&&(Think_5>=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.335629,29824,1,0,114,59940,84,103,1488,86304,341
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !(((X(G(F("((Fork_4>=1)&&(Catch1_4>=1))"))))U(G(("((Catch2_8>=1)&&(Fork_7>=1))")U("(Eat_5>=1)")))))
Formula 12 simplified : !(XGF"((Fork_4>=1)&&(Catch1_4>=1))" U G("((Catch2_8>=1)&&(Fork_7>=1))" U "(Eat_5>=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.36194,31864,1,0,155,65039,97,132,1493,94475,426
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(G(F(("(Eat_2>=1)")U("(Eat_1>=1)"))))))
Formula 13 simplified : !XGF("(Eat_2>=1)" U "(Eat_1>=1)")
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
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.36392,31864,1,0,156,65232,106,133,1493,94767,435
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("((Fork_4>=1)&&(Catch1_4>=1))"))
Formula 14 simplified : !"((Fork_4>=1)&&(Catch1_4>=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.364726,32128,1,0,156,65232,109,133,1493,94767,437
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X((X("((Fork_3>=1)&&(Catch1_3>=1))"))U(F("((Fork_6>=1)&&(Catch1_6>=1))"))))))
Formula 15 simplified : !FX(X"((Fork_3>=1)&&(Catch1_3>=1))" U F"((Fork_6>=1)&&(Catch1_6>=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
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.37799,32320,1,0,166,67525,118,145,1493,97736,492
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-PT-000010-LTLFireability-15 FALSE 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 1552955843681

--------------------
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:37:22 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:37:22 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 19, 2019 12:37:22 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 28 ms
Mar 19, 2019 12:37:22 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Mar 19, 2019 12:37:22 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 transitions.
Mar 19, 2019 12:37:22 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 7 ms
Mar 19, 2019 12:37:22 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 21 ms
Mar 19, 2019 12:37:22 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:37:22 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Mar 19, 2019 12:37:23 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 50 transitions.
Mar 19, 2019 12:37:23 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 20 place invariants in 13 ms
Mar 19, 2019 12:37:23 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 50 variables to be positive in 92 ms
Mar 19, 2019 12:37:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 50 transitions.
Mar 19, 2019 12:37:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/50 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 12:37:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 12:37:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 50 transitions.
Mar 19, 2019 12:37:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 12:37:23 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 10) 1) (>= (select s0 0) 1)) (= (store (store (store s0 0 (- (select s0 0) 1)) 10 (- (select s0 10) 1)) 32 (+ (select s0 32) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (and (>= (select s0 10) 1) (>= (select s0 0) 1)) (= (store (store (store s0 0 (- (select s0 0) 1)) 10 (- (select s0 10) 1)) 32 (+ (select s0 32) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
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:37:23 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 449ms 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-000010"
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-000010, 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-155272231600799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000010.tgz
mv Philosophers-PT-000010 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 ;