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.r066-tajo-158922814900866.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 DrinkVendingMachine-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814900866
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 3.5K Mar 31 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 31 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 30 00:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 28 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 27 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 27 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 68K Mar 24 05:37 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 DrinkVendingMachine-PT-02-00
FORMULA_NAME DrinkVendingMachine-PT-02-01
FORMULA_NAME DrinkVendingMachine-PT-02-02
FORMULA_NAME DrinkVendingMachine-PT-02-03
FORMULA_NAME DrinkVendingMachine-PT-02-04
FORMULA_NAME DrinkVendingMachine-PT-02-05
FORMULA_NAME DrinkVendingMachine-PT-02-06
FORMULA_NAME DrinkVendingMachine-PT-02-07
FORMULA_NAME DrinkVendingMachine-PT-02-08
FORMULA_NAME DrinkVendingMachine-PT-02-09
FORMULA_NAME DrinkVendingMachine-PT-02-10
FORMULA_NAME DrinkVendingMachine-PT-02-11
FORMULA_NAME DrinkVendingMachine-PT-02-12
FORMULA_NAME DrinkVendingMachine-PT-02-13
FORMULA_NAME DrinkVendingMachine-PT-02-14
FORMULA_NAME DrinkVendingMachine-PT-02-15

=== Now, execution of the tool begins

BK_START 1590146580514

[2020-05-22 11:23:13] [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-22 11:23:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 11:23:13] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-05-22 11:23:13] [INFO ] Transformed 24 places.
[2020-05-22 11:23:13] [INFO ] Transformed 72 transitions.
[2020-05-22 11:23:13] [INFO ] Parsed PT model containing 24 places and 72 transitions in 84 ms.
[2020-05-22 11:23:13] [INFO ] Reduced 4 identical enabling conditions.
[2020-05-22 11:23:13] [INFO ] Reduced 16 identical enabling conditions.
[2020-05-22 11:23:13] [INFO ] Reduced 16 identical enabling conditions.
[2020-05-22 11:23:13] [INFO ] Reduced 16 identical enabling conditions.
[2020-05-22 11:23:13] [INFO ] Reduced 16 identical enabling conditions.
[2020-05-22 11:23:13] [INFO ] Reduced 16 identical enabling conditions.
[2020-05-22 11:23:13] [INFO ] Reduced 4 identical enabling conditions.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 416 ms. (steps per millisecond=240 ) properties seen :[1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 52 rows 24 cols
[2020-05-22 11:23:14] [INFO ] Computed 12 place invariants in 4 ms
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 27 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-22 11:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 11:23:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-05-22 11:23:14] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 10 ms.
[2020-05-22 11:23:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 11:23:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2020-05-22 11:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 11:23:14] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-05-22 11:23:14] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2020-05-22 11:23:14] [INFO ] Added : 36 causal constraints over 8 iterations in 49 ms. Result :sat
Successfully simplified 19 atomic propositions for a total of 27 simplifications.
[2020-05-22 11:23:14] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-22 11:23:14] [INFO ] Flatten gal took : 34 ms
FORMULA DrinkVendingMachine-PT-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 11:23:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-22 11:23:14] [INFO ] Flatten gal took : 10 ms
[2020-05-22 11:23:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DrinkVendingMachine-PT-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-22 11:23:14] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 11:23:14] [INFO ] Flatten gal took : 10 ms
[2020-05-22 11:23:14] [INFO ] Input system was already deterministic with 52 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/graph9344223842019288172.txt, -o, /tmp/graph9344223842019288172.bin, -w, /tmp/graph9344223842019288172.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/graph9344223842019288172.bin, -l, -1, -v, -w, /tmp/graph9344223842019288172.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 11:23:15] [INFO ] Decomposing Gal with order
[2020-05-22 11:23:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 11:23:15] [INFO ] Removed a total of 112 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 52 rows 24 cols
[2020-05-22 11:23:15] [INFO ] Computed 12 place invariants in 1 ms
inv : wait_6 + ready_6 = 1
inv : theProducts_2 + productSlots_2 = 1
inv : theOptions_2 + optionSlots_2 = 1
inv : wait_1 + ready_1 = 1
inv : theProducts_1 + productSlots_1 = 1
inv : wait_5 + ready_5 = 1
inv : wait_8 + ready_8 = 1
inv : wait_2 + ready_2 = 1
inv : wait_4 + ready_4 = 1
inv : wait_7 + ready_7 = 1
inv : theOptions_1 + optionSlots_1 = 1
inv : wait_3 + ready_3 = 1
Total of 12 invariants.
[2020-05-22 11:23:15] [INFO ] Computed 12 place invariants in 4 ms
[2020-05-22 11:23:15] [INFO ] Flatten gal took : 35 ms
[2020-05-22 11:23:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-22 11:23:15] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-22 11:23:15] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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 6 LTL properties
Checking formula 0 : !((X((F(G(X("(((((u5.wait_2>=1)&&(u3.theProducts_2>=1))||((u5.wait_2>=1)&&(u2.theProducts_1>=1)))||((u0.wait_1>=1)&&(u3.theProducts_2>=1)))||((u0.wait_1>=1)&&(u2.theProducts_1>=1)))"))))&&(X("(((((u5.wait_2>=1)&&(u3.theProducts_2>=1))||((u5.wait_2>=1)&&(u2.theProducts_1>=1)))||((u0.wait_1>=1)&&(u3.theProducts_2>=1)))||((u0.wait_1>=1)&&(u2.theProducts_1>=1)))")))))
Formula 0 simplified : !X(X"(((((u5.wait_2>=1)&&(u3.theProducts_2>=1))||((u5.wait_2>=1)&&(u2.theProducts_1>=1)))||((u0.wait_1>=1)&&(u3.theProducts_2>=1)))||((u0.wait_1>=1)&&(u2.theProducts_1>=1)))" & FGX"(((((u5.wait_2>=1)&&(u3.theProducts_2>=1))||((u5.wait_2>=1)&&(u2.theProducts_1>=1)))||((u0.wait_1>=1)&&(u3.theProducts_2>=1)))||((u0.wait_1>=1)&&(u2.theProducts_1>=1)))")
built 36 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 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.030496,17132,1,0,564,72,445,441,55,61,1776
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G(X("((((((((((((((((((u5.wait_2>=1)&&(u3.theProducts_2>=1))||((u5.wait_2>=1)&&(u2.theProducts_1>=1)))||((u0.wait_1>=1)&&(u3.theProducts_2>=1)))||((u0.wait_1>=1)&&(u2.theProducts_1>=1)))||(((u9.wait_6>=1)&&(u2.theProducts_1>=1))&&(u11.theOptions_1>=2)))||((((u6.wait_5>=1)&&(u2.theProducts_1>=1))&&(u11.theOptions_1>=1))&&(u4.theOptions_2>=1)))||(((u9.wait_6>=1)&&(u2.theProducts_1>=1))&&(u4.theOptions_2>=2)))||(((u9.wait_6>=1)&&(u3.theProducts_2>=1))&&(u11.theOptions_1>=2)))||((((u6.wait_5>=1)&&(u3.theProducts_2>=1))&&(u11.theOptions_1>=1))&&(u4.theOptions_2>=1)))||(((u6.wait_5>=1)&&(u2.theProducts_1>=1))&&(u11.theOptions_1>=2)))||(((u6.wait_5>=1)&&(u2.theProducts_1>=1))&&(u4.theOptions_2>=2)))||((((u9.wait_6>=1)&&(u2.theProducts_1>=1))&&(u11.theOptions_1>=1))&&(u4.theOptions_2>=1)))||(((u6.wait_5>=1)&&(u3.theProducts_2>=1))&&(u11.theOptions_1>=2)))||((((u9.wait_6>=1)&&(u3.theProducts_2>=1))&&(u11.theOptions_1>=1))&&(u4.theOptions_2>=1)))||(((u6.wait_5>=1)&&(u3.theProducts_2>=1))&&(u4.theOptions_2>=2)))||(((u9.wait_6>=1)&&(u3.theProducts_2>=1))&&(u4.theOptions_2>=2)))&&(((((u5.wait_2>=1)&&(u3.theProducts_2>=1))||((u5.wait_2>=1)&&(u2.theProducts_1>=1)))||((u0.wait_1>=1)&&(u3.theProducts_2>=1)))||((u0.wait_1>=1)&&(u2.theProducts_1>=1))))")))))
Formula 1 simplified : GX"((((((((((((((((((u5.wait_2>=1)&&(u3.theProducts_2>=1))||((u5.wait_2>=1)&&(u2.theProducts_1>=1)))||((u0.wait_1>=1)&&(u3.theProducts_2>=1)))||((u0.wait_1>=1)&&(u2.theProducts_1>=1)))||(((u9.wait_6>=1)&&(u2.theProducts_1>=1))&&(u11.theOptions_1>=2)))||((((u6.wait_5>=1)&&(u2.theProducts_1>=1))&&(u11.theOptions_1>=1))&&(u4.theOptions_2>=1)))||(((u9.wait_6>=1)&&(u2.theProducts_1>=1))&&(u4.theOptions_2>=2)))||(((u9.wait_6>=1)&&(u3.theProducts_2>=1))&&(u11.theOptions_1>=2)))||((((u6.wait_5>=1)&&(u3.theProducts_2>=1))&&(u11.theOptions_1>=1))&&(u4.theOptions_2>=1)))||(((u6.wait_5>=1)&&(u2.theProducts_1>=1))&&(u11.theOptions_1>=2)))||(((u6.wait_5>=1)&&(u2.theProducts_1>=1))&&(u4.theOptions_2>=2)))||((((u9.wait_6>=1)&&(u2.theProducts_1>=1))&&(u11.theOptions_1>=1))&&(u4.theOptions_2>=1)))||(((u6.wait_5>=1)&&(u3.theProducts_2>=1))&&(u11.theOptions_1>=2)))||((((u9.wait_6>=1)&&(u3.theProducts_2>=1))&&(u11.theOptions_1>=1))&&(u4.theOptions_2>=1)))||(((u6.wait_5>=1)&&(u3.theProducts_2>=1))&&(u4.theOptions_2>=2)))||(((u9.wait_6>=1)&&(u3.theProducts_2>=1))&&(u4.theOptions_2>=2)))&&(((((u5.wait_2>=1)&&(u3.theProducts_2>=1))||((u5.wait_2>=1)&&(u2.theProducts_1>=1)))||((u0.wait_1>=1)&&(u3.theProducts_2>=1)))||((u0.wait_1>=1)&&(u2.theProducts_1>=1))))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.046578,17776,1,0,3013,72,581,3365,55,61,7465
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F((X(F(G((F(G("(u3.productSlots_2>=1)")))&&("(u6.ready_5<1)")))))U(F("(u3.productSlots_2>=1)")))))
Formula 2 simplified : !F(XFG("(u6.ready_5<1)" & FG"(u3.productSlots_2>=1)") U F"(u3.productSlots_2>=1)")
[2020-05-22 11:23:15] [INFO ] Proved 24 variables to be positive in 112 ms
[2020-05-22 11:23:15] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2020-05-22 11:23:15] [INFO ] Computation of disable matrix completed :0/52 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 11:23:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 11:23:15] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2020-05-22 11:23:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.048816,18040,1,0,3103,72,663,3484,56,61,7799
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G(F(X(X(X(G(!(X("(u3.productSlots_2>=1)")))))))))))
Formula 3 simplified : !FGFXXXG!X"(u3.productSlots_2>=1)"
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.051554,18692,1,0,3128,72,671,3512,56,61,8035
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(X(((F(G("(u4.optionSlots_2>=1)")))&&("(u5.wait_2>=1)"))&&("(u2.theProducts_1>=1)"))))))
Formula 4 simplified : !G!X("(u2.theProducts_1>=1)" & "(u5.wait_2>=1)" & FG"(u4.optionSlots_2>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.059233,19244,1,0,3570,72,812,4020,57,61,9231
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(!(X(G(F("(((((u0.wait_1>=1)&&(u3.theProducts_2>=1))||(u9.ready_6>=1))||(u5.wait_2<1))||(u3.theProducts_2<1))")))))))
Formula 5 simplified : !F!XGF"(((((u0.wait_1>=1)&&(u3.theProducts_2>=1))||(u9.ready_6>=1))||(u5.wait_2<1))||(u3.theProducts_2<1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.082671,20296,1,0,6834,72,842,8337,57,61,15416
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DrinkVendingMachine-PT-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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:768)
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-22 11:23:15] [INFO ] Built C files in 287ms 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 1590146596673

--------------------
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="DrinkVendingMachine-PT-02"
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 DrinkVendingMachine-PT-02, 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 r066-tajo-158922814900866"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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