Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151800422.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DrinkVendingMachine-COL-24, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151800422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 8.8K Apr 12 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 23:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 23:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 23:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Apr 12 23:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 28K May 18 16:42 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-24-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716448496841

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-24
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-23 07:14:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 07:14:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:14:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-23 07:14:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-23 07:14:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 444 ms
[2024-05-23 07:14:59] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 288 PT places and 3.3235344E7 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-23 07:14:59] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 5 ms.
[2024-05-23 07:14:59] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 3526 steps, including 1 resets, run visited all 19 properties in 40 ms. (steps per millisecond=88 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-23 07:14:59] [INFO ] Flatten gal took : 12 ms
[2024-05-23 07:14:59] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:96) in guard (LEQ $x 23)introduces in Quality(96) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:96) in guard (AND (GT $x 23) (LEQ $x 47))introduces in Quality(96) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:96) in guard (AND (GT $x 47) (LEQ $x 71))introduces in Quality(96) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:96) in guard (AND (GT $x 71) (LEQ $x 95))introduces in Quality(96) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 96 reducing to 4 values.
For transition elaborate0:(LEQ $x 23) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 23) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 47) (LEQ $x 71)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 71) (LEQ $x 95)) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 24
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 24
[2024-05-23 07:14:59] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 11 ms.
[2024-05-23 07:14:59] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-23 07:14:59] [INFO ] Computed 6 invariants in 4 ms
[2024-05-23 07:14:59] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
[2024-05-23 07:14:59] [INFO ] Invariant cache hit.
[2024-05-23 07:14:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 07:14:59] [INFO ] Invariant cache hit.
[2024-05-23 07:14:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-23 07:14:59] [INFO ] Invariant cache hit.
[2024-05-23 07:14:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2024-05-23 07:14:59] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:14:59] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:14:59] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 18) seen :13
Finished Best-First random walk after 3299 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=253 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(!p0)))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 4 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-23 07:14:59] [INFO ] Computed 4 invariants in 2 ms
[2024-05-23 07:15:00] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 07:15:00] [INFO ] Invariant cache hit.
[2024-05-23 07:15:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-23 07:15:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:15:00] [INFO ] Invariant cache hit.
[2024-05-23 07:15:00] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 8/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 8/12 places, 8/10 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 190 ms :[false, false]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 1 (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-00 finished in 557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(!p0)&&F(p1))))'
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 4 transition count 6
Applied a total of 12 rules in 3 ms. Remains 4 /12 variables (removed 8) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-05-23 07:15:00] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 07:15:00] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-23 07:15:00] [INFO ] Invariant cache hit.
[2024-05-23 07:15:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 07:15:00] [INFO ] Invariant cache hit.
[2024-05-23 07:15:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-23 07:15:00] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-23 07:15:00] [INFO ] Invariant cache hit.
[2024-05-23 07:15:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/12 places, 6/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 4/12 places, 6/10 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), p0, (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s2 s1), p1:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-01 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 2 transition count 5
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 3 ms. Remains 2 /12 variables (removed 10) and now considering 2/10 (removed 8) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-23 07:15:00] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 07:15:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 07:15:00] [INFO ] Invariant cache hit.
[2024-05-23 07:15:00] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-23 07:15:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:15:00] [INFO ] Invariant cache hit.
[2024-05-23 07:15:00] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 2/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 2/12 places, 2/10 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 5 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-02 finished in 205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((p0||G(p1))))||G(p2))))'
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-23 07:15:01] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 07:15:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-23 07:15:01] [INFO ] Invariant cache hit.
[2024-05-23 07:15:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 07:15:01] [INFO ] Invariant cache hit.
[2024-05-23 07:15:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-23 07:15:01] [INFO ] Invariant cache hit.
[2024-05-23 07:15:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 3}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=5, aps=[p1:(LEQ s2 (ADD s4 s5 s6 s7)), p0:(LEQ 2 s1), p2:(LEQ s0 (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Product exploration explored 100000 steps with 0 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 8 factoid took 303 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-23 07:15:02] [INFO ] Invariant cache hit.
[2024-05-23 07:15:02] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 07:15:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 07:15:02] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-23 07:15:02] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-23 07:15:02] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 222 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=44 )
Parikh walk visited 3 properties in 5 ms.
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:15:02] [INFO ] Invariant cache hit.
[2024-05-23 07:15:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 12/12 places, 10/10 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2912438 steps, run timeout after 3001 ms. (steps per millisecond=970 ) properties seen :{}
Probabilistic random walk after 2912438 steps, saw 871392 distinct states, run finished after 3004 ms. (steps per millisecond=969 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 07:15:05] [INFO ] Invariant cache hit.
[2024-05-23 07:15:05] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:15:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:15:05] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:15:05] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 07:15:05] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 222 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=111 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p1 (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 819 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 331 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:15:07] [INFO ] Invariant cache hit.
[2024-05-23 07:15:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-23 07:15:07] [INFO ] Invariant cache hit.
[2024-05-23 07:15:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 07:15:07] [INFO ] Invariant cache hit.
[2024-05-23 07:15:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-23 07:15:07] [INFO ] Invariant cache hit.
[2024-05-23 07:15:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10021 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-23 07:15:08] [INFO ] Invariant cache hit.
[2024-05-23 07:15:08] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 07:15:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:15:08] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-23 07:15:08] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-23 07:15:08] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 310 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=62 )
Parikh walk visited 2 properties in 4 ms.
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:15:08] [INFO ] Invariant cache hit.
[2024-05-23 07:15:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 12/12 places, 10/10 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3452174 steps, run timeout after 3001 ms. (steps per millisecond=1150 ) properties seen :{}
Probabilistic random walk after 3452174 steps, saw 1021476 distinct states, run finished after 3001 ms. (steps per millisecond=1150 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 07:15:11] [INFO ] Invariant cache hit.
[2024-05-23 07:15:11] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:15:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-23 07:15:11] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:15:11] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-23 07:15:11] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0) p2)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 6 factoid took 708 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 277 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 304 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
Applying partial POR strategy [true, false, true, true, true, true, false, false]
Stuttering acceptance computed with spot in 292 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 4 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:15:13] [INFO ] Invariant cache hit.
[2024-05-23 07:15:13] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-23 07:15:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:15:13] [INFO ] Invariant cache hit.
[2024-05-23 07:15:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 12/12 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin1408512720355569937
[2024-05-23 07:15:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1408512720355569937
Running compilation step : cd /tmp/ltsmin1408512720355569937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin1408512720355569937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1408512720355569937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15362291570163645587.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:15:28] [INFO ] Invariant cache hit.
[2024-05-23 07:15:28] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-23 07:15:28] [INFO ] Invariant cache hit.
[2024-05-23 07:15:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 07:15:28] [INFO ] Invariant cache hit.
[2024-05-23 07:15:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-23 07:15:29] [INFO ] Invariant cache hit.
[2024-05-23 07:15:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 12/12 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin15594572415572694474
[2024-05-23 07:15:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15594572415572694474
Running compilation step : cd /tmp/ltsmin15594572415572694474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin15594572415572694474;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15594572415572694474;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5502784903221159065.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 07:15:44] [INFO ] Flatten gal took : 5 ms
[2024-05-23 07:15:44] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:15:44] [INFO ] Time to serialize gal into /tmp/LTL11174967033994113345.gal : 1 ms
[2024-05-23 07:15:44] [INFO ] Time to serialize properties into /tmp/LTL491194315911446520.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11174967033994113345.gal' '-t' 'CGAL' '-hoa' '/tmp/aut239772596025857885.hoa' '-atoms' '/tmp/LTL491194315911446520.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL491194315911446520.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut239772596025857885.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-23 07:15:59] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:15:59] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:15:59] [INFO ] Time to serialize gal into /tmp/LTL7666223579159473387.gal : 0 ms
[2024-05-23 07:15:59] [INFO ] Time to serialize properties into /tmp/LTL13973512216239178210.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7666223579159473387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13973512216239178210.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(G(("(theOptions_0>=2)")||(G("(productSlots_0<=((wait_0+wait_1)+(wait_2+wait_3)))")))))||(G("(optionSlots_0<=((ready_0+ready_1)...181
Formula 0 simplified : X(XF(!"(theOptions_0>=2)" & F!"(productSlots_0<=((wait_0+wait_1)+(wait_2+wait_3)))") & F!"(optionSlots_0<=((ready_0+ready_1)+(ready_...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-23 07:16:14] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:16:14] [INFO ] Applying decomposition
[2024-05-23 07:16:14] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6688586749940403304.txt' '-o' '/tmp/graph6688586749940403304.bin' '-w' '/tmp/graph6688586749940403304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6688586749940403304.bin' '-l' '-1' '-v' '-w' '/tmp/graph6688586749940403304.weights' '-q' '0' '-e' '0.001'
[2024-05-23 07:16:14] [INFO ] Decomposing Gal with order
[2024-05-23 07:16:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 07:16:14] [INFO ] Flatten gal took : 10 ms
[2024-05-23 07:16:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 07:16:14] [INFO ] Time to serialize gal into /tmp/LTL12426303677152412547.gal : 1 ms
[2024-05-23 07:16:14] [INFO ] Time to serialize properties into /tmp/LTL4013774395988192571.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12426303677152412547.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4013774395988192571.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(G(("(gu1.theOptions_0>=2)")||(G("(gu0.productSlots_0<=((gu0.wait_0+gu0.wait_1)+(gu0.wait_2+gu0.wait_3)))")))))||(G("(gu1.optio...225
Formula 0 simplified : X(XF(!"(gu1.theOptions_0>=2)" & F!"(gu0.productSlots_0<=((gu0.wait_0+gu0.wait_1)+(gu0.wait_2+gu0.wait_3)))") & F!"(gu1.optionSlots_0...213
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10401665880784049348
[2024-05-23 07:16:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10401665880784049348
Running compilation step : cd /tmp/ltsmin10401665880784049348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin10401665880784049348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10401665880784049348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](((LTLAPp0==true)||[]((LTLAPp1==true)))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-06 finished in 103496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&X(X(p1))))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:16:44] [INFO ] Invariant cache hit.
[2024-05-23 07:16:44] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-23 07:16:44] [INFO ] Invariant cache hit.
[2024-05-23 07:16:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 07:16:44] [INFO ] Invariant cache hit.
[2024-05-23 07:16:44] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-23 07:16:44] [INFO ] Invariant cache hit.
[2024-05-23 07:16:44] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s1 s0), p1:(GT 3 s0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6065 reset in 172 ms.
Stack based approach found an accepted trace after 197 steps with 18 reset with depth 7 and stack size 7 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-09 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 2 transition count 5
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 3 ms. Remains 2 /12 variables (removed 10) and now considering 2/10 (removed 8) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-23 07:16:45] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 07:16:45] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 07:16:45] [INFO ] Invariant cache hit.
[2024-05-23 07:16:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-23 07:16:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:16:45] [INFO ] Invariant cache hit.
[2024-05-23 07:16:45] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 2/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 2/12 places, 2/10 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-10 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 2 transition count 5
Applied a total of 15 rules in 3 ms. Remains 2 /12 variables (removed 10) and now considering 5/10 (removed 5) transitions.
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2024-05-23 07:16:45] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 07:16:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-23 07:16:45] [INFO ] Invariant cache hit.
[2024-05-23 07:16:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 07:16:45] [INFO ] Invariant cache hit.
[2024-05-23 07:16:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-23 07:16:45] [INFO ] Redundant transitions in 12 ms returned [1, 2]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-23 07:16:45] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 07:16:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 3/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 121 ms. Remains : 2/12 places, 3/10 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 290 steps with 0 reset in 3 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-11 finished in 211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&X((p0&&X(F(p1))))))) U (p1&&G(p2))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-23 07:16:45] [INFO ] Computed 6 invariants in 0 ms
[2024-05-23 07:16:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-23 07:16:45] [INFO ] Invariant cache hit.
[2024-05-23 07:16:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 07:16:45] [INFO ] Invariant cache hit.
[2024-05-23 07:16:45] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-23 07:16:45] [INFO ] Invariant cache hit.
[2024-05-23 07:16:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (AND p0 (NOT p1)), (NOT p1), (AND (NOT p2) p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s1 s0), p2:(LEQ 1 (ADD s4 s5 s6 s7)), p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5213 reset in 131 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-12 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((p0 U p1)))&&G(p0))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-23 07:16:46] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 07:16:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-23 07:16:46] [INFO ] Invariant cache hit.
[2024-05-23 07:16:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 07:16:46] [INFO ] Invariant cache hit.
[2024-05-23 07:16:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 07:16:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:16:46] [INFO ] Invariant cache hit.
[2024-05-23 07:16:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s2 s3 s4 s5) s1), p1:(LEQ s0 (ADD s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-14 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-23 07:16:46] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 07:16:46] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-23 07:16:46] [INFO ] Invariant cache hit.
[2024-05-23 07:16:46] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 07:16:46] [INFO ] Invariant cache hit.
[2024-05-23 07:16:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-23 07:16:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:16:46] [INFO ] Invariant cache hit.
[2024-05-23 07:16:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s2 s0) (GT (ADD s4 s5 s6 s7) s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 101 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-15 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((p0||G(p1))))||G(p2))))'
Found a Lengthening insensitive property : DrinkVendingMachine-COL-24-LTLCardinality-06
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:16:47] [INFO ] Invariant cache hit.
[2024-05-23 07:16:47] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-23 07:16:47] [INFO ] Invariant cache hit.
[2024-05-23 07:16:47] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 07:16:47] [INFO ] Invariant cache hit.
[2024-05-23 07:16:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-23 07:16:47] [INFO ] Invariant cache hit.
[2024-05-23 07:16:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 107 ms. Remains : 12/12 places, 10/10 transitions.
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 3}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=5, aps=[p1:(LEQ s2 (ADD s4 s5 s6 s7)), p0:(LEQ 2 s1), p2:(LEQ s0 (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 8 factoid took 294 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10021 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=164 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-23 07:16:48] [INFO ] Invariant cache hit.
[2024-05-23 07:16:48] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 07:16:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:16:48] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-23 07:16:48] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-23 07:16:48] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 222 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=55 )
Parikh walk visited 3 properties in 4 ms.
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:16:48] [INFO ] Invariant cache hit.
[2024-05-23 07:16:48] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 12/12 places, 10/10 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3408411 steps, run timeout after 3001 ms. (steps per millisecond=1135 ) properties seen :{}
Probabilistic random walk after 3408411 steps, saw 1009360 distinct states, run finished after 3004 ms. (steps per millisecond=1134 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 07:16:51] [INFO ] Invariant cache hit.
[2024-05-23 07:16:51] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:16:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:16:51] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:16:51] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-23 07:16:51] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 222 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=222 )
Parikh walk visited 1 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (AND p1 (NOT p0) p2)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0) p2)), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p0 (NOT p2))), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 868 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 288 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:16:53] [INFO ] Invariant cache hit.
[2024-05-23 07:16:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-23 07:16:53] [INFO ] Invariant cache hit.
[2024-05-23 07:16:53] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 07:16:53] [INFO ] Invariant cache hit.
[2024-05-23 07:16:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-23 07:16:53] [INFO ] Invariant cache hit.
[2024-05-23 07:16:53] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2))))]
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-23 07:16:54] [INFO ] Invariant cache hit.
[2024-05-23 07:16:54] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 07:16:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-23 07:16:54] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-23 07:16:54] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-23 07:16:54] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 310 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 6 ms.
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:16:54] [INFO ] Invariant cache hit.
[2024-05-23 07:16:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 12/12 places, 10/10 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2502 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2862527 steps, run timeout after 3001 ms. (steps per millisecond=953 ) properties seen :{}
Probabilistic random walk after 2862527 steps, saw 857301 distinct states, run finished after 3001 ms. (steps per millisecond=953 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 07:16:57] [INFO ] Invariant cache hit.
[2024-05-23 07:16:57] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:16:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-23 07:16:57] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:16:57] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 07:16:57] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=196 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0) p2)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 6 factoid took 636 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 298 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 290 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Applying partial POR strategy [true, false, true, true, true, true, false, false]
Stuttering acceptance computed with spot in 286 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:16:59] [INFO ] Invariant cache hit.
[2024-05-23 07:16:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2024-05-23 07:16:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:16:59] [INFO ] Invariant cache hit.
[2024-05-23 07:16:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 12/12 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin13016632903210301416
[2024-05-23 07:16:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13016632903210301416
Running compilation step : cd /tmp/ltsmin13016632903210301416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin13016632903210301416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13016632903210301416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased296651132142058547.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-23 07:17:14] [INFO ] Invariant cache hit.
[2024-05-23 07:17:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-23 07:17:14] [INFO ] Invariant cache hit.
[2024-05-23 07:17:14] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 07:17:14] [INFO ] Invariant cache hit.
[2024-05-23 07:17:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-23 07:17:14] [INFO ] Invariant cache hit.
[2024-05-23 07:17:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 12/12 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin2770409689345470602
[2024-05-23 07:17:14] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2770409689345470602
Running compilation step : cd /tmp/ltsmin2770409689345470602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin2770409689345470602;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin2770409689345470602;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5952337803895007830.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 07:17:29] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:17:29] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:17:29] [INFO ] Time to serialize gal into /tmp/LTL10808390694814887701.gal : 1 ms
[2024-05-23 07:17:29] [INFO ] Time to serialize properties into /tmp/LTL11646596037022081067.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10808390694814887701.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7550214579174620760.hoa' '-atoms' '/tmp/LTL11646596037022081067.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11646596037022081067.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7550214579174620760.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-23 07:17:44] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:17:44] [INFO ] Flatten gal took : 3 ms
[2024-05-23 07:17:44] [INFO ] Time to serialize gal into /tmp/LTL2276389639360628541.gal : 0 ms
[2024-05-23 07:17:44] [INFO ] Time to serialize properties into /tmp/LTL3450249226825303915.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2276389639360628541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3450249226825303915.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(G(("(theOptions_0>=2)")||(G("(productSlots_0<=((wait_0+wait_1)+(wait_2+wait_3)))")))))||(G("(optionSlots_0<=((ready_0+ready_1)...181
Formula 0 simplified : X(XF(!"(theOptions_0>=2)" & F!"(productSlots_0<=((wait_0+wait_1)+(wait_2+wait_3)))") & F!"(optionSlots_0<=((ready_0+ready_1)+(ready_...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-23 07:17:59] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:17:59] [INFO ] Applying decomposition
[2024-05-23 07:17:59] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4864463825229360206.txt' '-o' '/tmp/graph4864463825229360206.bin' '-w' '/tmp/graph4864463825229360206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4864463825229360206.bin' '-l' '-1' '-v' '-w' '/tmp/graph4864463825229360206.weights' '-q' '0' '-e' '0.001'
[2024-05-23 07:17:59] [INFO ] Decomposing Gal with order
[2024-05-23 07:17:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 07:17:59] [INFO ] Flatten gal took : 4 ms
[2024-05-23 07:17:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 07:17:59] [INFO ] Time to serialize gal into /tmp/LTL9676896883953984708.gal : 1 ms
[2024-05-23 07:17:59] [INFO ] Time to serialize properties into /tmp/LTL961517846960665673.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9676896883953984708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL961517846960665673.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((X(G(("(gu1.theOptions_0>=2)")||(G("(gu0.productSlots_0<=((gu0.wait_0+gu0.wait_1)+(gu0.wait_2+gu0.wait_3)))")))))||(G("(gu1.optio...225
Formula 0 simplified : X(XF(!"(gu1.theOptions_0>=2)" & F!"(gu0.productSlots_0<=((gu0.wait_0+gu0.wait_1)+(gu0.wait_2+gu0.wait_3)))") & F!"(gu1.optionSlots_0...213
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6812581089506188834
[2024-05-23 07:18:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6812581089506188834
Running compilation step : cd /tmp/ltsmin6812581089506188834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin6812581089506188834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6812581089506188834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](((LTLAPp0==true)||[]((LTLAPp1==true)))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-06 finished in 103176 ms.
[2024-05-23 07:18:30] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12352706877337911715
[2024-05-23 07:18:30] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-23 07:18:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:18:30] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-23 07:18:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:18:30] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-23 07:18:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 07:18:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12352706877337911715
Running compilation step : cd /tmp/ltsmin12352706877337911715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 07:18:30] [INFO ] Applying decomposition
[2024-05-23 07:18:30] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18104363824269390745.txt' '-o' '/tmp/graph18104363824269390745.bin' '-w' '/tmp/graph18104363824269390745.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18104363824269390745.bin' '-l' '-1' '-v' '-w' '/tmp/graph18104363824269390745.weights' '-q' '0' '-e' '0.001'
[2024-05-23 07:18:30] [INFO ] Decomposing Gal with order
[2024-05-23 07:18:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 07:18:30] [INFO ] Flatten gal took : 5 ms
[2024-05-23 07:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 07:18:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality10834666136454728030.gal : 1 ms
[2024-05-23 07:18:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality8751168164228540265.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10834666136454728030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8751168164228540265.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X((X(G(("(gu1.theOptions_0>=2)")||(G("(gu0.productSlots_0<=((gu0.wait_0+gu0.wait_1)+(gu0.wait_2+gu0.wait_3)))")))))||(G("(gu1.optio...225
Formula 0 simplified : X(XF(!"(gu1.theOptions_0>=2)" & F!"(gu0.productSlots_0<=((gu0.wait_0+gu0.wait_1)+(gu0.wait_2+gu0.wait_3)))") & F!"(gu1.optionSlots_0...213
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin12352706877337911715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12352706877337911715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](((LTLAPp0==true)||[]((LTLAPp1==true)))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: X((X([](((LTLAPp0==true)||[]((LTLAPp1==true)))))||[]((LTLAPp2==true))))
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: "X((X([](((LTLAPp0==true)||[]((LTLAPp1==true)))))||[]((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.071: DFS-FIFO for weak LTL, using special progress label 14
pins2lts-mc-linux64( 0/ 8), 0.071: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.071: State length is 13, there are 31 groups
pins2lts-mc-linux64( 0/ 8), 0.071: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.071: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.071: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.071: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.095: ~1 levels ~960 states ~6912 transitions
pins2lts-mc-linux64( 2/ 8), 0.104: ~1 levels ~1920 states ~14256 transitions
pins2lts-mc-linux64( 2/ 8), 0.127: ~1 levels ~3840 states ~30256 transitions
pins2lts-mc-linux64( 2/ 8), 0.167: ~1 levels ~7680 states ~61088 transitions
pins2lts-mc-linux64( 2/ 8), 0.212: ~1 levels ~15360 states ~125600 transitions
pins2lts-mc-linux64( 2/ 8), 0.345: ~1 levels ~30720 states ~255736 transitions
pins2lts-mc-linux64( 6/ 8), 0.569: ~1 levels ~61440 states ~531680 transitions
pins2lts-mc-linux64( 6/ 8), 0.946: ~1 levels ~122880 states ~1068368 transitions
pins2lts-mc-linux64( 6/ 8), 1.514: ~1 levels ~245760 states ~2115672 transitions
pins2lts-mc-linux64( 2/ 8), 2.263: ~1 levels ~491520 states ~4114392 transitions
pins2lts-mc-linux64( 5/ 8), 3.257: ~1 levels ~983040 states ~8229600 transitions
pins2lts-mc-linux64( 2/ 8), 4.947: ~1 levels ~1966080 states ~16929896 transitions
pins2lts-mc-linux64( 2/ 8), 8.226: ~1 levels ~3932160 states ~33975880 transitions
pins2lts-mc-linux64( 2/ 8), 14.500: ~1 levels ~7864320 states ~68672336 transitions
pins2lts-mc-linux64( 7/ 8), 27.578: ~1 levels ~15728640 states ~136372136 transitions
pins2lts-mc-linux64( 3/ 8), 54.252: ~1 levels ~31457280 states ~273244632 transitions
pins2lts-mc-linux64( 2/ 8), 110.659: ~1 levels ~62914560 states ~559320624 transitions
pins2lts-mc-linux64( 2/ 8), 237.910: ~1 levels ~125829120 states ~1130528992 transitions
pins2lts-mc-linux64( 5/ 8), 266.831: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 266.847:
pins2lts-mc-linux64( 0/ 8), 266.847: mean standard work distribution: 1.1% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 266.847:
pins2lts-mc-linux64( 0/ 8), 266.847: Explored 129739114 states 1167976593 transitions, fanout: 9.003
pins2lts-mc-linux64( 0/ 8), 266.847: Total exploration time 266.770 sec (266.740 sec minimum, 266.753 sec on average)
pins2lts-mc-linux64( 0/ 8), 266.847: States per second: 486333, Transitions per second: 4378216
pins2lts-mc-linux64( 0/ 8), 266.847:
pins2lts-mc-linux64( 0/ 8), 266.847: Progress states detected: 134214827
pins2lts-mc-linux64( 0/ 8), 266.847: Redundant explorations: -3.3349
pins2lts-mc-linux64( 0/ 8), 266.847:
pins2lts-mc-linux64( 0/ 8), 266.847: Queue width: 8B, total height: 10086617, memory: 76.95MB
pins2lts-mc-linux64( 0/ 8), 266.847: Tree memory: 1040.0MB, 8.1 B/state, compr.: 15.0%
pins2lts-mc-linux64( 0/ 8), 266.847: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 266.847: Stored 10 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 266.847: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 266.847: Est. total memory use: 1117.0MB (~1101.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12352706877337911715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](((LTLAPp0==true)||[]((LTLAPp1==true)))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12352706877337911715;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X([](((LTLAPp0==true)||[]((LTLAPp1==true)))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
16831 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,168.326,1874008,1,0,1400,3.92429e+06,42,692,90973,6.30782e+06,3513
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 535771 ms.

BK_STOP 1716449035297

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-24"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5568"
echo " Executing tool gold2023"
echo " Input is DrinkVendingMachine-COL-24, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-171631151800422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-24.tgz
mv DrinkVendingMachine-COL-24 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;