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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.8K Mar 31 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:29 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 3.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 22K 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-COL-02-00
FORMULA_NAME DrinkVendingMachine-COL-02-01
FORMULA_NAME DrinkVendingMachine-COL-02-02
FORMULA_NAME DrinkVendingMachine-COL-02-03
FORMULA_NAME DrinkVendingMachine-COL-02-04
FORMULA_NAME DrinkVendingMachine-COL-02-05
FORMULA_NAME DrinkVendingMachine-COL-02-06
FORMULA_NAME DrinkVendingMachine-COL-02-07
FORMULA_NAME DrinkVendingMachine-COL-02-08
FORMULA_NAME DrinkVendingMachine-COL-02-09
FORMULA_NAME DrinkVendingMachine-COL-02-10
FORMULA_NAME DrinkVendingMachine-COL-02-11
FORMULA_NAME DrinkVendingMachine-COL-02-12
FORMULA_NAME DrinkVendingMachine-COL-02-13
FORMULA_NAME DrinkVendingMachine-COL-02-14
FORMULA_NAME DrinkVendingMachine-COL-02-15

=== Now, execution of the tool begins

BK_START 1590139731757

[2020-05-22 09:28:53] [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 09:28:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 09:28:53] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-22 09:28:54] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2020-05-22 09:28:54] [INFO ] sort/places :
Options->theOptions,optionSlots,
Products->theProducts,productSlots,
Quality->ready,wait,

[2020-05-22 09:28:54] [INFO ] o3 symmetric to o1 in transition elaborate3
[2020-05-22 09:28:54] [INFO ] o1 symmetric to o2 in transition elaborate3
[2020-05-22 09:28:54] [INFO ] o1 symmetric to o2 in transition elaborate2
[2020-05-22 09:28:54] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 23 ms.
[2020-05-22 09:28:54] [INFO ] Computed order based on color domains.
[2020-05-22 09:28:54] [INFO ] Unfolded HLPN to a Petri net with 24 places and 52 transitions in 7 ms.
[2020-05-22 09:28:54] [INFO ] Unfolded HLPN properties in 0 ms.
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 540 ms. (steps per millisecond=185 ) 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, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 52 rows 24 cols
[2020-05-22 09:28:54] [INFO ] Computed 12 place invariants in 4 ms
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned unsat
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2020-05-22 09:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-05-22 09:28:55] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2020-05-22 09:28:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:28:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2020-05-22 09:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:55] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-05-22 09:28:55] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2020-05-22 09:28:55] [INFO ] Added : 36 causal constraints over 8 iterations in 63 ms. Result :sat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2020-05-22 09:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-05-22 09:28:55] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 13 ms.
[2020-05-22 09:28:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:28:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2020-05-22 09:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:55] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-05-22 09:28:55] [INFO ] Computed and/alt/rep : 36/152/36 causal constraints in 5 ms.
[2020-05-22 09:28:55] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
[2020-05-22 09:28:55] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned unsat
Successfully simplified 18 atomic propositions for a total of 21 simplifications.
[2020-05-22 09:28:55] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-22 09:28:55] [INFO ] Flatten gal took : 38 ms
FORMULA DrinkVendingMachine-COL-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 09:28:55] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 09:28:55] [INFO ] Applying decomposition
[2020-05-22 09:28:55] [INFO ] Flatten gal took : 8 ms
[2020-05-22 09:28:55] [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/graph6130603335728919596.txt, -o, /tmp/graph6130603335728919596.bin, -w, /tmp/graph6130603335728919596.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/graph6130603335728919596.bin, -l, -1, -v, -w, /tmp/graph6130603335728919596.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 52 rows 24 cols
[2020-05-22 09:28:55] [INFO ] Computed 12 place invariants in 1 ms
inv : theOptions_0 + optionSlots_0 = 1
inv : ready_5 + wait_5 = 1
inv : theOptions_1 + optionSlots_1 = 1
inv : theProducts_0 + productSlots_0 = 1
inv : ready_4 + wait_4 = 1
inv : ready_0 + wait_0 = 1
inv : theProducts_1 + productSlots_1 = 1
inv : ready_1 + wait_1 = 1
inv : ready_7 + wait_7 = 1
inv : ready_3 + wait_3 = 1
inv : ready_2 + wait_2 = 1
inv : ready_6 + wait_6 = 1
Total of 12 invariants.
[2020-05-22 09:28:55] [INFO ] Computed 12 place invariants in 4 ms
[2020-05-22 09:28:55] [INFO ] Decomposing Gal with order
[2020-05-22 09:28:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 09:28:55] [INFO ] Removed a total of 112 redundant transitions.
[2020-05-22 09:28:55] [INFO ] Proved 24 variables to be positive in 67 ms
[2020-05-22 09:28:55] [INFO ] Flatten gal took : 30 ms
[2020-05-22 09:28:55] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2020-05-22 09:28:55] [INFO ] Computation of disable matrix completed :0/52 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 09:28:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 09:28:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-22 09:28:55] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2020-05-22 09:28:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 09:28:55] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-22 09:28:55] [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((F(G(X("(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))"))))&&(X("(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))")))))
Formula 0 simplified : !X(X"(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))" & FGX"(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.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.029034,16928,1,0,448,70,409,350,55,59,1660
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G(X("((((((((((((((((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||((((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))&&(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1))))")))))
Formula 1 simplified : GX"((((((((((((((((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||((((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))&&(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1))))"
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.040117,17508,1,0,1928,70,544,2286,55,59,6074
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(X((F(("(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))")U("((((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))&&((u9.productSlots_0>=1)||(u8.productSlots_1>=1)))")))||(F(!(X("(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))"))))))))
Formula 2 simplified : !XX(F("(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))" U "((((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))&&((u9.productSlots_0>=1)||(u8.productSlots_1>=1)))") | F!X"(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))")
4 unique states visited
0 strongly connected components in search stack
3 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.045168,17984,1,0,2274,70,592,2755,55,59,7286
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(G(X((((((((((G("((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))"))||("(u0.ready_0>=1)"))||("(u4.ready_1>=1)"))||("(u5.ready_2>=1)"))||("(u6.ready_3>=1)"))||("(u1.ready_4>=1)"))||("(u7.ready_5>=1)"))||("(u2.ready_6>=1)"))||("(u3.ready_7>=1)"))U("((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))")))))))
Formula 3 simplified : !GFGX(("(u0.ready_0>=1)" | "(u1.ready_4>=1)" | "(u2.ready_6>=1)" | "(u3.ready_7>=1)" | "(u4.ready_1>=1)" | "(u5.ready_2>=1)" | "(u6.ready_3>=1)" | "(u7.ready_5>=1)" | G"((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))") U "((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=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.057045,19756,1,0,2379,70,679,2927,56,59,7823
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(G(F(G("((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))")))))))
Formula 4 simplified : !G!GFG"((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))"
3 unique states visited
3 strongly connected components in search stack
4 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.058848,19756,1,0,2437,70,691,3030,56,59,8002
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G((F(X(("((((((((((((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2))||((((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))")U("((((((((((u6.wait_3>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))||(((u5.wait_2>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=1)))||(((u5.wait_2>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1)))||(((u5.wait_2>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=1)))||(((u6.wait_3>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1)))||(((u5.wait_2>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1)))||(((u6.wait_3>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=1)))||(((u6.wait_3>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=1)))"))))U(X("((((((((((u6.wait_3>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))||(((u5.wait_2>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=1)))||(((u5.wait_2>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1)))||(((u5.wait_2>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=1)))||(((u6.wait_3>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1)))||(((u5.wait_2>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1)))||(((u6.wait_3>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=1)))||(((u6.wait_3>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=1)))"))))))
Formula 5 simplified : G(FX("((((((((((((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2))||((((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))" U "((((((((((u6.wait_3>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))||(((u5.wait_2>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=1)))||(((u5.wait_2>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1)))||(((u5.wait_2>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=1)))||(((u6.wait_3>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1)))||(((u5.wait_2>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1)))||(((u6.wait_3>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=1)))||(((u6.wait_3>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=1)))") U X"((((((((((u6.wait_3>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))||(((u5.wait_2>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=1)))||(((u5.wait_2>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1)))||(((u5.wait_2>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=1)))||(((u6.wait_3>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1)))||(((u5.wait_2>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1)))||(((u6.wait_3>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=1)))||(((u6.wait_3>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=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.061985,19756,1,0,2510,70,754,3161,56,59,8331
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(G(X(F(G(("((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))")U(G("((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))"))))))))&&(G(F("((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))")))))
Formula 6 simplified : !(XGXFG("((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))" U G"((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))") & GF"((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))")
2 unique states visited
2 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.063709,19756,1,0,2510,70,754,3161,56,59,8331
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G((("((((((((((((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2))||((((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))")U(F("((u11.optionSlots_0>=1)||(u10.optionSlots_1>=1))")))||((F(G("((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))")))&&(X("((((((((((((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2))||((((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))")))))))
Formula 7 simplified : !XG(("((((((((((((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2))||((((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))" U F"((u11.optionSlots_0>=1)||(u10.optionSlots_1>=1))") | (FG"((((((((u0.ready_0>=1)||(u4.ready_1>=1))||(u5.ready_2>=1))||(u6.ready_3>=1))||(u1.ready_4>=1))||(u7.ready_5>=1))||(u2.ready_6>=1))||(u3.ready_7>=1))" & X"((((((((((((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2))||((((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u10.theOptions_1>=2)))||(((u7.wait_5>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u7.wait_5>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))||(((u1.wait_4>=1)&&(u9.theProducts_0>=1))&&(u11.theOptions_0>=2)))||((((u1.wait_4>=1)&&(u8.theProducts_1>=1))&&(u11.theOptions_0>=1))&&(u10.theOptions_1>=1)))"))
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.06975,20020,1,0,2911,70,790,3799,56,59,9534
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(!(F("((((((((u0.ready_0<1)&&(u4.ready_1<1))&&(u5.ready_2<1))&&(u6.ready_3<1))&&(u1.ready_4<1))&&(u7.ready_5<1))&&(u2.ready_6<1))&&(u3.ready_7<1))"))))U(!(X("((u9.productSlots_0>=1)||(u8.productSlots_1>=1))")))))
Formula 8 simplified : !(X!F"((((((((u0.ready_0<1)&&(u4.ready_1<1))&&(u5.ready_2<1))&&(u6.ready_3<1))&&(u1.ready_4<1))&&(u7.ready_5<1))&&(u2.ready_6<1))&&(u3.ready_7<1))" U !X"((u9.productSlots_0>=1)||(u8.productSlots_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.087881,20812,1,0,4844,70,861,7009,56,59,15902
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F("(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))"))))
Formula 9 simplified : !XF"(((((u4.wait_1>=1)&&(u9.theProducts_0>=1))||((u0.wait_0>=1)&&(u9.theProducts_0>=1)))||((u4.wait_1>=1)&&(u8.theProducts_1>=1)))||((u0.wait_0>=1)&&(u8.theProducts_1>=1)))"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.089246,21076,1,0,4844,70,872,7009,56,59,15920
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-15 TRUE 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 09:28:55] [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 1590139736042

--------------------
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-COL-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-COL-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-158922814900810"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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