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-167819418900595.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-24, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418900595
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.2K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K 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 49K 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 4.1K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 13K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 28K 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-24-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-24-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678974979976

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-COL-24
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 13:56:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 13:56:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 13:56:23] [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 13:56:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 13:56:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 791 ms
[2023-03-16 13:56:24] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 288 PT places and 3.3235344E7 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 13:56:24] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 8 ms.
[2023-03-16 13:56:24] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10011 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 26) seen :25
Finished Best-First random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
[2023-03-16 13:56:24] [INFO ] Flatten gal took : 31 ms
[2023-03-16 13:56:24] [INFO ] Flatten gal took : 6 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:96) in guard (LEQ $x 23)introduces in Quality(96) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:96) in guard (AND (GT $x 23) (LEQ $x 47))introduces in Quality(96) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:96) in guard (AND (GT $x 47) (LEQ $x 71))introduces in Quality(96) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:96) in guard (AND (GT $x 71) (LEQ $x 95))introduces in Quality(96) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 96 reducing to 4 values.
For transition elaborate0:(LEQ $x 23) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 23) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 47) (LEQ $x 71)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 71) (LEQ $x 95)) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 24
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 24
[2023-03-16 13:56:24] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 28 ms.
[2023-03-16 13:56:24] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 11 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 13:56:24] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-16 13:56:25] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
[2023-03-16 13:56:25] [INFO ] Invariant cache hit.
[2023-03-16 13:56:25] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-16 13:56:25] [INFO ] Invariant cache hit.
[2023-03-16 13:56:25] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-16 13:56:25] [INFO ] Invariant cache hit.
[2023-03-16 13:56:25] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 515 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 13:56:25] [INFO ] Flatten gal took : 3 ms
[2023-03-16 13:56:25] [INFO ] Flatten gal took : 5 ms
[2023-03-16 13:56:25] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Finished Best-First random walk after 2249 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=118 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:56:26] [INFO ] Invariant cache hit.
[2023-03-16 13:56:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-16 13:56:26] [INFO ] Invariant cache hit.
[2023-03-16 13:56:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-16 13:56:26] [INFO ] Invariant cache hit.
[2023-03-16 13:56:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-16 13:56:26] [INFO ] Invariant cache hit.
[2023-03-16 13:56:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s0)], 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 40626 reset in 481 ms.
Stack based approach found an accepted trace after 269 steps with 113 reset with depth 4 and stack size 4 in 2 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-00 finished in 1030 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(F(!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 13:56:27] [INFO ] Invariant cache hit.
[2023-03-16 13:56:27] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2023-03-16 13:56:27] [INFO ] Invariant cache hit.
[2023-03-16 13:56:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-16 13:56:27] [INFO ] Invariant cache hit.
[2023-03-16 13:56:27] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-16 13:56:27] [INFO ] Invariant cache hit.
[2023-03-16 13:56:27] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), true, (NOT p1), p2]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 (ADD s8 s9 s10 s11)), p1:(LEQ 2 (ADD s8 s9 s10 s11)), p2:(LEQ 1 s0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-24-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-01 finished in 506 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)||G((p1||X(p2)))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:56:27] [INFO ] Invariant cache hit.
[2023-03-16 13:56:27] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-16 13:56:27] [INFO ] Invariant cache hit.
[2023-03-16 13:56:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-16 13:56:27] [INFO ] Invariant cache hit.
[2023-03-16 13:56:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-16 13:56:27] [INFO ] Invariant cache hit.
[2023-03-16 13:56:27] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p2:(GT 2 s0), p1:(GT (ADD s8 s9 s10 s11) s1), p0:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 264 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 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 23 factoid took 1938 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 13:56:30] [INFO ] Invariant cache hit.
[2023-03-16 13:56:30] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 13:56:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 13:56:30] [INFO ] After 39ms SMT Verify possible using all constraints in natural 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 p2 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p2 p0 (NOT p1)))), (F (AND p2 p0 p1)), (F (AND (NOT p2) (NOT p0))), (F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 25 factoid took 2107 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:56:33] [INFO ] Invariant cache hit.
[2023-03-16 13:56:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-16 13:56:33] [INFO ] Invariant cache hit.
[2023-03-16 13:56:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-16 13:56:33] [INFO ] Invariant cache hit.
[2023-03-16 13:56:33] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-16 13:56:33] [INFO ] Invariant cache hit.
[2023-03-16 13:56:33] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 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 p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 15 factoid took 1153 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 5168 steps, including 1 resets, run visited all 10 properties in 5 ms. (steps per millisecond=1033 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p2 (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND p2 p0 p1)), (F (AND p0 p1))]
Knowledge based reduction with 15 factoid took 1542 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 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 13:56:38] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-16 13:56:38] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-16 13:56:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:38] [INFO ] Invariant cache hit.
[2023-03-16 13:56:38] [INFO ] Dead Transitions using invariants and state equation in 31 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 87 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 13:56:38] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 13:56:38] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-16 13:56:38] [INFO ] Invariant cache hit.
[2023-03-16 13:56:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-16 13:56:38] [INFO ] Invariant cache hit.
[2023-03-16 13:56:38] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-16 13:56:38] [INFO ] Invariant cache hit.
[2023-03-16 13:56:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-02 finished in 11101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U G(p1))||X(X(F(p2)))))))'
Support contains 5 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:56:38] [INFO ] Invariant cache hit.
[2023-03-16 13:56:38] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-16 13:56:38] [INFO ] Invariant cache hit.
[2023-03-16 13:56:38] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-16 13:56:38] [INFO ] Invariant cache hit.
[2023-03-16 13:56:38] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-16 13:56:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:38] [INFO ] Invariant cache hit.
[2023-03-16 13:56:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 (ADD s8 s9 s10 s11)), p2:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 201 ms.
Product exploration explored 100000 steps with 0 reset in 226 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) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 50 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 316 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-16 13:56:40] [INFO ] Invariant cache hit.
[2023-03-16 13:56:40] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-16 13:56:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 13:56:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 13:56:40] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 13:56:40] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:56:40] [INFO ] Invariant cache hit.
[2023-03-16 13:56:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-16 13:56:40] [INFO ] Invariant cache hit.
[2023-03-16 13:56:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-16 13:56:40] [INFO ] Invariant cache hit.
[2023-03-16 13:56:40] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-16 13:56:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 13:56:40] [INFO ] Invariant cache hit.
[2023-03-16 13:56:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 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) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 4 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 50 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 338 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-16 13:56:41] [INFO ] Invariant cache hit.
[2023-03-16 13:56:41] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-16 13:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 13:56:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-16 13:56:41] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 13:56:41] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 201 ms.
Product exploration explored 100000 steps with 2 reset in 212 ms.
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 3 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 13:56:42] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-16 13:56:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 13:56:42] [INFO ] Invariant cache hit.
[2023-03-16 13:56:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-16 13:56:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:42] [INFO ] Invariant cache hit.
[2023-03-16 13:56:42] [INFO ] Dead Transitions using invariants and state equation in 35 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 111 ms. Remains : 10/12 places, 9/10 transitions.
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-03 finished in 3537 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||G(p1)))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 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 13:56:42] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 13:56:42] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-16 13:56:42] [INFO ] Invariant cache hit.
[2023-03-16 13:56:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-16 13:56:42] [INFO ] Invariant cache hit.
[2023-03-16 13:56:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-16 13:56:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:42] [INFO ] Invariant cache hit.
[2023-03-16 13:56:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 167 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7) s1), p0:(LEQ s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7 reset in 222 ms.
Stack based approach found an accepted trace after 145 steps with 2 reset with depth 77 and stack size 71 in 1 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-04 finished in 503 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)))'
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 1 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 3 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 13:56:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 13:56:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-16 13:56:42] [INFO ] Invariant cache hit.
[2023-03-16 13:56:42] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-16 13:56:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:42] [INFO ] Invariant cache hit.
[2023-03-16 13:56:42] [INFO ] Dead Transitions using invariants and state equation in 36 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 139 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 2 (ADD s6 s7 s8 s9)) (GT 1 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1791 reset in 167 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-06 finished in 427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((!p0||X(p1))))||G((!p1&&X(p0))))))'
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 2 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 13:56:43] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 13:56:43] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-16 13:56:43] [INFO ] Invariant cache hit.
[2023-03-16 13:56:43] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-16 13:56:43] [INFO ] Invariant cache hit.
[2023-03-16 13:56:43] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-16 13:56:43] [INFO ] Invariant cache hit.
[2023-03-16 13:56:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 394 ms :[true, (AND (NOT p0) (NOT p1)), (OR (NOT p0) p1), false, false, (AND (NOT p1) p0), false, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 7}, { cond=(AND p1 p0), acceptance={} source=1 dest: 8}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 p0), acceptance={} source=3 dest: 8}], [{ cond=p1, acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 7}, { cond=p0, acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=4, aps=[p1:(GT s1 s0), p0:(LEQ 2 (ADD s8 s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-08 finished in 567 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 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:56:43] [INFO ] Invariant cache hit.
[2023-03-16 13:56:43] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-16 13:56:43] [INFO ] Invariant cache hit.
[2023-03-16 13:56:43] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 13:56:43] [INFO ] Invariant cache hit.
[2023-03-16 13:56:43] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-16 13:56:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:43] [INFO ] Invariant cache hit.
[2023-03-16 13:56:43] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s0 s3) (LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 s11)))], 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 105 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-09 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(G(p1))||G(p2)))))'
Support contains 10 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s0 (ADD s8 s9 s10 s11)), p2:(GT 1 (ADD s8 s9 s10 s11)), p1:(AND (GT 2 (ADD s4 s5 s6 s7)) (GT (ADD s8 s9 s10 s11) s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-10 finished in 486 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((F(p0)&&G((p1&&X((p1 U (p2||G(p1))))))))))'
Support contains 2 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 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT 2 s3), p0:(AND (LEQ 1 s3) (LEQ s0 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-11 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (F(p2) U p3)))'
Support contains 9 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 4 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 13:56:44] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 13:56:44] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:44] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-16 13:56:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:44] [INFO ] Invariant cache hit.
[2023-03-16 13:56:45] [INFO ] Dead Transitions using invariants and state equation in 39 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 122 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p3), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(GT 3 (ADD s2 s3 s4 s5)), p2:(LEQ (ADD s6 s7 s8 s9) s1), p0:(AND (LEQ (ADD s6 s7 s8 s9) (ADD s2 s3 s4 s5)) (LEQ 3 (ADD s2 s3 s4 s5))), p1:(LEQ 3 (ADD s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 624 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-12 finished in 934 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)))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 4 ms. Remains 8 /12 variables (removed 4) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-16 13:56:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-16 13:56:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-16 13:56:45] [INFO ] Invariant cache hit.
[2023-03-16 13:56:45] [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 13:56:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:45] [INFO ] Invariant cache hit.
[2023-03-16 13:56:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 8/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 8/12 places, 8/10 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 208 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-13 finished in 383 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 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 13:56:46] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 13:56:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-16 13:56:46] [INFO ] Invariant cache hit.
[2023-03-16 13:56:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-16 13:56:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:46] [INFO ] Invariant cache hit.
[2023-03-16 13:56:46] [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 88 ms. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s6 s7 s8 s9) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 0 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-14 finished in 252 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)||G(p1))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 4 transition count 6
Applied a total of 12 rules in 3 ms. Remains 4 /12 variables (removed 8) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-16 13:56:46] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-16 13:56:46] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-16 13:56:46] [INFO ] Invariant cache hit.
[2023-03-16 13:56:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-16 13:56:46] [INFO ] Invariant cache hit.
[2023-03-16 13:56:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-16 13:56:46] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-16 13:56:46] [INFO ] Invariant cache hit.
[2023-03-16 13:56:46] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/12 places, 6/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 4/12 places, 6/10 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s1 s3) (GT 1 s3)), p1:(GT s1 s3)], nbAcceptance=2, 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 152 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA DrinkVendingMachine-COL-24-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-15 finished in 308 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)||G((p1||X(p2)))))'
Found a Lengthening insensitive property : DrinkVendingMachine-COL-24-LTLCardinality-02
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Support contains 10 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 1 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 13:56:47] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-16 13:56:47] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-16 13:56:47] [INFO ] Invariant cache hit.
[2023-03-16 13:56:47] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-16 13:56:47] [INFO ] Invariant cache hit.
[2023-03-16 13:56:47] [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 13:56:47] [INFO ] Invariant cache hit.
[2023-03-16 13:56:47] [INFO ] Dead Transitions using invariants and state equation in 26 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 100 ms. Remains : 10/12 places, 9/10 transitions.
Running random walk in product with property : DrinkVendingMachine-COL-24-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p2:(GT 2 s0), p1:(GT (ADD s6 s7 s8 s9) s1), p0:(LEQ (ADD s6 s7 s8 s9) (ADD s2 s3 s4 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 104 ms.
Product exploration explored 100000 steps with 0 reset in 291 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 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 23 factoid took 2033 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10017 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 13:56:50] [INFO ] Invariant cache hit.
[2023-03-16 13:56:50] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 13:56:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-16 13:56:50] [INFO ] After 34ms SMT Verify possible using all constraints in natural 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 p2 (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p2 p0 (NOT p1)))), (F (AND p2 p0 p1)), (F (AND (NOT p2) (NOT p0))), (F (AND p0 p1)), (F (NOT p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F p1)]
Knowledge based reduction with 25 factoid took 2270 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 10 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.
[2023-03-16 13:56:52] [INFO ] Invariant cache hit.
[2023-03-16 13:56:53] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-16 13:56:53] [INFO ] Invariant cache hit.
[2023-03-16 13:56:53] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-16 13:56:53] [INFO ] Invariant cache hit.
[2023-03-16 13:56:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-16 13:56:53] [INFO ] Invariant cache hit.
[2023-03-16 13:56:53] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 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 p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 15 factoid took 1359 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Finished random walk after 1603 steps, including 0 resets, run visited all 10 properties in 7 ms. (steps per millisecond=229 )
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0 p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p2 (NOT p0))), (F (AND (NOT p2) p0)), (F (NOT p2)), (F (AND p2 p1)), (F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND p2 p0 p1)), (F (AND p0 p1))]
Knowledge based reduction with 15 factoid took 1626 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 181 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 10 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 0 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-16 13:56:57] [INFO ] Invariant cache hit.
[2023-03-16 13:56:57] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-16 13:56:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 13:56:57] [INFO ] Invariant cache hit.
[2023-03-16 13:56:57] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 10/10 places, 9/9 transitions.
Support contains 10 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 0 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-16 13:56:58] [INFO ] Invariant cache hit.
[2023-03-16 13:56:58] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-16 13:56:58] [INFO ] Invariant cache hit.
[2023-03-16 13:56:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 13:56:58] [INFO ] Invariant cache hit.
[2023-03-16 13:56:58] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-16 13:56:58] [INFO ] Invariant cache hit.
[2023-03-16 13:56:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 10/10 places, 9/9 transitions.
Treatment of property DrinkVendingMachine-COL-24-LTLCardinality-02 finished in 11386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U G(p1))||X(X(F(p2)))))))'
[2023-03-16 13:56:58] [INFO ] Flatten gal took : 5 ms
[2023-03-16 13:56:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-16 13:56:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 34 arcs took 0 ms.
Total runtime 35173 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2357/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2357/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DrinkVendingMachine-COL-24-LTLCardinality-02
Could not compute solution for formula : DrinkVendingMachine-COL-24-LTLCardinality-03

BK_STOP 1678975020048

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name DrinkVendingMachine-COL-24-LTLCardinality-02
ltl formula formula --ltl=/tmp/2357/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( 2/ 4): LTL layer: formula: /tmp/2357/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2357/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2357/ltl_0_
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/2357/ltl_0_
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
free(): double free detected in tcache 2
ltl formula name DrinkVendingMachine-COL-24-LTLCardinality-03
ltl formula formula --ltl=/tmp/2357/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 12 places, 10 transitions and 34 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2357/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2357/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2357/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2357/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DrinkVendingMachine-COL-24"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="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-24, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819418900595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-24.tgz
mv DrinkVendingMachine-COL-24 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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