Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414900611.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DrinkVendingMachine-COL-76, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414900611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.5K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 04:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:22 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-76-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-76-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678431720317

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-76
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 07:02:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 07:02:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 07:02:03] [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.
[2023-03-10 07:02:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 07:02:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 966 ms
[2023-03-10 07:02:04] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 912 PT places and 1.0277329672E10 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 07:02:04] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 8 ms.
[2023-03-10 07:02:04] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10047 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=197 ) properties (out of 23) seen :22
Finished Best-First random walk after 2505 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=92 )
[2023-03-10 07:02:05] [INFO ] Flatten gal took : 29 ms
[2023-03-10 07:02:05] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:304) in guard (AND (GT $x 227) (LEQ $x 303))introduces in Quality(304) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:304) in guard (AND (GT $x 151) (LEQ $x 227))introduces in Quality(304) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:304) in guard (AND (GT $x 75) (LEQ $x 151))introduces in Quality(304) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:304) in guard (LEQ $x 75)introduces in Quality(304) 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 304 reducing to 4 values.
For transition elaborate3:(AND (GT $x 227) (LEQ $x 303)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 151) (LEQ $x 227)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 75) (LEQ $x 151)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 75) -> (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 76
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 76
[2023-03-10 07:02:05] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 35 ms.
[2023-03-10 07:02:05] [INFO ] Unfolded 14 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 10 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-10 07:02:05] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-10 07:02:05] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
[2023-03-10 07:02:05] [INFO ] Invariant cache hit.
[2023-03-10 07:02:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-10 07:02:05] [INFO ] Invariant cache hit.
[2023-03-10 07:02:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-10 07:02:05] [INFO ] Invariant cache hit.
[2023-03-10 07:02:05] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-10 07:02:05] [INFO ] Flatten gal took : 5 ms
[2023-03-10 07:02:05] [INFO ] Flatten gal took : 5 ms
[2023-03-10 07:02:05] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10025 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=257 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 07:02:06] [INFO ] Invariant cache hit.
[2023-03-10 07:02:06] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-10 07:02:06] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 07:02:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-10 07:02:06] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 07:02:06] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 07:02:06] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 711 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=118 )
Parikh walk visited 3 properties in 49 ms.
FORMULA DrinkVendingMachine-COL-76-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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 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.
[2023-03-10 07:02:07] [INFO ] Invariant cache hit.
[2023-03-10 07:02:07] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-10 07:02:07] [INFO ] Invariant cache hit.
[2023-03-10 07:02:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-10 07:02:07] [INFO ] Invariant cache hit.
[2023-03-10 07:02:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-10 07:02:07] [INFO ] Invariant cache hit.
[2023-03-10 07:02:07] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 276 reset in 562 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-00 finished in 1298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
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
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 10 ms. Remains 2 /12 variables (removed 10) and now considering 2/10 (removed 8) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 07:02:08] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-10 07:02:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 07:02:08] [INFO ] Invariant cache hit.
[2023-03-10 07:02:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 07:02:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 07:02:08] [INFO ] Invariant cache hit.
[2023-03-10 07:02:08] [INFO ] Dead Transitions using invariants and state equation in 25 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 113 ms. Remains : 2/12 places, 2/10 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s0), p1:(GT s0 s1)], 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 225 ms.
Stack based approach found an accepted trace after 2866 steps with 0 reset with depth 2867 and stack size 43 in 8 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-01 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 10 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
[2023-03-10 07:02:08] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 07:02:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-10 07:02:08] [INFO ] Invariant cache hit.
[2023-03-10 07:02:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-10 07:02:08] [INFO ] Invariant cache hit.
[2023-03-10 07:02:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-10 07:02:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 07:02:09] [INFO ] Invariant cache hit.
[2023-03-10 07:02:09] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s9 s10), p1:(OR (GT 1 (ADD s4 s5 s6 s7)) (GT (ADD s0 s1 s2 s3) (ADD s4 s5 s6 s7)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 309 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-02 finished in 735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(!p0))))'
Support contains 4 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.
[2023-03-10 07:02:09] [INFO ] Invariant cache hit.
[2023-03-10 07:02:09] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-10 07:02:09] [INFO ] Invariant cache hit.
[2023-03-10 07:02:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-10 07:02:09] [INFO ] Invariant cache hit.
[2023-03-10 07:02:09] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-10 07:02:09] [INFO ] Invariant cache hit.
[2023-03-10 07:02:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), p0]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25011 reset in 470 ms.
Stack based approach found an accepted trace after 128 steps with 27 reset with depth 7 and stack size 7 in 3 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-04 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1 U (p2||G(p1)))))))'
Support contains 7 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.
[2023-03-10 07:02:10] [INFO ] Invariant cache hit.
[2023-03-10 07:02:10] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-10 07:02:10] [INFO ] Invariant cache hit.
[2023-03-10 07:02:10] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 07:02:10] [INFO ] Invariant cache hit.
[2023-03-10 07:02:10] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-10 07:02:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 07:02:10] [INFO ] Invariant cache hit.
[2023-03-10 07:02:10] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 1 s10) (LEQ 1 (ADD s4 s5 s6 s7)) (LEQ 2 s8)), p2:(AND (GT s8 s11) (GT 2 s8)), p1:(GT 2 s8)], 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 286 ms.
Stack based approach found an accepted trace after 135 steps with 0 reset with depth 136 and stack size 136 in 1 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-05 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 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 2 ms. Remains 4 /12 variables (removed 8) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-10 07:02:11] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 07:02:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-10 07:02:11] [INFO ] Invariant cache hit.
[2023-03-10 07:02:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 07:02:11] [INFO ] Invariant cache hit.
[2023-03-10 07:02:11] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-10 07:02:11] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-10 07:02:11] [INFO ] Invariant cache hit.
[2023-03-10 07:02:11] [INFO ] Dead Transitions using invariants and state equation in 37 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 177 ms. Remains : 4/12 places, 6/10 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s3 s1)], 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 143 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-76-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-06 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(!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
[2023-03-10 07:02:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-10 07:02:11] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 07:02:11] [INFO ] Invariant cache hit.
[2023-03-10 07:02:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-10 07:02:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 07:02:11] [INFO ] Invariant cache hit.
[2023-03-10 07:02:11] [INFO ] Dead Transitions using invariants and state equation in 27 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 110 ms. Remains : 2/12 places, 2/10 transitions.
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s1)], 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 7131 reset in 180 ms.
Stack based approach found an accepted trace after 351 steps with 118 reset with depth 9 and stack size 7 in 2 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-07 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(X(X(X((G(p1) U !p2))))))))'
Support contains 3 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
[2023-03-10 07:02:12] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 07:02:12] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-10 07:02:12] [INFO ] Invariant cache hit.
[2023-03-10 07:02:12] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-10 07:02:12] [INFO ] Invariant cache hit.
[2023-03-10 07:02:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-10 07:02:12] [INFO ] Invariant cache hit.
[2023-03-10 07:02:12] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 1354 ms :[p2, p2, p2, (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 7}, { cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={} source=7 dest: 11}, { cond=(NOT p0), acceptance={} source=7 dest: 12}], [{ cond=(NOT p0), acceptance={} source=8 dest: 13}], [{ cond=(NOT p0), acceptance={} source=9 dest: 14}], [{ cond=(NOT p0), acceptance={} source=10 dest: 15}], [{ cond=p2, acceptance={0} source=11 dest: 11}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p0) p2), acceptance={} source=12 dest: 13}], [{ cond=(AND (NOT p0) p2), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p0) p2), acceptance={} source=14 dest: 15}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=15 dest: 15}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=15 dest: 16}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=15 dest: 17}], [{ cond=(NOT p0), acceptance={0} source=16 dest: 16}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=17 dest: 16}, { cond=(AND (NOT p0) p1), acceptance={} source=17 dest: 17}]], initial=0, aps=[p0:(LEQ s11 s10), p2:(GT s11 s9), p1:(LEQ 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 207 ms.
Stack based approach found an accepted trace after 46 steps with 1 reset with depth 41 and stack size 41 in 1 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-08 finished in 1783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G((X(p1)||G(p2)))) U G(!p2)))'
Support contains 7 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.
[2023-03-10 07:02:13] [INFO ] Invariant cache hit.
[2023-03-10 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-10 07:02:13] [INFO ] Invariant cache hit.
[2023-03-10 07:02:13] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 07:02:13] [INFO ] Invariant cache hit.
[2023-03-10 07:02:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-10 07:02:13] [INFO ] Invariant cache hit.
[2023-03-10 07:02:13] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 678 ms :[p2, (AND (NOT p2) (NOT p1)), (AND (NOT p1) p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND p2 p1), (AND (NOT p2) p1), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={1} source=0 dest: 0}, { cond=p2, acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND p2 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 10}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={1} source=5 dest: 4}, { cond=p0, acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=5 dest: 10}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 7}, { cond=(AND p2 p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=10 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=11 dest: 3}, { cond=(AND p2 p0 p1), acceptance={1} source=11 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=11 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=11 dest: 10}, { cond=(AND p2 p0 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(GT 1 s8), p0:(LEQ s10 s11), p1:(LEQ s8 (ADD s4 s5 s6 s7))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33412 reset in 239 ms.
Product exploration explored 100000 steps with 33380 reset in 275 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 (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 38 factoid took 4119 ms. Reduced automaton from 12 states, 49 edges and 3 AP (stutter sensitive) to 12 states, 53 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 646 ms :[p2, (AND (NOT p1) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p2 (NOT p1)), true, (AND p2 p1), (AND (NOT p2) p1), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10068 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=173 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-10 07:02:20] [INFO ] Invariant cache hit.
[2023-03-10 07:02:20] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-10 07:02:20] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-10 07:02:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 07:02:20] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-10 07:02:20] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-10 07:02:20] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 952 steps, including 0 resets, run visited all 4 properties in 46 ms. (steps per millisecond=20 )
Parikh walk visited 4 properties in 46 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) (NOT p2))), (F (OR (AND p0 p1) (AND p0 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F (AND p0 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F p2), (F (AND p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND p0 p1 p2))]
Knowledge based reduction with 41 factoid took 4576 ms. Reduced automaton from 12 states, 53 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 368 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Stuttering acceptance computed with spot in 354 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Support contains 7 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.
[2023-03-10 07:02:26] [INFO ] Invariant cache hit.
[2023-03-10 07:02:26] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-10 07:02:26] [INFO ] Invariant cache hit.
[2023-03-10 07:02:26] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 07:02:26] [INFO ] Invariant cache hit.
[2023-03-10 07:02:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-10 07:02:26] [INFO ] Invariant cache hit.
[2023-03-10 07:02:26] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 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 (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1867 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 466 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 07:02:28] [INFO ] Invariant cache hit.
[2023-03-10 07:02:28] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 07:02:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 07:02:28] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 07:02:28] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-10 07:02:28] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 952 steps, including 0 resets, run visited all 3 properties in 19 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 18 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p2 p0)), (F (AND (NOT p2) p0)), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 24 factoid took 2140 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Stuttering acceptance computed with spot in 374 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Stuttering acceptance computed with spot in 349 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Product exploration explored 100000 steps with 33276 reset in 270 ms.
Product exploration explored 100000 steps with 33178 reset in 280 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 480 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Support contains 7 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 7 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 07:02:33] [INFO ] Invariant cache hit.
[2023-03-10 07:02:33] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
[2023-03-10 07:02:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 07:02:33] [INFO ] Invariant cache hit.
[2023-03-10 07:02:33] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 7 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.
[2023-03-10 07:02:33] [INFO ] Invariant cache hit.
[2023-03-10 07:02:33] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-10 07:02:33] [INFO ] Invariant cache hit.
[2023-03-10 07:02:33] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-10 07:02:33] [INFO ] Invariant cache hit.
[2023-03-10 07:02:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-10 07:02:33] [INFO ] Invariant cache hit.
[2023-03-10 07:02:33] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-10 finished in 20142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)&&(p2 U (!p3 U p0))))))'
Support contains 7 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.
[2023-03-10 07:02:33] [INFO ] Invariant cache hit.
[2023-03-10 07:02:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-10 07:02:33] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p3 (NOT p2))), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(GT 3 s11), p0:(LEQ 2 s10), p3:(LEQ 3 s9), p2:(LEQ 1 (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 142 steps with 1 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-11 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))&&(p1||X(p2)))))'
Support contains 10 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.
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s9), p0:(AND (LEQ 3 s9) (LEQ 3 (ADD s0 s1 s2 s3))), p2:(LEQ s8 (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-13 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
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 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:34] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-10 07:02:34] [INFO ] Invariant cache hit.
[2023-03-10 07:02:35] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-10 07:02:35] [INFO ] Invariant cache hit.
[2023-03-10 07:02:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ (ADD s0 s1 s2 s3) s8) (LEQ 3 s9))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-14 finished in 303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)&&X((p1&&G(F(p2)))))))'
Support contains 7 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.
[2023-03-10 07:02:35] [INFO ] Invariant cache hit.
[2023-03-10 07:02:35] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-10 07:02:35] [INFO ] Invariant cache hit.
[2023-03-10 07:02:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 07:02:35] [INFO ] Invariant cache hit.
[2023-03-10 07:02:35] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-10 07:02:35] [INFO ] Invariant cache hit.
[2023-03-10 07:02:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), true, p0, (OR (AND (NOT p0) (NOT p1)) (AND p1 (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s11 s10), p1:(GT 1 s10), p2:(GT s8 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-76-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-15 finished in 548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G((X(p1)||G(p2)))) U G(!p2)))'
Found a Lengthening insensitive property : DrinkVendingMachine-COL-76-LTLCardinality-10
Stuttering acceptance computed with spot in 670 ms :[p2, (AND (NOT p2) (NOT p1)), (AND (NOT p1) p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND p2 p1), (AND (NOT p2) p1), (AND (NOT p1) (NOT p2)), false]
Support contains 7 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.
[2023-03-10 07:02:36] [INFO ] Invariant cache hit.
[2023-03-10 07:02:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-10 07:02:36] [INFO ] Invariant cache hit.
[2023-03-10 07:02:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 07:02:36] [INFO ] Invariant cache hit.
[2023-03-10 07:02:36] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-10 07:02:36] [INFO ] Invariant cache hit.
[2023-03-10 07:02:36] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 143 ms. Remains : 12/12 places, 10/10 transitions.
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={1} source=0 dest: 0}, { cond=p2, acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}, { cond=(AND p2 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND p2 p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 10}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={1} source=5 dest: 4}, { cond=p0, acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=5 dest: 10}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 7}, { cond=(AND p2 p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=10 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 5}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=11 dest: 3}, { cond=(AND p2 p0 p1), acceptance={1} source=11 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=11 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=11 dest: 10}, { cond=(AND p2 p0 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(GT 1 s8), p0:(LEQ s10 s11), p1:(LEQ s8 (ADD s4 s5 s6 s7))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33461 reset in 247 ms.
Product exploration explored 100000 steps with 33300 reset in 285 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 (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 38 factoid took 3952 ms. Reduced automaton from 12 states, 49 edges and 3 AP (stutter sensitive) to 12 states, 53 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 688 ms :[p2, (AND (NOT p1) (NOT p2)), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p2 (NOT p1)), true, (AND p2 p1), (AND (NOT p2) p1), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10061 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=402 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-10 07:02:42] [INFO ] Invariant cache hit.
[2023-03-10 07:02:42] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-10 07:02:42] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-10 07:02:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 07:02:42] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-10 07:02:42] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 07:02:42] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 952 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=119 )
Parikh walk visited 4 properties in 7 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (AND (NOT p1) (NOT p2))), (F (OR (AND p0 p1) (AND p0 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (F (AND p0 p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F p2), (F (AND p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) p1 (NOT p2)))), (F (AND (NOT p0) p2)), (F (AND p0 p1 p2))]
Knowledge based reduction with 41 factoid took 4469 ms. Reduced automaton from 12 states, 53 edges and 3 AP (stutter insensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 349 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Stuttering acceptance computed with spot in 342 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Support contains 7 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.
[2023-03-10 07:02:47] [INFO ] Invariant cache hit.
[2023-03-10 07:02:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-10 07:02:47] [INFO ] Invariant cache hit.
[2023-03-10 07:02:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 07:02:47] [INFO ] Invariant cache hit.
[2023-03-10 07:02:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-10 07:02:47] [INFO ] Invariant cache hit.
[2023-03-10 07:02:47] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 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 (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 2104 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 07:02:50] [INFO ] Invariant cache hit.
[2023-03-10 07:02:50] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 07:02:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 07:02:50] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 07:02:50] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-10 07:02:50] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 952 steps, including 0 resets, run visited all 3 properties in 19 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 18 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p2 p0)), (F (AND (NOT p2) p0)), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND p2 (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 24 factoid took 2304 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Stuttering acceptance computed with spot in 466 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Stuttering acceptance computed with spot in 464 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Product exploration explored 100000 steps with 33214 reset in 270 ms.
Product exploration explored 100000 steps with 33282 reset in 366 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 357 ms :[p2, (NOT p1), (AND (NOT p1) p2 p0), (NOT p1), (NOT p1), true, p2]
Support contains 7 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.
[2023-03-10 07:02:55] [INFO ] Invariant cache hit.
[2023-03-10 07:02:55] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-10 07:02:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 07:02:55] [INFO ] Invariant cache hit.
[2023-03-10 07:02:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 7 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.
[2023-03-10 07:02:55] [INFO ] Invariant cache hit.
[2023-03-10 07:02:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-10 07:02:55] [INFO ] Invariant cache hit.
[2023-03-10 07:02:55] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 07:02:55] [INFO ] Invariant cache hit.
[2023-03-10 07:02:55] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-10 07:02:55] [INFO ] Invariant cache hit.
[2023-03-10 07:02:55] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property DrinkVendingMachine-COL-76-LTLCardinality-10 finished in 19861 ms.
[2023-03-10 07:02:55] [INFO ] Flatten gal took : 5 ms
[2023-03-10 07:02:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-10 07:02:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 34 arcs took 1 ms.
Total runtime 52066 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DrinkVendingMachine-COL-76
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1678431792146

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DrinkVendingMachine-COL-76-LTLCardinality-10
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DrinkVendingMachine-COL-76-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 14/32 DrinkVendingMachine-COL-76-LTLCardinality-10 2201864 m, 440372 m/sec, 6654073 t fired, .

Time elapsed: 6 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DrinkVendingMachine-COL-76-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 27/32 DrinkVendingMachine-COL-76-LTLCardinality-10 4236018 m, 406830 m/sec, 13232668 t fired, .

Time elapsed: 11 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for DrinkVendingMachine-COL-76-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DrinkVendingMachine-COL-76-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 16 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DrinkVendingMachine-COL-76-LTLCardinality-10: LTL unknown AGGR


Time elapsed: 16 secs. Pages in use: 32

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-76"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DrinkVendingMachine-COL-76, 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 r135-smll-167819414900611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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