Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110100276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DrinkVendingMachine-COL-98, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110100276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 7.5K Apr 30 05:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 05:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 05:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 05:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 48K May 10 09:33 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-98-LTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-98-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652655888767

Running Version 202205111006
[2022-05-15 23:04:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 23:04:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:04:50] [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.
[2022-05-15 23:04:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 23:04:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 586 ms
[2022-05-15 23:04:50] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 1176 PT places and 3.6529582908E10 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2022-05-15 23:04:50] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 9 ms.
[2022-05-15 23:04:50] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 298 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=74 )
[2022-05-15 23:04:50] [INFO ] Flatten gal took : 15 ms
[2022-05-15 23:04:50] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate0 : guard parameter $x(Quality:392) in guard (LEQ $x 97)introduces in Quality(392) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:392) in guard (AND (GT $x 97) (LEQ $x 195))introduces in Quality(392) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:392) in guard (AND (GT $x 195) (LEQ $x 293))introduces in Quality(392) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:392) in guard (AND (GT $x 293) (LEQ $x 391))introduces in Quality(392) partition with 2 elements
Sort wr.t. initial and guards Quality has partition Partition [nbSubs=4, partition=[3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]

Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 392 reducing to 4 values.
For transition elaborate0:(LEQ $x 97) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 97) (LEQ $x 195)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 195) (LEQ $x 293)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 293) (LEQ $x 391)) -> (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 98
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 98
[2022-05-15 23:04:50] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 18 ms.
[2022-05-15 23:04:50] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-98-LTLFireability-05 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
[2022-05-15 23:04:50] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-15 23:04:50] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:50] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:50] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:50] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:51] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 23:04:51] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2022-05-15 23:04:51] [INFO ] Flatten gal took : 3 ms
[2022-05-15 23:04:51] [INFO ] Flatten gal took : 2 ms
[2022-05-15 23:04:51] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10024 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=385 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:51] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 23:04:51] [INFO ] After 29ms 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.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DrinkVendingMachine-COL-98-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F((G(F(X(p0)))&&G(p1)))&&(X(p2)||p2)))))'
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 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
[2022-05-15 23:04:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 23:04:51] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:04:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 23:04:51] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:04:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 23:04:51] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-15 23:04:51] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 23:04:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 23:04:51] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/12 places, 8/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/12 places, 8/10 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1)), p2:(AND (GEQ s1 3) (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s2 1)], nbAcceptance=1, 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 12 reset in 208 ms.
Stack based approach found an accepted trace after 323 steps with 1 reset with depth 172 and stack size 157 in 1 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-02 finished in 683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0) U X(p1)))))'
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:52] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:52] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s6 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 419 steps with 0 reset in 4 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-03 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))&&F(G(p1))))'
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:52] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 23:04:52] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:52] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:52] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-08 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 p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s7 1)), p1:(OR (LT s3 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-08 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:52] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:52] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:52] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:52] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-10 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 s1 2) (GEQ s3 1) (GEQ s5 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 118 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 61 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-10 finished in 462 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 2 transition count 5
Applied a total of 15 rules in 2 ms. Remains 2 /12 variables (removed 10) and now considering 5/10 (removed 5) transitions.
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:04:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:04:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:04:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:04:53] [INFO ] Implicit Places using invariants in 18 ms returned []
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:04:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 23:04:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-15 23:04:53] [INFO ] Redundant transitions in 16 ms returned [1, 2]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 23:04:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 23:04:53] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 3/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2/12 places, 3/10 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-12 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(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.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:53] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-15 23:04:53] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:53] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 23:04:53] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:53] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:53] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:53] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s7 1)) (GEQ s2 1)), p1:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Product exploration explored 100000 steps with 50000 reset in 81 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 123 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-13 finished in 585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(!p0)) U (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 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:53] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:54] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:54] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:54] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:54] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:54] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), p0, (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 1)), p0:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 90 ms.
Product exploration explored 100000 steps with 20000 reset in 122 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), p0, (NOT p0)]
Incomplete random walk after 10051 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=913 ) 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.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:54] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:54] [INFO ] After 16ms 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 p1 p0), true, (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), p0, (NOT p0)]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), p0, (NOT 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.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:55] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 23:04:55] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:55] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:55] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:55] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:55] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), p0, (NOT p0)]
Finished random walk after 233 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=77 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), p0, (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), p0, (NOT p0)]
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), p0, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 108 ms.
Product exploration explored 100000 steps with 20000 reset in 123 ms.
Applying partial POR strategy [false, false, false, false, true, false]
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), p0, (NOT 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: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 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
[2022-05-15 23:04:57] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2022-05-15 23:04:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 23:04:57] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 23:04:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/12 places, 10/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Product exploration explored 100000 steps with 20000 reset in 160 ms.
Product exploration explored 100000 steps with 20000 reset in 133 ms.
Built C files in :
/tmp/ltsmin17990874881508251023
[2022-05-15 23:04:57] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17990874881508251023
Running compilation step : cd /tmp/ltsmin17990874881508251023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin17990874881508251023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17990874881508251023;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11809939538064225192.hoa' '--buchi-type=spotba'
LTSmin run took 87 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-14 finished in 4173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1))&&(X(!p0) U (p2 U !p2))))'
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 1 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 23:04:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 23:04:58] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 23:04:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-15 23:04:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-15 23:04:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 23:04:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/12 places, 9/10 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/10 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) p2), true, (NOT p1), (NOT p1), p2]
Running random walk in product with property : DrinkVendingMachine-COL-98-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 p2) (AND (NOT p0) p2)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1)), p0:(OR (LT s3 1) (LT s6 1)), p2:(AND (GEQ s1 2) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 364 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-98-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-98-LTLFireability-15 finished in 258 ms.
All properties solved by simple procedures.
Total runtime 8539 ms.

BK_STOP 1652655898484

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-98"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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-4028"
echo " Executing tool itstools"
echo " Input is DrinkVendingMachine-COL-98, 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 r078-tall-165260110100276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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