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-165260110000235.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-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 8.5K Apr 30 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 09:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 30 09:46 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.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:42 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 24K 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-10-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652654053722

Running Version 202205111006
[2022-05-15 22:34:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 22:34:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 22:34:14] [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 22:34:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-15 22:34:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 542 ms
[2022-05-15 22:34:15] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 120 PT places and 444460.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 22:34:15] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 7 ms.
[2022-05-15 22:34:15] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 6 formulas.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 596 steps, including 0 resets, run visited all 16 properties in 19 ms. (steps per millisecond=31 )
[2022-05-15 22:34:15] [INFO ] Flatten gal took : 14 ms
[2022-05-15 22:34:15] [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:40) in guard (LEQ $x 9)introduces in Quality(40) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:40) in guard (AND (GT $x 9) (LEQ $x 19))introduces in Quality(40) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:40) in guard (AND (GT $x 19) (LEQ $x 29))introduces in Quality(40) partition with 2 elements
Transition elaborate3 : guard parameter $x(Quality:40) in guard (AND (GT $x 29) (LEQ $x 39))introduces in Quality(40) 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]

Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 40 reducing to 4 values.
For transition elaborate0:(LEQ $x 9) -> (EQ $x 3)
For transition elaborate1:(AND (GT $x 9) (LEQ $x 19)) -> (EQ $x 2)
For transition elaborate2:(AND (GT $x 19) (LEQ $x 29)) -> (EQ $x 1)
For transition elaborate3:(AND (GT $x 29) (LEQ $x 39)) -> (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 10
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 10
[2022-05-15 22:34:15] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 11 ms.
[2022-05-15 22:34:15] [INFO ] Unfolded 8 HLPN properties in 0 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 7 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 22:34:15] [INFO ] Computed 6 place invariants in 8 ms
[2022-05-15 22:34:15] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:15] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:15] [INFO ] Implicit Places using invariants and state equation in 32 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 22:34:15] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:16] [INFO ] Dead Transitions using invariants and state equation in 32 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 22:34:16] [INFO ] Flatten gal took : 6 ms
[2022-05-15 22:34:16] [INFO ] Flatten gal took : 2 ms
[2022-05-15 22:34:16] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 16) seen :14
Finished Best-First random walk after 907 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=226 )
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((X(X(F(p0)))&&X(p0))))'
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 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 22:34:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:16] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:16] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:16] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:16] [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 189 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-02 finished in 393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(((G(p0) U G((p1 U p0)))||p2)))))'
Support contains 9 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 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 22:34:16] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:16] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:16] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:16] [INFO ] Implicit Places using invariants and state equation in 25 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 22:34:16] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:16] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s8 s9 s10 s11) (ADD s4 s5 s6 s7)), p0:(LEQ 2 (ADD s4 s5 s6 s7)), p1:(LEQ 2 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 254 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 507 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :3
Finished Best-First random walk after 874 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=174 )
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 719 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Support contains 9 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 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 22:34:19] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:19] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:19] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:19] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:19] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:19] [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.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 497 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :3
Finished Best-First random walk after 888 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=296 )
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (F (NOT (OR p0 p1))), (F (AND (NOT p0) p1)), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 13 factoid took 624 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 170 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p0)]
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: 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 13 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 22:34:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2022-05-15 22:34:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:22] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:22] [INFO ] Dead Transitions using invariants and state equation in 29 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 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 191 ms.
Built C files in :
/tmp/ltsmin13357845495100589139
[2022-05-15 22:34:22] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13357845495100589139
Running compilation step : cd /tmp/ltsmin13357845495100589139;'/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 164 ms.
Running link step : cd /tmp/ltsmin13357845495100589139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13357845495100589139;'/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/stateBased11235488623866328440.hoa' '--buchi-type=spotba'
LTSmin run took 6824 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-07 finished in 13030 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(F((X(p0)&&(G(p1)||p2)))))))'
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:29] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:29] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:29] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 22:34:29] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:29] [INFO ] Implicit Places using invariants and state equation in 26 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 22:34:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 1 s3), p1:(GT 3 s0), p0:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10580 reset in 139 ms.
Stack based approach found an accepted trace after 101 steps with 11 reset with depth 5 and stack size 5 in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-08 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (!(X(p2)||p1)||F(p3))))))'
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.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:30] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 22:34:30] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:30] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:30] [INFO ] Implicit Places using invariants and state equation in 22 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 22:34:30] [INFO ] Computed 6 place invariants in 10 ms
[2022-05-15 22:34:30] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), (NOT p3), (AND (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p3) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=2 dest: 5}, { cond=(AND p1 (NOT p3) p0), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 (NOT p3) p0 p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) p0 p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LEQ (ADD s8 s9 s10 s11) s3) (LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 s11))), p3:(LEQ (ADD s4 s5 s6 s7) (ADD s8 s9 s10 s11)), p0:(LEQ 1 s1), p2:(LEQ (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 113 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 28 in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-09 finished in 541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((F(p1) U p2)) U X(G(p3)))))'
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:30] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:30] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:30] [INFO ] Implicit Places using invariants and state equation in 29 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 22:34:30] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 22:34:30] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 10/10 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) p2 (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (AND (NOT p2) p3)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1) p3), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=1 dest: 0}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p3), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(LEQ s1 (ADD s8 s9 s10 s11)), p1:(LEQ s2 s3), p3:(LEQ s3 (ADD s4 s5 s6 s7)), p0:(LEQ 2 s3)], 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 1482 reset in 147 ms.
Product exploration explored 100000 steps with 1487 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p3 p0), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (AND p0 p3)), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p0 p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1073 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 18 edges and 4 AP.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) p2 (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (AND (NOT p2) p3)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:33] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:33] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 22:34:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2022-05-15 22:34:33] [INFO ] After 44ms 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 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p3 p0), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X p3), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (AND p0 p3)), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (AND p0 p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p1)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND p3 p0))), (F (NOT p0)), (F (AND (NOT p3) p0)), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F p2), (F (AND (NOT p1) p2 p3)), (F (AND (NOT p1) (NOT p2) p3)), (F (AND (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 27 factoid took 1866 ms. Reduced automaton from 6 states, 18 edges and 4 AP to 6 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (NOT p2)]
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:35] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 22:34:35] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:35] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:35] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:35] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:35] [INFO ] Dead Transitions using invariants and state equation in 42 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 (NOT p2) p3 p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p3) p0))), (X p0), (X (AND p3 p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X p1)), (X (X (AND p3 p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1047 ms. Reduced automaton from 6 states, 16 edges and 4 AP to 6 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :7
Finished Best-First random walk after 830 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=276 )
Knowledge obtained : [(AND p1 (NOT p2) p3 p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p3), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p3) p0))), (X p0), (X (AND p3 p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X p1)), (X (X (AND p3 p0))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p3)), (F (NOT (AND p3 p0))), (F (NOT p0)), (F (AND p3 (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p1))), (F (NOT p1)), (F (AND (NOT p3) p0)), (F p2)]
Knowledge based reduction with 19 factoid took 1231 ms. Reduced automaton from 6 states, 16 edges and 4 AP to 6 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1477 reset in 125 ms.
Product exploration explored 100000 steps with 1487 reset in 132 ms.
Applying partial POR strategy [true, false, false, true, true, true]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p1), (NOT p2), (NOT p2)]
Support contains 11 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 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 22:34:39] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 22:34:39] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2022-05-15 22:34:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-15 22:34:39] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 22:34:39] [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.
Product exploration explored 100000 steps with 1507 reset in 153 ms.
Product exploration explored 100000 steps with 1493 reset in 136 ms.
Built C files in :
/tmp/ltsmin11126031380446471076
[2022-05-15 22:34:40] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11126031380446471076
Running compilation step : cd /tmp/ltsmin11126031380446471076;'/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 83 ms.
Running link step : cd /tmp/ltsmin11126031380446471076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin11126031380446471076;'/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/stateBased7662515176845708386.hoa' '--buchi-type=spotba'
LTSmin run took 5674 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-10 finished in 15028 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(X(p0))))))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 2 transition count 5
Applied a total of 15 rules in 7 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 22:34:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:34:45] [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 22:34:45] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 22:34:45] [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 22:34:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:34: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.
[2022-05-15 22:34:45] [INFO ] Redundant transitions in 14 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 22:34:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:34:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 3/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2/12 places, 3/10 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-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:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-13 finished in 222 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 2 transition count 5
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 22:34:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:34:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 22:34:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:34:46] [INFO ] Implicit Places using invariants in 14 ms returned []
Normalized transition count is 3 out of 5 initially.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 22:34:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:34:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-15 22:34:46] [INFO ] Redundant transitions in 12 ms returned [1, 2]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 22:34:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:34:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 3/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 2/12 places, 3/10 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-10-LTLCardinality-15 finished in 159 ms.
All properties solved by simple procedures.
Total runtime 31409 ms.

BK_STOP 1652654086406

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-10"
export BK_EXAMINATION="LTLCardinality"
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-10, 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 r078-tall-165260110000235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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