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.r137-smll-167819419000612.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 ltsminxred
Input is DrinkVendingMachine-COL-76, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819419000612
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-76-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678982786195

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-76
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 16:06:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 16:06:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 16:06:28] [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-16 16:06:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 16:06:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 727 ms
[2023-03-16 16:06:29] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 912 PT places and 1.0277329672E10 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 16:06:29] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 5 ms.
[2023-03-16 16:06:29] [INFO ] Skeletonized 3 HLPN properties in 2 ms. Removed 13 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
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-16 16:06:30] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 35 ms.
[2023-03-16 16:06:30] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA DrinkVendingMachine-COL-76-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-76-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-76-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 8 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 16:06:30] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-16 16:06:30] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
[2023-03-16 16:06:30] [INFO ] Invariant cache hit.
[2023-03-16 16:06:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 16:06:30] [INFO ] Invariant cache hit.
[2023-03-16 16:06:30] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-16 16:06:30] [INFO ] Invariant cache hit.
[2023-03-16 16:06:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 16:06:30] [INFO ] Flatten gal took : 18 ms
[2023-03-16 16:06:30] [INFO ] Flatten gal took : 5 ms
[2023-03-16 16:06:30] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 4682 steps, including 1 resets, run visited all 12 properties in 35 ms. (steps per millisecond=133 )
FORMULA DrinkVendingMachine-COL-76-LTLFireability-06 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' '!(G((G((p0 U p1)) U (p1 U X(p2)))))'
Support contains 5 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-16 16:06:31] [INFO ] Invariant cache hit.
[2023-03-16 16:06:31] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-16 16:06:31] [INFO ] Invariant cache hit.
[2023-03-16 16:06:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-16 16:06:31] [INFO ] Invariant cache hit.
[2023-03-16 16:06:31] [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-16 16:06:31] [INFO ] Invariant cache hit.
[2023-03-16 16:06:31] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 460 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(OR p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s8 1)), p0:(AND (GEQ s4 1) (GEQ s8 1) (NOT (AND (GEQ s6 1) (GEQ s8 1) (GEQ s10 2)))), p2:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s10 1))], 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]]
Product exploration explored 100000 steps with 33314 reset in 365 ms.
Product exploration explored 100000 steps with 33288 reset in 309 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 736 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10057 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=251 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 16:06:33] [INFO ] Invariant cache hit.
[2023-03-16 16:06:33] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p2)), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 15 factoid took 924 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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-16 16:06:34] [INFO ] Invariant cache hit.
[2023-03-16 16:06:34] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-16 16:06:34] [INFO ] Invariant cache hit.
[2023-03-16 16:06:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 16:06:35] [INFO ] Invariant cache hit.
[2023-03-16 16:06:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-16 16:06:35] [INFO ] Invariant cache hit.
[2023-03-16 16:06:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 332 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 349 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=116 )
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 408 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 33262 reset in 143 ms.
Product exploration explored 100000 steps with 33366 reset in 249 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 16:06:37] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-16 16:06:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 10/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 12/12 places, 10/10 transitions.
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 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-16 16:06:37] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [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-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-00 finished in 6395 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(X(p0))&&G(p1)) U p2)))'
Support contains 5 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-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}]], initial=0, aps=[p2:(LT s9 1), p1:(GEQ s11 1), p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3))], 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][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-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-02 finished in 357 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)||(X(!p0)&&p1))))'
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.
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-16 16:06:37] [INFO ] Invariant cache hit.
[2023-03-16 16:06:37] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), false]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s8 1)), p0:(LT s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-76-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-04 finished in 1019 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((F(p0) U (!p1||X(G(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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-16 16:06:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 16:06:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-16 16:06:38] [INFO ] Invariant cache hit.
[2023-03-16 16:06:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-16 16:06:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 16:06:38] [INFO ] Invariant cache hit.
[2023-03-16 16:06:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(NOT p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(LT s9 1), p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (AND (GEQ s4 1) (GEQ s8 1))), p2:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Product exploration explored 100000 steps with 5 reset in 192 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 15 factoid took 916 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-16 16:06:40] [INFO ] Invariant cache hit.
[2023-03-16 16:06:40] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2023-03-16 16:06:40] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND p1 (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 19 factoid took 991 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1)]
[2023-03-16 16:06:41] [INFO ] Invariant cache hit.
[2023-03-16 16:06:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 16:06:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 16:06:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-16 16:06:42] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 16:06:42] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Support contains 7 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-16 16:06:42] [INFO ] Invariant cache hit.
[2023-03-16 16:06:42] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 16:06:42] [INFO ] Invariant cache hit.
[2023-03-16 16:06:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-16 16:06:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 16:06:42] [INFO ] Invariant cache hit.
[2023-03-16 16:06:42] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 10/10 places, 9/9 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 p0 (NOT p2) p1), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR p0 (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1)]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3338 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 16:06:42] [INFO ] Invariant cache hit.
[2023-03-16 16:06:42] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR p0 (NOT p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 (NOT p2)))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p1 (NOT p2)))), (F (AND p1 p2)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 442 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
[2023-03-16 16:06:43] [INFO ] Invariant cache hit.
[2023-03-16 16:06:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 16:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 16:06:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-16 16:06:43] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 16:06:43] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 76 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-16 16:06:43] [INFO ] Invariant cache hit.
[2023-03-16 16:06:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 16:06:43] [INFO ] Invariant cache hit.
[2023-03-16 16:06:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-16 16:06:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 16:06:43] [INFO ] Invariant cache hit.
[2023-03-16 16:06:43] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-05 finished in 5002 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(p1)||p0) U p2)))'
Support contains 9 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-16 16:06:43] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-16 16:06:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-16 16:06:43] [INFO ] Invariant cache hit.
[2023-03-16 16:06:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 16:06:43] [INFO ] Invariant cache hit.
[2023-03-16 16:06:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-16 16:06:43] [INFO ] Invariant cache hit.
[2023-03-16 16:06:43] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s10 1)), p0:(OR (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3))), p1:(GEQ s11 1)], 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 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 188 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-76-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-07 finished in 709 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)))'
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 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 16:06:44] [INFO ] Invariant cache hit.
[2023-03-16 16:06:44] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-16 16:06:44] [INFO ] Invariant cache hit.
[2023-03-16 16:06:44] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-16 16:06:44] [INFO ] Invariant cache hit.
[2023-03-16 16:06:44] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-16 16:06:44] [INFO ] Invariant cache hit.
[2023-03-16 16:06:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s10 2))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-76-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-08 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' '!(X((p0||F(p1)||X(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 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 16:06:45] [INFO ] Invariant cache hit.
[2023-03-16 16:06:45] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-16 16:06:45] [INFO ] Invariant cache hit.
[2023-03-16 16:06:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-16 16:06:45] [INFO ] Invariant cache hit.
[2023-03-16 16:06:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-16 16:06:45] [INFO ] Invariant cache hit.
[2023-03-16 16:06:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(GEQ s11 1), p0:(AND (GEQ s5 1) (GEQ s8 1) (GEQ s10 1))], 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 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 75 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-76-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-09 finished in 517 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((p0||G(F(p1)))))'
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 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 16:06:45] [INFO ] Invariant cache hit.
[2023-03-16 16:06:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-16 16:06:45] [INFO ] Invariant cache hit.
[2023-03-16 16:06:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 16:06:45] [INFO ] Invariant cache hit.
[2023-03-16 16:06:45] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-16 16:06:45] [INFO ] Invariant cache hit.
[2023-03-16 16:06:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s8 1)), p1:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s10 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 79 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 p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DrinkVendingMachine-COL-76-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-10 finished in 502 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 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 2 ms. Remains 6 /12 variables (removed 6) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-16 16:06:46] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 16:06:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-16 16:06:46] [INFO ] Invariant cache hit.
[2023-03-16 16:06:46] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-16 16:06:46] [INFO ] Invariant cache hit.
[2023-03-16 16:06:46] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-16 16:06:46] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-16 16:06:46] [INFO ] Invariant cache hit.
[2023-03-16 16:06:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/12 places, 7/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 6/12 places, 7/10 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s4 3))], 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 89 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA DrinkVendingMachine-COL-76-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-11 finished in 262 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(p0)||F((X(p1)&&(!p2 U p1)&&(p1||X(!p2))))))'
Support contains 5 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-16 16:06:46] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 16:06:46] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-16 16:06:46] [INFO ] Invariant cache hit.
[2023-03-16 16:06:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 16:06:46] [INFO ] Invariant cache hit.
[2023-03-16 16:06:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-16 16:06:46] [INFO ] Invariant cache hit.
[2023-03-16 16:06:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}]], initial=3, aps=[p1:(GEQ s11 1), p2:(LT s9 1), p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29898 reset in 192 ms.
Product exploration explored 100000 steps with 29903 reset in 207 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 p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 1033 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10023 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1002 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 16:06:48] [INFO ] Invariant cache hit.
[2023-03-16 16:06:48] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 16:06:48] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 16:06:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 16:06:48] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 16:06:48] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-16 16:06:48] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 380 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=126 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F p1), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 13 factoid took 1262 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 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-16 16:06:50] [INFO ] Invariant cache hit.
[2023-03-16 16:06:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-16 16:06:50] [INFO ] Invariant cache hit.
[2023-03-16 16:06:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-16 16:06:50] [INFO ] Invariant cache hit.
[2023-03-16 16:06:50] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-16 16:06:50] [INFO ] Invariant cache hit.
[2023-03-16 16:06:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 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 p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 1060 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10020 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2004 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 16:06:51] [INFO ] Invariant cache hit.
[2023-03-16 16:06:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 16:06:51] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 16:06:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 16:06:51] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 16:06:51] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-16 16:06:51] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 380 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=126 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F p1), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 13 factoid took 1285 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 29865 reset in 200 ms.
Product exploration explored 100000 steps with 29952 reset in 212 ms.
Support contains 5 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-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-12 finished in 8111 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 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-16 16:06:54] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 16:06:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-16 16:06:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-13 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s6 1)), p1:(AND (OR (LT s5 1) (LT s6 1) (LT s8 3)) (GEQ s4 1) (GEQ s6 1) (GEQ s8 2))], 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 140 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 0 ms.
FORMULA DrinkVendingMachine-COL-76-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-13 finished in 374 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(X(p1)))))'
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 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-16 16:06:54] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 16:06:54] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-16 16:06:54] [INFO ] Invariant cache hit.
[2023-03-16 16:06:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 314 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s10 3)), p1:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s10 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 153 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-76-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-15 finished in 436 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((G((p0 U p1)) U (p1 U X(p2)))))'
Found a Lengthening insensitive property : DrinkVendingMachine-COL-76-LTLFireability-00
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1)]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 10 transition count 9
Applied a total of 3 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-16 16:06:55] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 16:06:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-16 16:06:55] [INFO ] Invariant cache hit.
[2023-03-16 16:06:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-16 16:06:55] [INFO ] Invariant cache hit.
[2023-03-16 16:06:55] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-16 16:06:55] [INFO ] Invariant cache hit.
[2023-03-16 16:06:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 111 ms. Remains : 10/12 places, 9/10 transitions.
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(OR p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s6 1)), p0:(AND (GEQ s3 1) (GEQ s6 1) (NOT (AND (GEQ s5 1) (GEQ s6 1) (GEQ s8 2)))), p2:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33296 reset in 136 ms.
Product exploration explored 100000 steps with 33328 reset in 157 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 657 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10027 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=911 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 16:06:57] [INFO ] Invariant cache hit.
[2023-03-16 16:06:57] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p2)), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 15 factoid took 834 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Support contains 4 out of 10 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-16 16:06:58] [INFO ] Invariant cache hit.
[2023-03-16 16:06:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-16 16:06:58] [INFO ] Invariant cache hit.
[2023-03-16 16:06:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-16 16:06:58] [INFO ] Invariant cache hit.
[2023-03-16 16:06:58] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-16 16:06:58] [INFO ] Invariant cache hit.
[2023-03-16 16:06:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 10/10 places, 9/9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Finished random walk after 771 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=385 )
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 394 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 33268 reset in 98 ms.
Product exploration explored 100000 steps with 33170 reset in 114 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 253 ms :[(NOT p2), (NOT p2), (NOT p2), true]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-16 16:07:00] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 16:07:00] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-16 16:07:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 16:07:00] [INFO ] Invariant cache hit.
[2023-03-16 16:07:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/10 places, 9/9 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 10/10 places, 9/9 transitions.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 10 cols
[2023-03-16 16:07:00] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 16:07:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-16 16:07:00] [INFO ] Invariant cache hit.
[2023-03-16 16:07:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-16 16:07:00] [INFO ] Invariant cache hit.
[2023-03-16 16:07:00] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-16 16:07:00] [INFO ] Invariant cache hit.
[2023-03-16 16:07:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-00 finished in 5064 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((F(p0) U (!p1||X(G(p2)))))))'
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(p0)||F((X(p1)&&(!p2 U p1)&&(p1||X(!p2))))))'
Found a Shortening insensitive property : DrinkVendingMachine-COL-76-LTLFireability-12
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 3 ms. Remains 6 /12 variables (removed 6) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 6 cols
[2023-03-16 16:07:00] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-16 16:07:00] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-16 16:07:00] [INFO ] Invariant cache hit.
[2023-03-16 16:07:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-16 16:07:00] [INFO ] Invariant cache hit.
[2023-03-16 16:07:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-16 16:07:00] [INFO ] Invariant cache hit.
[2023-03-16 16:07:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 6/12 places, 7/10 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 98 ms. Remains : 6/12 places, 7/10 transitions.
Running random walk in product with property : DrinkVendingMachine-COL-76-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}]], initial=3, aps=[p1:(GEQ s5 1), p2:(LT s3 1), p0:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s4 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30528 reset in 163 ms.
Product exploration explored 100000 steps with 30540 reset in 171 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 p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 1067 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10021 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 16:07:02] [INFO ] Invariant cache hit.
[2023-03-16 16:07:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 16:07:02] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 16:07:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 16:07:02] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 16:07:02] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 16:07:02] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 380 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=190 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F p1), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 13 factoid took 1348 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-16 16:07:04] [INFO ] Invariant cache hit.
[2023-03-16 16:07:04] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-16 16:07:04] [INFO ] Invariant cache hit.
[2023-03-16 16:07:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-16 16:07:04] [INFO ] Invariant cache hit.
[2023-03-16 16:07:04] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-16 16:07:04] [INFO ] Invariant cache hit.
[2023-03-16 16:07:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 6/6 places, 7/7 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 p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 1178 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10020 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2505 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 16:07:05] [INFO ] Invariant cache hit.
[2023-03-16 16:07:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 16:07:05] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 16:07:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-16 16:07:05] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 16:07:05] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-16 16:07:05] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 380 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=190 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F p1), (F (AND p0 p1 p2)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 13 factoid took 1199 ms. Reduced automaton from 6 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 30616 reset in 162 ms.
Product exploration explored 100000 steps with 30581 reset in 175 ms.
Support contains 5 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-16 16:07:08] [INFO ] Invariant cache hit.
[2023-03-16 16:07:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-16 16:07:08] [INFO ] Invariant cache hit.
[2023-03-16 16:07:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-16 16:07:08] [INFO ] Invariant cache hit.
[2023-03-16 16:07:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-16 16:07:08] [INFO ] Invariant cache hit.
[2023-03-16 16:07:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 6/6 places, 7/7 transitions.
Treatment of property DrinkVendingMachine-COL-76-LTLFireability-12 finished in 7971 ms.
[2023-03-16 16:07:08] [INFO ] Flatten gal took : 4 ms
[2023-03-16 16:07:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 16:07:08] [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 39544 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3222/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3222/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3222/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DrinkVendingMachine-COL-76-LTLFireability-00
Could not compute solution for formula : DrinkVendingMachine-COL-76-LTLFireability-05
Could not compute solution for formula : DrinkVendingMachine-COL-76-LTLFireability-12

BK_STOP 1678982829835

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DrinkVendingMachine-COL-76-LTLFireability-00
ltl formula formula --ltl=/tmp/3222/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 10 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3222/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3222/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3222/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3222/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name DrinkVendingMachine-COL-76-LTLFireability-05
ltl formula formula --ltl=/tmp/3222/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 10 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3222/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3222/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3222/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3222/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DrinkVendingMachine-COL-76-LTLFireability-12
ltl formula formula --ltl=/tmp/3222/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 10 transitions and 34 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3222/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3222/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3222/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3222/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DrinkVendingMachine-COL-76, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819419000612"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;