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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.3K Apr 30 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 09:24 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 3.7K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 45K 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-5-LTLFireability-00
FORMULA_NAME Peterson-COL-5-LTLFireability-01
FORMULA_NAME Peterson-COL-5-LTLFireability-02
FORMULA_NAME Peterson-COL-5-LTLFireability-03
FORMULA_NAME Peterson-COL-5-LTLFireability-04
FORMULA_NAME Peterson-COL-5-LTLFireability-05
FORMULA_NAME Peterson-COL-5-LTLFireability-06
FORMULA_NAME Peterson-COL-5-LTLFireability-07
FORMULA_NAME Peterson-COL-5-LTLFireability-08
FORMULA_NAME Peterson-COL-5-LTLFireability-09
FORMULA_NAME Peterson-COL-5-LTLFireability-10
FORMULA_NAME Peterson-COL-5-LTLFireability-11
FORMULA_NAME Peterson-COL-5-LTLFireability-12
FORMULA_NAME Peterson-COL-5-LTLFireability-13
FORMULA_NAME Peterson-COL-5-LTLFireability-14
FORMULA_NAME Peterson-COL-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652771834827

Running Version 202205111006
[2022-05-17 07:17:15] [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:17:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:17:16] [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:17:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 07:17:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 580 ms
[2022-05-17 07:17:16] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 20 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:17:16] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2022-05-17 07:17:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 12 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 71 steps, including 0 resets, run visited all 7 properties in 12 ms. (steps per millisecond=5 )
[2022-05-17 07:17:16] [INFO ] Flatten gal took : 19 ms
[2022-05-17 07:17:16] [INFO ] Flatten gal took : 2 ms
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] 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:17:16] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 33 ms.
[2022-05-17 07:17:16] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 13 ms
Reduce places removed 30 places and 60 transitions.
Support contains 774 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 21 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:17] [INFO ] Computed 23 place invariants in 31 ms
[2022-05-17 07:17:17] [INFO ] Implicit Places using invariants in 304 ms returned []
[2022-05-17 07:17:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:17] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 07:17:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:17:18] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
[2022-05-17 07:17:18] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:18] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 07:17:18] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Support contains 774 out of 834 places after structural reductions.
[2022-05-17 07:17:18] [INFO ] Flatten gal took : 114 ms
[2022-05-17 07:17:18] [INFO ] Flatten gal took : 108 ms
[2022-05-17 07:17:19] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 07:17:19] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:19] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 07:17:19] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 07:17:19] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2022-05-17 07:17:19] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 07:17:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2022-05-17 07:17:19] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2022-05-17 07:17:20] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 07:17:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:17:20] [INFO ] After 133ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 07:17:20] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 4 ms to minimize.
[2022-05-17 07:17:21] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 1 ms to minimize.
[2022-05-17 07:17:21] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 2 ms to minimize.
[2022-05-17 07:17:21] [INFO ] Deduced a trap composed of 111 places in 240 ms of which 1 ms to minimize.
[2022-05-17 07:17:21] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 0 ms to minimize.
[2022-05-17 07:17:22] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 1 ms to minimize.
[2022-05-17 07:17:22] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2022-05-17 07:17:22] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 4 ms to minimize.
[2022-05-17 07:17:23] [INFO ] Deduced a trap composed of 120 places in 215 ms of which 0 ms to minimize.
[2022-05-17 07:17:23] [INFO ] Deduced a trap composed of 153 places in 216 ms of which 1 ms to minimize.
[2022-05-17 07:17:23] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 1 ms to minimize.
[2022-05-17 07:17:23] [INFO ] Deduced a trap composed of 63 places in 217 ms of which 0 ms to minimize.
[2022-05-17 07:17:24] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 1 ms to minimize.
[2022-05-17 07:17:24] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 1 ms to minimize.
[2022-05-17 07:17:24] [INFO ] Deduced a trap composed of 63 places in 215 ms of which 0 ms to minimize.
[2022-05-17 07:17:25] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 0 ms to minimize.
[2022-05-17 07:17:25] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 1 ms to minimize.
[2022-05-17 07:17:25] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 1 ms to minimize.
[2022-05-17 07:17:25] [INFO ] Deduced a trap composed of 115 places in 225 ms of which 1 ms to minimize.
[2022-05-17 07:17:26] [INFO ] Deduced a trap composed of 101 places in 224 ms of which 1 ms to minimize.
[2022-05-17 07:17:26] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 0 ms to minimize.
[2022-05-17 07:17:26] [INFO ] Deduced a trap composed of 115 places in 209 ms of which 0 ms to minimize.
[2022-05-17 07:17:27] [INFO ] Deduced a trap composed of 105 places in 214 ms of which 1 ms to minimize.
[2022-05-17 07:17:27] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 0 ms to minimize.
[2022-05-17 07:17:27] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 1 ms to minimize.
[2022-05-17 07:17:27] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 1 ms to minimize.
[2022-05-17 07:17:27] [INFO ] Deduced a trap composed of 99 places in 149 ms of which 0 ms to minimize.
[2022-05-17 07:17:27] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7569 ms
[2022-05-17 07:17:27] [INFO ] After 7758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2022-05-17 07:17:28] [INFO ] After 8399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 30 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 834 transition count 892
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 484 transition count 892
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 185 Pre rules applied. Total rules applied 700 place count 484 transition count 707
Deduced a syphon composed of 185 places in 1 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 1070 place count 299 transition count 707
Applied a total of 1070 rules in 86 ms. Remains 299 /834 variables (removed 535) and now considering 707/1242 (removed 535) transitions.
Finished structural reductions, in 1 iterations. Remains : 299/834 places, 707/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 61 steps, run visited all 1 properties in 7 ms. (steps per millisecond=8 )
Probabilistic random walk after 61 steps, saw 55 distinct states, run finished after 8 ms. (steps per millisecond=7 ) properties seen :1
FORMULA Peterson-COL-5-LTLFireability-12 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' '!(X(F(p0)))'
Support contains 150 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 34 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:28] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:28] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 07:17:28] [INFO ] Implicit Places using invariants in 251 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 254 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 13 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s741 1) (LT s810 1) (LT s676 1) (LT s680 1) (LT s745 1) (LT s806 1) (LT s802 1) (LT s668 1) (LT s733 1) (LT s798 1) (LT s672 1) (LT s692 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1035 ms.
Product exploration explored 100000 steps with 50000 reset in 937 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-5-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-00 finished in 2568 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(G(!p1)))))'
Support contains 36 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:31] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:31] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 07:17:31] [INFO ] Implicit Places using invariants in 214 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 215 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 30 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 123 ms :[p1, p1, true]
Running random walk in product with property : Peterson-COL-5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s286 1) (GEQ s301 1) (GEQ s311 1) (GEQ s296 1) (GEQ s291 1) (GEQ s306 1)), p0:(OR (GEQ s743 1) (GEQ s809 1) (GEQ s677 1) (GEQ s683 1) (GEQ s67...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 174 steps with 0 reset in 9 ms.
FORMULA Peterson-COL-5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-01 finished in 417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 60 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 53 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2022-05-17 07:17:31] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2022-05-17 07:17:31] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:17:31] [INFO ] Implicit Places using invariants in 204 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 209 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s44 1) (GEQ s57 1)) (AND (GEQ s34 1) (GEQ s55 1)) (AND (GEQ s35 1) (GEQ s65 1)) (AND (GEQ s39 1) (GEQ s76 1)) (AND (GEQ s25 1) (GEQ s59 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12410 reset in 935 ms.
Stack based approach found an accepted trace after 67 steps with 8 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-02 finished in 1256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1))||X(X((G(F(p1))&&p2)))))'
Support contains 336 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:32] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:32] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 07:17:33] [INFO ] Implicit Places using invariants in 234 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 236 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 472 ms :[(NOT p1), (AND p1 (NOT p0) (NOT p2)), (NOT p1), (OR (AND (NOT p1) (NOT p0) p2) (AND p1 (NOT p0) (NOT p2))), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 9}, { cond=(NOT p2), acceptance={} source=4 dest: 10}, { cond=p2, acceptance={} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 5}, { cond=(NOT p1), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 5}, { cond=(NOT p1), acceptance={} source=10 dest: 8}, { cond=true, acceptance={} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 9}, { cond=true, acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(OR (GEQ s255 1) (GEQ s125 1) (GEQ s186 1) (GEQ s129 1) (GEQ s251 1) (GEQ s190 1) (GEQ s133 1) (GEQ s263 1) (GEQ s194 1) (GEQ s137 1) (GEQ s259 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2330 reset in 312 ms.
Stack based approach found an accepted trace after 180 steps with 5 reset with depth 169 and stack size 169 in 11 ms.
FORMULA Peterson-COL-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-03 finished in 1077 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!F(p0))) U G(p1)))'
Support contains 66 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 15 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:33] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:33] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 07:17:34] [INFO ] Implicit Places using invariants in 183 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 184 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (AND (GEQ s59 1) (GEQ s99 1)) (AND (GEQ s42 1) (GEQ s72 1)) (AND (GEQ s63 1) (GEQ s90 1)) (AND (GEQ s48 1) (GEQ s73 1)) (AND (GEQ s62 1) (GEQ ...], 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]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-5-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-04 finished in 378 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!(X(G(p0)) U G(F(G(!p0)))))))'
Support contains 24 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 712 place count 478 transition count 726
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1032 place count 318 transition count 726
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1044 place count 312 transition count 720
Applied a total of 1044 rules in 38 ms. Remains 312 /834 variables (removed 522) and now considering 720/1242 (removed 522) transitions.
[2022-05-17 07:17:34] [INFO ] Flow matrix only has 600 transitions (discarded 120 similar events)
// Phase 1: matrix 600 rows 312 cols
[2022-05-17 07:17:34] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:17:34] [INFO ] Implicit Places using invariants in 162 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 165 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 306/834 places, 720/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 306 /306 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 306/834 places, 720/1242 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-05 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 (GEQ s137 1) (GEQ s138 1) (GEQ s139 1) (GEQ s132 1) (GEQ s133 1) (GEQ s134 1) (GEQ s135 1) (GEQ s144 1) (GEQ s145 1) (GEQ s147 1) (GEQ s140 1) (GEQ...], 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 8487 reset in 301 ms.
Stack based approach found an accepted trace after 176 steps with 15 reset with depth 7 and stack size 7 in 4 ms.
FORMULA Peterson-COL-5-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-05 finished in 629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&X(F(p1))))'
Support contains 162 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 17 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:34] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:34] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 07:17:35] [INFO ] Implicit Places using invariants in 171 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 173 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s553 1)) (AND (GEQ s3 1) (GEQ s518 1)) (AND (GEQ s7 1) (GEQ s565 1)) (AND (GEQ s5 1) (GEQ s600 1)) (AND (GEQ s3 1) (GEQ s624 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-06 finished in 396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((X((X(p1)&&F(p1))) U G(!F(p1))))||p0)))'
Support contains 60 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 834 transition count 882
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 474 transition count 882
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 720 place count 474 transition count 702
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1080 place count 294 transition count 702
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1140 place count 264 transition count 672
Applied a total of 1140 rules in 41 ms. Remains 264 /834 variables (removed 570) and now considering 672/1242 (removed 570) transitions.
[2022-05-17 07:17:35] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 264 cols
[2022-05-17 07:17:35] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 07:17:35] [INFO ] Implicit Places using invariants in 128 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 130 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/834 places, 672/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 672/672 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 258/834 places, 672/1242 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s35 1) (GEQ s75 1)) (AND (GEQ s18 1) (GEQ s48 1)) (AND (GEQ s39 1) (GEQ s66 1)) (AND (GEQ s24 1) (GEQ s49 1)) (AND (GEQ s38 1) (GEQ s61 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20905 reset in 526 ms.
Product exploration explored 100000 steps with 20967 reset in 550 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 (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 07:17:36] [INFO ] Flow matrix only has 552 transitions (discarded 120 similar events)
// Phase 1: matrix 552 rows 258 cols
[2022-05-17 07:17:36] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 07:17:37] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-5-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-07 finished in 1933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 156 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 19 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:37] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:37] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 07:17:37] [INFO ] Implicit Places using invariants in 162 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 166 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 11 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-08 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:(OR (AND (GEQ s10 1) (GEQ s597 1)) (AND (GEQ s4 1) (GEQ s585 1)) (AND (GEQ s8 1) (GEQ s632 1)) (AND (GEQ s6 1) (GEQ s550 1)) (AND (GEQ s0 1) (GEQ s548 ...], 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 0 ms.
FORMULA Peterson-COL-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-08 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 150 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:37] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:37] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 07:17:37] [INFO ] Implicit Places using invariants in 218 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 219 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s741 1) (GEQ s810 1) (GEQ s676 1) (GEQ s680 1) (GEQ s745 1) (GEQ s806 1) (GEQ s802 1) (GEQ s668 1) (GEQ s733 1) (GEQ s798 1) (GEQ s672 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2330 reset in 536 ms.
Stack based approach found an accepted trace after 141 steps with 1 reset with depth 54 and stack size 54 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-09 finished in 862 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((X(F(p0))||p1))))))'
Support contains 162 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 834 transition count 1082
Reduce places removed 160 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 310 rules applied. Total rules applied 470 place count 674 transition count 932
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 620 place count 524 transition count 932
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 620 place count 524 transition count 872
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 740 place count 464 transition count 872
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 790 place count 439 transition count 847
Applied a total of 790 rules in 44 ms. Remains 439 /834 variables (removed 395) and now considering 847/1242 (removed 395) transitions.
[2022-05-17 07:17:38] [INFO ] Flow matrix only has 727 transitions (discarded 120 similar events)
// Phase 1: matrix 727 rows 439 cols
[2022-05-17 07:17:38] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:17:38] [INFO ] Implicit Places using invariants in 161 ms returned []
[2022-05-17 07:17:38] [INFO ] Flow matrix only has 727 transitions (discarded 120 similar events)
// Phase 1: matrix 727 rows 439 cols
[2022-05-17 07:17:38] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:17:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:17:39] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
[2022-05-17 07:17:39] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-17 07:17:39] [INFO ] Flow matrix only has 727 transitions (discarded 120 similar events)
// Phase 1: matrix 727 rows 439 cols
[2022-05-17 07:17:39] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 07:17:39] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 439/834 places, 847/1242 transitions.
Finished structural reductions, in 1 iterations. Remains : 439/834 places, 847/1242 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s367 1) (LT s424 1) (LT s313 1) (LT s316 1) (LT s370 1) (LT s421 1) (LT s418 1) (LT s306 1) (LT s360 1) (LT s414 1) (LT s309 1) (LT s326 1) (L...], 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 511 reset in 498 ms.
Stack based approach found an accepted trace after 84 steps with 0 reset with depth 85 and stack size 80 in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-5-LTLFireability-10 finished in 2115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(G((X(p1)||p0))) U !p2)))'
Support contains 174 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:40] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:40] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 07:17:40] [INFO ] Implicit Places using invariants in 229 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 230 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 25 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 221 ms :[p1, (NOT p2), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p2)), true, (OR p1 p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 0}, { cond=p0, acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(OR (GEQ s287 1) (GEQ s288 1) (GEQ s289 1) (GEQ s282 1) (GEQ s283 1) (GEQ s284 1) (GEQ s285 1) (GEQ s294 1) (GEQ s295 1) (GEQ s297 1) (GEQ s290 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-5-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-11 finished in 509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||p0))))'
Support contains 180 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 12 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-05-17 07:17:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 07:17:41] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 07:17:41] [INFO ] Implicit Places using invariants in 233 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 234 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 828/834 places, 1242/1242 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s255 1) (LT s125 1) (LT s186 1) (LT s129 1) (LT s251 1) (LT s190 1) (LT s133 1) (LT s263 1) (LT s194 1) (LT s137 1) (LT s259 1) (LT s198 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 898 ms.
Product exploration explored 100000 steps with 50000 reset in 902 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Peterson-COL-5-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-5-LTLFireability-13 finished in 2191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(!((F(p0)&&p1) U (F(p0)&&p2))))))'
Support contains 30 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 834 transition count 883
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 175 Pre rules applied. Total rules applied 718 place count 475 transition count 708
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 1068 place count 300 transition count 708
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 1116 place count 276 transition count 684
Applied a total of 1116 rules in 26 ms. Remains 276 /834 variables (removed 558) and now considering 684/1242 (removed 558) transitions.
[2022-05-17 07:17:43] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:17:43] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 07:17:43] [INFO ] Implicit Places using invariants in 130 ms returned []
[2022-05-17 07:17:43] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:17:43] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 07:17:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:17:43] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2022-05-17 07:17:43] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-17 07:17:43] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:17:43] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 07:17:44] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 276/834 places, 684/1242 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/834 places, 684/1242 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND p0 p2), (AND p0 p2)]
Running random walk in product with property : Peterson-COL-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND p1 p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s9 1) (GEQ s145 1)) (AND (GEQ s7 1) (GEQ s144 1)) (AND (GEQ s15 1) (GEQ s148 1)) (AND (GEQ s17 1) (GEQ s149 1)) (AND (GEQ s11 1) (GEQ s14...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6324 reset in 381 ms.
Product exploration explored 100000 steps with 6333 reset in 359 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) p2), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 389 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 85 ms :[(AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-17 07:17:45] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:17:45] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 07:17:45] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 07:17:45] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2022-05-17 07:17:45] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 07:17:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-17 07:17:45] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 07:17:46] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-17 07:17:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:17:46] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 0 ms to minimize.
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 3 ms to minimize.
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:17:46] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:17:47] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:17:48] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:17:49] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 3 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:17:50] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2022-05-17 07:17:51] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:17:52] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:17:52] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:17:52] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2022-05-17 07:17:52] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:17:52] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:17:52] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2022-05-17 07:17:52] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2022-05-17 07:17:53] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:17:53] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2022-05-17 07:17:53] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:17:53] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:17:53] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:17:53] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:17:53] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 0 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:17:54] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:17:55] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:17:55] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:17:55] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:17:55] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:17:55] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:17:55] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2022-05-17 07:17:55] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:17:56] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:17:56] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:17:56] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:17:56] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:17:56] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:17:56] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2022-05-17 07:17:56] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:17:57] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:17:57] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:17:57] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:17:57] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2022-05-17 07:17:57] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-17 07:17:57] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2022-05-17 07:17:57] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 13 ms to minimize.
[2022-05-17 07:17:58] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:17:59] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:18:00] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:18:01] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:18:01] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:18:01] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:18:01] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:18:01] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:18:02] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:18:02] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:18:03] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:18:03] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:18:03] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:18:03] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:18:03] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:18:04] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:18:05] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:18:05] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:18:05] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:18:05] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:18:05] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:18:05] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:18:06] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:18:06] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:18:06] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:18:06] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:18:08] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:18:10] [INFO ] Trap strengthening (SAT) tested/added 161/161 trap constraints in 24720 ms
[2022-05-17 07:18:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 07:18:10] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4 ms.
Support contains 30 out of 276 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 276/276 places, 684/684 transitions.
Applied a total of 0 rules in 10 ms. Remains 276 /276 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 684/684 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
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 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1000951 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{1=1}
Probabilistic random walk after 1000951 steps, saw 145053 distinct states, run finished after 3002 ms. (steps per millisecond=333 ) properties seen :1
Running SMT prover for 1 properties.
[2022-05-17 07:18:13] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:18:13] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 07:18:14] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:18:14] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 07:18:14] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 07:18:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:18:14] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 07:18:14] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 07:18:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:18:14] [INFO ] After 42ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 07:18:14] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2022-05-17 07:18:14] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:18:14] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:18:14] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:18:14] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2022-05-17 07:18:14] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:18:15] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:18:16] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:18:17] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2022-05-17 07:18:18] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-17 07:18:19] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 0 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 43 places in 89 ms of which 1 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:18:20] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 3 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:18:21] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:18:22] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:18:23] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:18:24] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:18:25] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:18:26] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:18:26] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:18:26] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:18:27] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:18:28] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:18:28] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:18:28] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:18:28] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:18:29] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:18:29] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:18:30] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:18:31] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:18:31] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 5 ms to minimize.
[2022-05-17 07:18:31] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:18:31] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:18:34] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:18:34] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:18:36] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:18:36] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:18:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 144 trap constraints in 24629 ms
[2022-05-17 07:18:39] [INFO ] After 24708ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-17 07:18:39] [INFO ] After 24890ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (AND p0 p1) p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 10 factoid took 437 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 60 ms :[(AND p0 p2), (AND p0 p2)]
Support contains 30 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 684/684 transitions.
Applied a total of 0 rules in 8 ms. Remains 276 /276 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2022-05-17 07:18:39] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:18:39] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:18:39] [INFO ] Implicit Places using invariants in 134 ms returned []
[2022-05-17 07:18:39] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:18:39] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 07:18:39] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:18:40] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2022-05-17 07:18:40] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 07:18:40] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:18:40] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:18:40] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 684/684 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p0 p2))), (X (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p2), (AND p0 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 07:18:40] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:18:40] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:18:40] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:18:40] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 07:18:41] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 07:18:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 07:18:41] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 07:18:41] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 07:18:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:18:41] [INFO ] After 44ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 07:18:41] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2022-05-17 07:18:41] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-05-17 07:18:41] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-17 07:18:41] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:18:41] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2022-05-17 07:18:41] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-17 07:18:41] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 0 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 0 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2022-05-17 07:18:42] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1293 ms
[2022-05-17 07:18:42] [INFO ] After 1356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 07:18:42] [INFO ] After 1549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 276 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 276/276 places, 684/684 transitions.
Applied a total of 0 rules in 7 ms. Remains 276 /276 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 684/684 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 257 steps, run visited all 1 properties in 4 ms. (steps per millisecond=64 )
Probabilistic random walk after 257 steps, saw 223 distinct states, run finished after 4 ms. (steps per millisecond=64 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND p0 p2))), (X (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 p2)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p2) p1))))]
Knowledge based reduction with 5 factoid took 308 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 65 ms :[(AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 6310 reset in 301 ms.
Product exploration explored 100000 steps with 6313 reset in 311 ms.
Built C files in :
/tmp/ltsmin14843808462260031698
[2022-05-17 07:18:43] [INFO ] Computing symmetric may disable matrix : 684 transitions.
[2022-05-17 07:18:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:43] [INFO ] Computing symmetric may enable matrix : 684 transitions.
[2022-05-17 07:18:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:43] [INFO ] Computing Do-Not-Accords matrix : 684 transitions.
[2022-05-17 07:18:43] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:44] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14843808462260031698
Running compilation step : cd /tmp/ltsmin14843808462260031698;'/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 1576 ms.
Running link step : cd /tmp/ltsmin14843808462260031698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin14843808462260031698;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15080136534710473394.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 30 out of 276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 276/276 places, 684/684 transitions.
Applied a total of 0 rules in 13 ms. Remains 276 /276 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2022-05-17 07:18:58] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:18:58] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 07:18:59] [INFO ] Implicit Places using invariants in 134 ms returned []
[2022-05-17 07:18:59] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:18:59] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 07:18:59] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:18:59] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2022-05-17 07:18:59] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 07:18:59] [INFO ] Flow matrix only has 564 transitions (discarded 120 similar events)
// Phase 1: matrix 564 rows 276 cols
[2022-05-17 07:18:59] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 07:18:59] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 684/684 transitions.
Built C files in :
/tmp/ltsmin16744994447570922935
[2022-05-17 07:18:59] [INFO ] Computing symmetric may disable matrix : 684 transitions.
[2022-05-17 07:18:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:18:59] [INFO ] Computing symmetric may enable matrix : 684 transitions.
[2022-05-17 07:18:59] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:19:00] [INFO ] Computing Do-Not-Accords matrix : 684 transitions.
[2022-05-17 07:19:00] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:19:00] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16744994447570922935
Running compilation step : cd /tmp/ltsmin16744994447570922935;'/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 1485 ms.
Running link step : cd /tmp/ltsmin16744994447570922935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16744994447570922935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10916350058224188880.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 07:19:15] [INFO ] Flatten gal took : 36 ms
[2022-05-17 07:19:15] [INFO ] Flatten gal took : 36 ms
[2022-05-17 07:19:15] [INFO ] Time to serialize gal into /tmp/LTL14013134225219742644.gal : 5 ms
[2022-05-17 07:19:15] [INFO ] Time to serialize properties into /tmp/LTL9350731038540539742.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14013134225219742644.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9350731038540539742.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1401313...267
Read 1 LTL properties
Checking formula 0 : !((G(X(F(!(((F("((((EndTurn_4>=1)||(EndTurn_19>=1))||((EndTurn_29>=1)||(EndTurn_14>=1)))||((EndTurn_9>=1)||(EndTurn_24>=1)))"))&&("(((...711
Formula 0 simplified : !GXF!(("(((((WantSection_3>=1)&&(CS_1>=1))||((WantSection_1>=1)&&(CS_0>=1)))||(((WantSection_9>=1)&&(CS_4>=1))||((WantSection_11>=1)...695
Detected timeout of ITS tools.
[2022-05-17 07:19:30] [INFO ] Flatten gal took : 31 ms
[2022-05-17 07:19:30] [INFO ] Applying decomposition
[2022-05-17 07:19:30] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12135570213852314174.txt' '-o' '/tmp/graph12135570213852314174.bin' '-w' '/tmp/graph12135570213852314174.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12135570213852314174.bin' '-l' '-1' '-v' '-w' '/tmp/graph12135570213852314174.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:19:30] [INFO ] Decomposing Gal with order
[2022-05-17 07:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:19:30] [INFO ] Removed a total of 912 redundant transitions.
[2022-05-17 07:19:30] [INFO ] Flatten gal took : 84 ms
[2022-05-17 07:19:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 256 labels/synchronizations in 18 ms.
[2022-05-17 07:19:30] [INFO ] Time to serialize gal into /tmp/LTL1969723912503794639.gal : 8 ms
[2022-05-17 07:19:30] [INFO ] Time to serialize properties into /tmp/LTL2205083358245159307.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1969723912503794639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2205083358245159307.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1969723...245
Read 1 LTL properties
Checking formula 0 : !((G(X(F(!(((F("((((i8.u24.EndTurn_4>=1)||(i10.u29.EndTurn_19>=1))||((i6.u20.EndTurn_29>=1)||(i2.u14.EndTurn_14>=1)))||((i0.u9.EndTurn...954
Formula 0 simplified : !GXF!(("(((((i8.u0.WantSection_3>=1)&&(i0.u9.CS_1>=1))||((i0.u2.WantSection_1>=1)&&(i8.u24.CS_0>=1)))||(((i2.u1.WantSection_9>=1)&&(...938
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16008003288898034232
[2022-05-17 07:19:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16008003288898034232
Running compilation step : cd /tmp/ltsmin16008003288898034232;'/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 979 ms.
Running link step : cd /tmp/ltsmin16008003288898034232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16008003288898034232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>(!((<>((LTLAPp0==true))&&(LTLAPp1==true)) U (<>((LTLAPp0==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Peterson-COL-5-LTLFireability-14 finished in 137499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(p1 U p2)))'
Support contains 48 out of 834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 834 transition count 886
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 478 transition count 886
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 712 place count 478 transition count 732
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 1020 place count 324 transition count 732
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1032 place count 318 transition count 726
Applied a total of 1032 rules in 23 ms. Remains 318 /834 variables (removed 516) and now considering 726/1242 (removed 516) transitions.
[2022-05-17 07:20:00] [INFO ] Flow matrix only has 606 transitions (discarded 120 similar events)
// Phase 1: matrix 606 rows 318 cols
[2022-05-17 07:20:00] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:20:00] [INFO ] Implicit Places using invariants in 149 ms returned []
[2022-05-17 07:20:00] [INFO ] Flow matrix only has 606 transitions (discarded 120 similar events)
// Phase 1: matrix 606 rows 318 cols
[2022-05-17 07:20:00] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:20:01] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 07:20:01] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2022-05-17 07:20:01] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-17 07:20:01] [INFO ] Flow matrix only has 606 transitions (discarded 120 similar events)
// Phase 1: matrix 606 rows 318 cols
[2022-05-17 07:20:01] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 07:20:01] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/834 places, 726/1242 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/834 places, 726/1242 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p2), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : Peterson-COL-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(OR (GEQ s143 1) (GEQ s144 1) (GEQ s145 1) (GEQ s138 1) (GEQ s139 1) (GEQ s140 1) (GEQ s141 1) (GEQ s150 1) (GEQ s151 1) (GEQ s153 1) (GEQ s146 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 504 steps with 4 reset in 2 ms.
FORMULA Peterson-COL-5-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-5-LTLFireability-15 finished in 1167 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(!((F(p0)&&p1) U (F(p0)&&p2))))))'
[2022-05-17 07:20:02] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15515274847755560577
[2022-05-17 07:20:02] [INFO ] Computing symmetric may disable matrix : 1242 transitions.
[2022-05-17 07:20:02] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:20:02] [INFO ] Computing symmetric may enable matrix : 1242 transitions.
[2022-05-17 07:20:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:20:02] [INFO ] Applying decomposition
[2022-05-17 07:20:02] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2284315527869841585.txt' '-o' '/tmp/graph2284315527869841585.bin' '-w' '/tmp/graph2284315527869841585.weights'
[2022-05-17 07:20:02] [INFO ] Computing Do-Not-Accords matrix : 1242 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2284315527869841585.bin' '-l' '-1' '-v' '-w' '/tmp/graph2284315527869841585.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:20:02] [INFO ] Decomposing Gal with order
[2022-05-17 07:20:02] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 07:20:02] [INFO ] Built C files in 183ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15515274847755560577
Running compilation step : cd /tmp/ltsmin15515274847755560577;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-17 07:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:20:02] [INFO ] Removed a total of 1033 redundant transitions.
[2022-05-17 07:20:02] [INFO ] Flatten gal took : 78 ms
[2022-05-17 07:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-17 07:20:02] [INFO ] Time to serialize gal into /tmp/LTLFireability15490306621829180776.gal : 8 ms
[2022-05-17 07:20:02] [INFO ] Time to serialize properties into /tmp/LTLFireability16128168289368834012.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15490306621829180776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16128168289368834012.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((G(X(F(!(((F("((((i0.u94.EndTurn_4>=1)||(i0.u102.EndTurn_19>=1))||((i0.u19.EndTurn_29>=1)||(i0.u13.EndTurn_14>=1)))||((i0.u9.EndTurn...970
Formula 0 simplified : !GXF!(("(((((i17.u1.WantSection_3>=1)&&(i0.u9.CS_1>=1))||((i17.u0.WantSection_1>=1)&&(i0.u94.CS_0>=1)))||(((i17.u3.WantSection_9>=1)...954
Compilation finished in 3962 ms.
Running link step : cd /tmp/ltsmin15515274847755560577;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin15515274847755560577;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(<>(!((<>((LTLAPp0==true))&&(LTLAPp1==true)) U (<>((LTLAPp0==true))&&(LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 07:40:58] [INFO ] Applying decomposition
[2022-05-17 07:40:58] [INFO ] Flatten gal took : 116 ms
[2022-05-17 07:40:58] [INFO ] Decomposing Gal with order
[2022-05-17 07:40:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:40:59] [INFO ] Removed a total of 1098 redundant transitions.
[2022-05-17 07:40:59] [INFO ] Flatten gal took : 213 ms
[2022-05-17 07:40:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2022-05-17 07:40:59] [INFO ] Time to serialize gal into /tmp/LTLFireability18097543457759680445.gal : 22 ms
[2022-05-17 07:40:59] [INFO ] Time to serialize properties into /tmp/LTLFireability1771832401131743158.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18097543457759680445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1771832401131743158.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G(X(F(!(((F("((((ProcessTour4.EndTurn_4>=1)||(ProcessTour19.EndTurn_19>=1))||((ProcessTour29.EndTurn_29>=1)||(ProcessTour14.EndTurn...1141
Formula 0 simplified : !GXF!(("(((((ProcessBool3.WantSection_3>=1)&&(Process1.CS_1>=1))||((ProcessBool1.WantSection_1>=1)&&(Process0.CS_0>=1)))||(((Process...1125
Detected timeout of ITS tools.
[2022-05-17 08:02:00] [INFO ] Flatten gal took : 1157 ms
[2022-05-17 08:02:03] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-05-17 08:02:03] [INFO ] Transformed 834 places.
[2022-05-17 08:02:03] [INFO ] Transformed 1242 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 08:02:03] [INFO ] Time to serialize gal into /tmp/LTLFireability12598908893173451804.gal : 18 ms
[2022-05-17 08:02:03] [INFO ] Time to serialize properties into /tmp/LTLFireability7526779981396654705.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12598908893173451804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7526779981396654705.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(F(!(((F("((((EndTurn_4>=1)||(EndTurn_19>=1))||((EndTurn_29>=1)||(EndTurn_14>=1)))||((EndTurn_9>=1)||(EndTurn_24>=1)))"))&&("(((...711
Formula 0 simplified : !GXF!(("(((((WantSection_3>=1)&&(CS_1>=1))||((WantSection_1>=1)&&(CS_0>=1)))||(((WantSection_9>=1)&&(CS_4>=1))||((WantSection_11>=1)...695

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-5"
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-5, 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-165277016100028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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