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.r168-tall-165277016100012.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 Peterson-COL-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016100012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 7.9K Apr 30 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 09:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 43K May 10 09:34 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 Peterson-COL-3-LTLFireability-00
FORMULA_NAME Peterson-COL-3-LTLFireability-01
FORMULA_NAME Peterson-COL-3-LTLFireability-02
FORMULA_NAME Peterson-COL-3-LTLFireability-03
FORMULA_NAME Peterson-COL-3-LTLFireability-04
FORMULA_NAME Peterson-COL-3-LTLFireability-05
FORMULA_NAME Peterson-COL-3-LTLFireability-06
FORMULA_NAME Peterson-COL-3-LTLFireability-07
FORMULA_NAME Peterson-COL-3-LTLFireability-08
FORMULA_NAME Peterson-COL-3-LTLFireability-09
FORMULA_NAME Peterson-COL-3-LTLFireability-10
FORMULA_NAME Peterson-COL-3-LTLFireability-11
FORMULA_NAME Peterson-COL-3-LTLFireability-12
FORMULA_NAME Peterson-COL-3-LTLFireability-13
FORMULA_NAME Peterson-COL-3-LTLFireability-14
FORMULA_NAME Peterson-COL-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652771300889

Running Version 202205111006
[2022-05-17 07:08:22] [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-17 07:08:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:08:22] [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-17 07:08:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 07:08:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 558 ms
[2022-05-17 07:08:22] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 07:08:22] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 9 ms.
[2022-05-17 07:08:22] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-COL-3-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 4280 steps, including 1 resets, run visited all 12 properties in 40 ms. (steps per millisecond=107 )
[2022-05-17 07:08:23] [INFO ] Flatten gal took : 14 ms
[2022-05-17 07:08:23] [INFO ] Flatten gal took : 2 ms
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 07:08:23] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 18 ms.
[2022-05-17 07:08:23] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 24 transitions.
FORMULA Peterson-COL-3-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 200 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 13 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 07:08:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:23] [INFO ] Computed 15 place invariants in 13 ms
[2022-05-17 07:08:23] [INFO ] Implicit Places using invariants in 169 ms returned []
[2022-05-17 07:08:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:23] [INFO ] Computed 15 place invariants in 7 ms
[2022-05-17 07:08:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 07:08:23] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2022-05-17 07:08:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:23] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-17 07:08:23] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 244/244 places, 332/332 transitions.
Support contains 200 out of 244 places after structural reductions.
[2022-05-17 07:08:23] [INFO ] Flatten gal took : 31 ms
[2022-05-17 07:08:23] [INFO ] Flatten gal took : 32 ms
[2022-05-17 07:08:23] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 07:08:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:24] [INFO ] Computed 15 place invariants in 6 ms
[2022-05-17 07:08:24] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-17 07:08:24] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 07:08:24] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 07:08:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-17 07:08:24] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 07:08:24] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 07:08:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 07:08:24] [INFO ] After 71ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 07:08:24] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 5 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:08:25] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:08:26] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:08:26] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:08:26] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:08:26] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:08:26] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1437 ms
[2022-05-17 07:08:26] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:08:26] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:08:26] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:08:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2022-05-17 07:08:26] [INFO ] After 1818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-05-17 07:08:26] [INFO ] After 2112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 60 out of 244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 244 transition count 278
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 190 transition count 278
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 108 place count 190 transition count 231
Deduced a syphon composed of 47 places in 9 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 202 place count 143 transition count 231
Applied a total of 202 rules in 45 ms. Remains 143 /244 variables (removed 101) and now considering 231/332 (removed 101) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/244 places, 231/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1557553 steps, run visited all 2 properties in 2849 ms. (steps per millisecond=546 )
Probabilistic random walk after 1557553 steps, saw 311809 distinct states, run finished after 2849 ms. (steps per millisecond=546 ) properties seen :2
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(((p0 U p1) U !p2)))'
Support contains 72 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 66 rules applied. Total rules applied 102 place count 208 transition count 266
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 132 place count 178 transition count 266
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 132 place count 178 transition count 253
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 158 place count 165 transition count 253
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 176 place count 156 transition count 244
Applied a total of 176 rules in 30 ms. Remains 156 /244 variables (removed 88) and now considering 244/332 (removed 88) transitions.
[2022-05-17 07:08:30] [INFO ] Flow matrix only has 220 transitions (discarded 24 similar events)
// Phase 1: matrix 220 rows 156 cols
[2022-05-17 07:08:30] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 07:08:30] [INFO ] Implicit Places using invariants in 56 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/244 places, 244/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 152/244 places, 244/332 transitions.
Stuttering acceptance computed with spot in 278 ms :[p2, true, (NOT p1), p2]
Running random walk in product with property : Peterson-COL-3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s11 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s11 1) (GEQ s20 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-00 finished in 434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(p0)) U X(p1)) U ((X(G(p2))&&!p3) U p3)))'
Support contains 148 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 07:08:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:30] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-17 07:08:30] [INFO ] Implicit Places using invariants in 94 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 95 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p2), (NOT p3)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=(NOT p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(OR (AND (GEQ s7 1) (GEQ s161 1)) (AND (GEQ s5 1) (GEQ s191 1)) (AND (GEQ s5 1) (GEQ s188 1)) (AND (GEQ s7 1) (GEQ s164 1)) (AND (GEQ s7 1) (GEQ s167 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-01 finished in 451 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 15 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 07:08:30] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:30] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-17 07:08:31] [INFO ] Implicit Places using invariants in 89 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s94 1) (LT s97 1) (LT s100 1) (LT s103 1))], 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 57 steps with 0 reset in 3 ms.
FORMULA Peterson-COL-3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-03 finished in 200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&p1))))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 11 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 07:08:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:31] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-17 07:08:31] [INFO ] Implicit Places using invariants in 89 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 89 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (OR (LT s0 1) (LT s189 1)) (OR (LT s2 1) (LT s162 1)) (OR (LT s4 1) (LT s185 1)) (OR (LT s2 1) (LT s159 1)) (OR (LT s6 1) (LT s158 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1311 reset in 551 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-04 finished in 768 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((F(p2) U G(p3)))||p1)))'
Support contains 60 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 244 transition count 290
Reduce places removed 42 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 78 rules applied. Total rules applied 120 place count 202 transition count 254
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 156 place count 166 transition count 254
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 156 place count 166 transition count 230
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 204 place count 142 transition count 230
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 222 place count 133 transition count 221
Applied a total of 222 rules in 19 ms. Remains 133 /244 variables (removed 111) and now considering 221/332 (removed 111) transitions.
[2022-05-17 07:08:31] [INFO ] Flow matrix only has 197 transitions (discarded 24 similar events)
// Phase 1: matrix 197 rows 133 cols
[2022-05-17 07:08:31] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 07:08:31] [INFO ] Implicit Places using invariants in 53 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/244 places, 221/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 129/244 places, 221/332 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p3)), (NOT p2), (NOT p3)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p3 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s19 1) (GEQ s31 1)) (AND (GEQ s14 1) (GEQ s33 1)) (AND (GEQ s14 1) (GEQ s27 1)) (AND (GEQ s23 1) (GEQ s26 1)) (AND (GEQ s13 1) (GEQ s24 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5240 reset in 356 ms.
Stack based approach found an accepted trace after 57 steps with 1 reset with depth 24 and stack size 24 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-06 finished in 576 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(p1)&&((X(p0) U X(p2))||F(p2)))))'
Support contains 36 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 07:08:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:32] [INFO ] Computed 15 place invariants in 16 ms
[2022-05-17 07:08:32] [INFO ] Implicit Places using invariants in 78 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 79 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : Peterson-COL-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s94 1) (GEQ s97 1) (GEQ s100 1) (GEQ s103 1)), p2:(OR (AND (GEQ s5 1) (GEQ s106 1)) (AND (GEQ s7 1) (GEQ s107 1)) (AND (GEQ s1 1) (GEQ s104 1)...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 47 steps with 1 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-07 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 07:08:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:32] [INFO ] Computed 15 place invariants in 10 ms
[2022-05-17 07:08:32] [INFO ] Implicit Places using invariants in 102 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s61 1) (LT s60 1) (LT s63 1) (LT s62 1) (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-09 finished in 221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(X(X(p1)))||p0)) U p2))'
Support contains 36 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 244 transition count 237
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 149 transition count 237
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 190 place count 149 transition count 192
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 280 place count 104 transition count 192
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 296 place count 96 transition count 184
Applied a total of 296 rules in 16 ms. Remains 96 /244 variables (removed 148) and now considering 184/332 (removed 148) transitions.
[2022-05-17 07:08:33] [INFO ] Flow matrix only has 160 transitions (discarded 24 similar events)
// Phase 1: matrix 160 rows 96 cols
[2022-05-17 07:08:33] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-17 07:08:33] [INFO ] Implicit Places using invariants in 64 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/244 places, 184/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 92/244 places, 184/332 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s5 1) (GEQ s62 1)) (AND (GEQ s7 1) (GEQ s63 1)) (AND (GEQ s1 1) (GEQ s60 1)) (AND (GEQ s3 1) (GEQ s61 1))), p0:(OR (AND (GEQ s19 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12874 reset in 597 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-10 finished in 766 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!G(X(!F(p0)))) U p1))))'
Support contains 32 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 17 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2022-05-17 07:08:33] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2022-05-17 07:08:33] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-17 07:08:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2022-05-17 07:08:33] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2022-05-17 07:08:33] [INFO ] Computed 15 place invariants in 3 ms
[2022-05-17 07:08:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-05-17 07:08:33] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-05-17 07:08:33] [INFO ] Redundant transitions in 4 ms returned []
[2022-05-17 07:08:33] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2022-05-17 07:08:33] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 07:08:34] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 176/332 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/244 places, 176/332 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s23 1) (GEQ s35 1)) (AND (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s18 1) (GEQ s31 1)) (AND (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s17 1) (GEQ s28 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4237 reset in 381 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 39 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-11 finished in 757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((p0 U G(p1))&&p2)||(F(p2)&&F(p3))))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 07:08:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:34] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 07:08:34] [INFO ] Implicit Places using invariants in 69 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 74 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s27 1) (GEQ s39 1)) (AND (GEQ s22 1) (GEQ s41 1)) (AND (GEQ s22 1) (GEQ s35 1)) (AND (GEQ s31 1) (GEQ s34 1)) (AND (GEQ s21 1) (GEQ s32 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 987 reset in 249 ms.
Stack based approach found an accepted trace after 67 steps with 2 reset with depth 51 and stack size 51 in 2 ms.
FORMULA Peterson-COL-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-12 finished in 788 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(X(F(p0))))))'
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 192 place count 148 transition count 196
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 272 place count 108 transition count 196
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 296 place count 96 transition count 184
Applied a total of 296 rules in 14 ms. Remains 96 /244 variables (removed 148) and now considering 184/332 (removed 148) transitions.
[2022-05-17 07:08:35] [INFO ] Flow matrix only has 160 transitions (discarded 24 similar events)
// Phase 1: matrix 160 rows 96 cols
[2022-05-17 07:08:35] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 07:08:35] [INFO ] Implicit Places using invariants in 58 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/244 places, 184/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 92/244 places, 184/332 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s11 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s11 1) (GEQ s20 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11111 reset in 252 ms.
Stack based approach found an accepted trace after 85 steps with 7 reset with depth 21 and stack size 19 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-14 finished in 396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(X(p0)))) U X(!X(p1))))'
Support contains 52 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2022-05-17 07:08:35] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-05-17 07:08:35] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 07:08:35] [INFO ] Implicit Places using invariants in 66 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 67 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 135 ms :[p1, p1, p1, (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s7 1) (GEQ s161 1)) (AND (GEQ s5 1) (GEQ s191 1)) (AND (GEQ s5 1) (GEQ s188 1)) (AND (GEQ s7 1) (GEQ s164 1)) (AND (GEQ s7 1) (GEQ s167 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 33333 reset in 319 ms.
Product exploration explored 100000 steps with 33333 reset in 343 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-3-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-3-LTLFireability-15 finished in 988 ms.
All properties solved by simple procedures.
Total runtime 14603 ms.

BK_STOP 1652771316734

--------------------
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="Peterson-COL-3"
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 Peterson-COL-3, 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 r168-tall-165277016100012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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