Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961389800106.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961389800106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.2K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 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-000005-00
FORMULA_NAME Philosophers-PT-000005-01
FORMULA_NAME Philosophers-PT-000005-02
FORMULA_NAME Philosophers-PT-000005-03
FORMULA_NAME Philosophers-PT-000005-04
FORMULA_NAME Philosophers-PT-000005-05
FORMULA_NAME Philosophers-PT-000005-06
FORMULA_NAME Philosophers-PT-000005-07
FORMULA_NAME Philosophers-PT-000005-08
FORMULA_NAME Philosophers-PT-000005-09
FORMULA_NAME Philosophers-PT-000005-10
FORMULA_NAME Philosophers-PT-000005-11
FORMULA_NAME Philosophers-PT-000005-12
FORMULA_NAME Philosophers-PT-000005-13
FORMULA_NAME Philosophers-PT-000005-14
FORMULA_NAME Philosophers-PT-000005-15

=== Now, execution of the tool begins

BK_START 1589786534557

[2020-05-18 07:22:16] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-18 07:22:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 07:22:16] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2020-05-18 07:22:16] [INFO ] Transformed 25 places.
[2020-05-18 07:22:16] [INFO ] Transformed 25 transitions.
[2020-05-18 07:22:16] [INFO ] Parsed PT model containing 25 places and 25 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2779 resets, run finished after 140 ms. (steps per millisecond=714 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 25 rows 25 cols
[2020-05-18 07:22:16] [INFO ] Computed 10 place invariants in 4 ms
[2020-05-18 07:22:16] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-18 07:22:16] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-18 07:22:16] [INFO ] Flatten gal took : 35 ms
FORMULA Philosophers-PT-000005-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 07:22:16] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2020-05-18 07:22:16] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-18 07:22:16] [INFO ] Flatten gal took : 6 ms
[2020-05-18 07:22:17] [INFO ] Input system was already deterministic with 25 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph2106612519042988045.txt, -o, /tmp/graph2106612519042988045.bin, -w, /tmp/graph2106612519042988045.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph2106612519042988045.bin, -l, -1, -v, -w, /tmp/graph2106612519042988045.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 07:22:17] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-18 07:22:17] [INFO ] Rewriting arrays to variables to allow decomposition.
// Phase 1: matrix 25 rows 25 cols
[2020-05-18 07:22:17] [INFO ] Computed 10 place invariants in 1 ms
inv : Fork_2 + Catch1_3 + Catch2_2 + Eat_3 + Eat_2 = 1
inv : Think_2 + Catch1_2 + Catch2_2 + Eat_2 = 1
inv : Think_5 + Catch1_5 + Catch2_5 + Eat_5 = 1
inv : Fork_1 + Catch1_2 + Catch2_1 + Eat_1 + Eat_2 = 1
inv : Think_3 + Catch1_3 + Catch2_3 + Eat_3 = 1
inv : Fork_5 + Catch1_1 + Eat_1 + Catch2_5 + Eat_5 = 1
inv : Fork_4 + Catch1_5 + Catch2_4 + Eat_5 + Eat_4 = 1
inv : Think_4 + Catch1_4 + Catch2_4 + Eat_4 = 1
inv : Think_1 + Catch1_1 + Catch2_1 + Eat_1 = 1
inv : Fork_3 + Catch1_4 + Catch2_3 + Eat_3 + Eat_4 = 1
Total of 10 invariants.
[2020-05-18 07:22:17] [INFO ] Computed 10 place invariants in 7 ms
[2020-05-18 07:22:17] [INFO ] Removed a total of 5 redundant transitions.
[2020-05-18 07:22:17] [INFO ] Flatten gal took : 28 ms
[2020-05-18 07:22:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2020-05-18 07:22:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-18 07:22:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 10 LTL properties
Checking formula 0 : !((X(X(("(((((u0.Eat_1<1)&&(u2.Eat_3<1))&&(u1.Eat_2<1))&&(u4.Eat_5<1))&&(u3.Eat_4<1))")U(G(((((((F("((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1)))"))||("((u4.Think_5>=1)&&(u4.Fork_4>=1))"))||("((u1.Think_2>=1)&&(u1.Fork_1>=1))"))||("((u3.Think_4>=1)&&(u3.Fork_3>=1))"))||("((u2.Think_3>=1)&&(u2.Fork_2>=1))"))||("((u0.Think_1>=1)&&(u0.Fork_5>=1))"))U(X("((((((u3.Fork_3>=1)&&(u3.Catch2_4>=1))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))"))))))))
Formula 0 simplified : !XX("(((((u0.Eat_1<1)&&(u2.Eat_3<1))&&(u1.Eat_2<1))&&(u4.Eat_5<1))&&(u3.Eat_4<1))" U G(("((u0.Think_1>=1)&&(u0.Fork_5>=1))" | "((u1.Think_2>=1)&&(u1.Fork_1>=1))" | "((u2.Think_3>=1)&&(u2.Fork_2>=1))" | "((u3.Think_4>=1)&&(u3.Fork_3>=1))" | "((u4.Think_5>=1)&&(u4.Fork_4>=1))" | F"((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1)))") U X"((((((u3.Fork_3>=1)&&(u3.Catch2_4>=1))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))"))
built 5 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
16 unique states visited
12 strongly connected components in search stack
18 transitions explored
12 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.058681,19236,1,0,1686,151,436,1086,161,226,3809
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((G((F(X("((((((u3.Fork_3>=1)&&(u3.Catch2_4>=1))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))")))&&(X(G("((((((u4.Fork_4>=1)&&(u3.Catch1_4>=1))||((u0.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u1.Fork_1>=1)&&(u0.Catch1_1>=1)))||((u2.Fork_2>=1)&&(u1.Catch1_2>=1)))||((u3.Fork_3>=1)&&(u2.Catch1_3>=1)))")))))U("((((((u4.Fork_4>=1)&&(u3.Catch1_4>=1))||((u0.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u1.Fork_1>=1)&&(u0.Catch1_1>=1)))||((u2.Fork_2>=1)&&(u1.Catch1_2>=1)))||((u3.Fork_3>=1)&&(u2.Catch1_3>=1)))"))))
Formula 1 simplified : !X(G(FX"((((((u3.Fork_3>=1)&&(u3.Catch2_4>=1))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))" & XG"((((((u4.Fork_4>=1)&&(u3.Catch1_4>=1))||((u0.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u1.Fork_1>=1)&&(u0.Catch1_1>=1)))||((u2.Fork_2>=1)&&(u1.Catch1_2>=1)))||((u3.Fork_3>=1)&&(u2.Catch1_3>=1)))") U "((((((u4.Fork_4>=1)&&(u3.Catch1_4>=1))||((u0.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u1.Fork_1>=1)&&(u0.Catch1_1>=1)))||((u2.Fork_2>=1)&&(u1.Catch1_2>=1)))||((u3.Fork_3>=1)&&(u2.Catch1_3>=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.066707,19764,1,0,3081,152,467,2255,161,229,6330
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(G(X(X(((!(F("((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1)))")))||(!(X("((((((u4.Think_5>=1)&&(u4.Fork_4>=1))||((u1.Think_2>=1)&&(u1.Fork_1>=1)))||((u3.Think_4>=1)&&(u3.Fork_3>=1)))||((u2.Think_3>=1)&&(u2.Fork_2>=1)))||((u0.Think_1>=1)&&(u0.Fork_5>=1)))"))))U(F(G("((((((u4.Think_5>=1)&&(u4.Fork_4>=1))||((u1.Think_2>=1)&&(u1.Fork_1>=1)))||((u3.Think_4>=1)&&(u3.Fork_3>=1)))||((u2.Think_3>=1)&&(u2.Fork_2>=1)))||((u0.Think_1>=1)&&(u0.Fork_5>=1)))"))))))))))
Formula 2 simplified : !FXGXX((!F"((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1)))" | !X"((((((u4.Think_5>=1)&&(u4.Fork_4>=1))||((u1.Think_2>=1)&&(u1.Fork_1>=1)))||((u3.Think_4>=1)&&(u3.Fork_3>=1)))||((u2.Think_3>=1)&&(u2.Fork_2>=1)))||((u0.Think_1>=1)&&(u0.Fork_5>=1)))") U FG"((((((u4.Think_5>=1)&&(u4.Fork_4>=1))||((u1.Think_2>=1)&&(u1.Fork_1>=1)))||((u3.Think_4>=1)&&(u3.Fork_3>=1)))||((u2.Think_3>=1)&&(u2.Fork_2>=1)))||((u0.Think_1>=1)&&(u0.Fork_5>=1)))")
Computing Next relation with stutter on 2 deadlock states
[2020-05-18 07:22:17] [INFO ] Proved 25 variables to be positive in 150 ms
[2020-05-18 07:22:17] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2020-05-18 07:22:17] [INFO ] Computation of disable matrix completed :0/25 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:22:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 07:22:17] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2020-05-18 07:22:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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.073996,20028,1,0,3781,152,486,2983,161,232,7671
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((("((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1)))")U(G("(((((((u3.Fork_3>=1)&&(u3.Catch2_4>=1))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))&&((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1))))")))U("((((((u3.Fork_3>=1)&&(u3.Catch2_4>=1))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))"))))
Formula 3 simplified : !G(("((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1)))" U G"(((((((u3.Fork_3>=1)&&(u3.Catch2_4>=1))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))&&((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1))))") U "((((((u3.Fork_3>=1)&&(u3.Catch2_4>=1))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))")
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 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.085943,20292,1,0,4857,154,530,3951,161,234,10175
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((!(G(X(G(X(G((X("((((((u4.Fork_4>=1)&&(u3.Catch1_4>=1))||((u0.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u1.Fork_1>=1)&&(u0.Catch1_1>=1)))||((u2.Fork_2>=1)&&(u1.Catch1_2>=1)))||((u3.Fork_3>=1)&&(u2.Catch1_3>=1)))"))||(G("((((((u4.Think_5>=1)&&(u4.Fork_4>=1))||((u1.Think_2>=1)&&(u1.Fork_1>=1)))||((u3.Think_4>=1)&&(u3.Fork_3>=1)))||((u2.Think_3>=1)&&(u2.Fork_2>=1)))||((u0.Think_1>=1)&&(u0.Fork_5>=1)))"))))))))))
Formula 4 simplified : GXGXG(X"((((((u4.Fork_4>=1)&&(u3.Catch1_4>=1))||((u0.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u1.Fork_1>=1)&&(u0.Catch1_1>=1)))||((u2.Fork_2>=1)&&(u1.Catch1_2>=1)))||((u3.Fork_3>=1)&&(u2.Catch1_3>=1)))" | G"((((((u4.Think_5>=1)&&(u4.Fork_4>=1))||((u1.Think_2>=1)&&(u1.Fork_1>=1)))||((u3.Think_4>=1)&&(u3.Fork_3>=1)))||((u2.Think_3>=1)&&(u2.Fork_2>=1)))||((u0.Think_1>=1)&&(u0.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
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.091786,20556,1,0,5365,154,531,4340,161,234,11134
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(F(G((G("((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1)))"))U("(((((((((((u4.Fork_4>=1)&&(u3.Catch1_4>=1))||((u0.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u1.Fork_1>=1)&&(u0.Catch1_1>=1)))||((u2.Fork_2>=1)&&(u1.Catch1_2>=1)))||((u3.Fork_3>=1)&&(u2.Catch1_3>=1)))||((u3.Fork_3>=1)&&(u3.Catch2_4>=1)))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=1)))"))))))
Formula 5 simplified : !XFG(G"((((((u0.Think_1>=1)&&(u1.Fork_1>=1))||((u4.Think_5>=1)&&(u0.Fork_5>=1)))||((u1.Think_2>=1)&&(u2.Fork_2>=1)))||((u3.Think_4>=1)&&(u4.Fork_4>=1)))||((u2.Think_3>=1)&&(u3.Fork_3>=1)))" U "(((((((((((u4.Fork_4>=1)&&(u3.Catch1_4>=1))||((u0.Fork_5>=1)&&(u4.Catch1_5>=1)))||((u1.Fork_1>=1)&&(u0.Catch1_1>=1)))||((u2.Fork_2>=1)&&(u1.Catch1_2>=1)))||((u3.Fork_3>=1)&&(u2.Catch1_3>=1)))||((u3.Fork_3>=1)&&(u3.Catch2_4>=1)))||((u2.Fork_2>=1)&&(u2.Catch2_3>=1)))||((u4.Fork_4>=1)&&(u4.Catch2_5>=1)))||((u0.Fork_5>=1)&&(u0.Catch2_1>=1)))||((u1.Fork_1>=1)&&(u1.Catch2_2>=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
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.098835,20556,1,0,5710,154,556,4709,161,234,11958
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X((F("((u4.Think_5>=1)&&(u4.Fork_4>=1))"))||(G("(u1.Eat_2>=1)"))))||(!(G(X("((u2.Think_3>=1)&&(u2.Fork_2>=1))"))))))
Formula 6 simplified : !(X(F"((u4.Think_5>=1)&&(u4.Fork_4>=1))" | G"(u1.Eat_2>=1)") | !GX"((u2.Think_3>=1)&&(u2.Fork_2>=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.101551,20820,1,0,5868,154,612,4858,161,234,12278
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!((F("((u0.Fork_5>=1)&&(u4.Catch1_5>=1))"))U(((X(((X("((u2.Fork_2>=1)&&(u1.Catch1_2>=1))"))&&("(u2.Fork_2>=1)"))&&("(u1.Catch1_2>=1)")))U(X("((u0.Fork_5>=1)&&(u4.Catch1_5>=1))")))||(X("((u0.Fork_5>=1)&&(u4.Catch1_5>=1))"))))))
Formula 7 simplified : F"((u0.Fork_5>=1)&&(u4.Catch1_5>=1))" U (X"((u0.Fork_5>=1)&&(u4.Catch1_5>=1))" | (X("(u1.Catch1_2>=1)" & "(u2.Fork_2>=1)" & X"((u2.Fork_2>=1)&&(u1.Catch1_2>=1))") U X"((u0.Fork_5>=1)&&(u4.Catch1_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
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.104598,20820,1,0,6075,154,631,5084,161,234,12754
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(F(G(((G(X("((u0.Think_1>=1)&&(u1.Fork_1>=1))")))&&(F("((u0.Think_1>=1)&&(u1.Fork_1>=1))")))U(!(X(F("((u0.Think_1>=1)&&(u1.Fork_1>=1))"))))))))))
Formula 8 simplified : !FXFG((GX"((u0.Think_1>=1)&&(u1.Fork_1>=1))" & F"((u0.Think_1>=1)&&(u1.Fork_1>=1))") U !XF"((u0.Think_1>=1)&&(u1.Fork_1>=1))")
Computing Next relation with stutter on 2 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 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.109173,20820,1,0,6285,154,650,5254,161,234,13135
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G("((u2.Think_3>=1)&&(u2.Fork_2>=1))")))
Formula 9 simplified : !G"((u2.Think_3>=1)&&(u2.Fork_2>=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.110242,21084,1,0,6369,154,661,5323,161,234,13324
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-PT-000005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-18 07:22:17] [WARNING] Script execution failed on command (assert (and (and (>= (select s0 5) 1) (>= (select s0 10) 1)) (= (store (store (store s0 5 (- (select s0 5) 1)) 10 (- (select s0 10) 1)) 19 (+ (select s0 19) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 5) 1) (>= (select s0 10) 1)) (= (store (store (store s0 5 (- (select s0 5) 1)) 10 (- (select s0 10) 1)) 19 (+ (select s0 19) 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:757)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-18 07:22:17] [INFO ] Built C files in 304ms conformant to PINS in folder :/home/mcc/execution
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 1589786537480

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-000005"
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-4028"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000005, 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 r126-tajo-158961389800106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;