Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422000133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Peterson-COL-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.3K Apr 12 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-3-LTLFireability-00
FORMULA_NAME Peterson-COL-3-LTLFireability-01
FORMULA_NAME Peterson-COL-3-LTLFireability-02
FORMULA_NAME Peterson-COL-3-LTLFireability-03
FORMULA_NAME Peterson-COL-3-LTLFireability-04
FORMULA_NAME Peterson-COL-3-LTLFireability-05
FORMULA_NAME Peterson-COL-3-LTLFireability-06
FORMULA_NAME Peterson-COL-3-LTLFireability-07
FORMULA_NAME Peterson-COL-3-LTLFireability-08
FORMULA_NAME Peterson-COL-3-LTLFireability-09
FORMULA_NAME Peterson-COL-3-LTLFireability-10
FORMULA_NAME Peterson-COL-3-LTLFireability-11
FORMULA_NAME Peterson-COL-3-LTLFireability-12
FORMULA_NAME Peterson-COL-3-LTLFireability-13
FORMULA_NAME Peterson-COL-3-LTLFireability-14
FORMULA_NAME Peterson-COL-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716879429393

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-28 06:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:57:12] [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.
[2024-05-28 06:57:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:57:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 720 ms
[2024-05-28 06:57:12] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 113 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 06:57:13] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-28 06:57:13] [INFO ] Skeletonized 15 HLPN properties in 1 ms. Removed 1 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 13 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 4735 steps, including 1 resets, run visited all 15 properties in 64 ms. (steps per millisecond=73 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-28 06:57:13] [INFO ] Flatten gal took : 23 ms
[2024-05-28 06:57:13] [INFO ] Flatten gal took : 3 ms
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 06:57:13] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 31 ms.
[2024-05-28 06:57:13] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 24 transitions.
Support contains 244 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 14 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:57:13] [INFO ] Computed 15 invariants in 13 ms
[2024-05-28 06:57:13] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-28 06:57:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:13] [INFO ] Invariant cache hit.
[2024-05-28 06:57:14] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:14] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-28 06:57:14] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:14] [INFO ] Invariant cache hit.
[2024-05-28 06:57:14] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 930 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 244 out of 244 places after structural reductions.
[2024-05-28 06:57:14] [INFO ] Flatten gal took : 46 ms
[2024-05-28 06:57:14] [INFO ] Flatten gal took : 47 ms
[2024-05-28 06:57:14] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 06:57:15] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:15] [INFO ] Invariant cache hit.
[2024-05-28 06:57:15] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-28 06:57:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-28 06:57:15] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 06:57:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-28 06:57:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-28 06:57:15] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 06:57:16] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:16] [INFO ] After 53ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 10 ms to minimize.
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 3 ms to minimize.
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 0 ms to minimize.
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 1 ms to minimize.
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-28 06:57:16] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-05-28 06:57:17] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 1 ms to minimize.
[2024-05-28 06:57:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1106 ms
[2024-05-28 06:57:17] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2024-05-28 06:57:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-05-28 06:57:17] [INFO ] After 1358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-28 06:57:17] [INFO ] After 1721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 244 transition count 242
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 154 transition count 242
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 180 place count 154 transition count 195
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 274 place count 107 transition count 195
Applied a total of 274 rules in 33 ms. Remains 107 /244 variables (removed 137) and now considering 195/332 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 107/244 places, 195/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Finished probabilistic random walk after 108 steps, run visited all 2 properties in 12 ms. (steps per millisecond=9 )
Probabilistic random walk after 108 steps, saw 89 distinct states, run finished after 12 ms. (steps per millisecond=9 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 244 transition count 238
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 188 place count 150 transition count 196
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 272 place count 108 transition count 196
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 280 place count 104 transition count 192
Applied a total of 280 rules in 56 ms. Remains 104 /244 variables (removed 140) and now considering 192/332 (removed 140) transitions.
[2024-05-28 06:57:18] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
// Phase 1: matrix 168 rows 104 cols
[2024-05-28 06:57:18] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 06:57:18] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-28 06:57:18] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-28 06:57:18] [INFO ] Invariant cache hit.
[2024-05-28 06:57:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:18] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-28 06:57:18] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-28 06:57:18] [INFO ] Flow matrix only has 168 transitions (discarded 24 similar events)
[2024-05-28 06:57:18] [INFO ] Invariant cache hit.
[2024-05-28 06:57:18] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/244 places, 192/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 612 ms. Remains : 104/244 places, 192/332 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-00 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:(OR (GEQ s61 1) (GEQ s60 1) (GEQ s63 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s70 1) (GEQ s69 1)), p0:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s3 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 9618 reset in 503 ms.
Stack based approach found an accepted trace after 29 steps with 4 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-00 finished in 1471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(G(p1))))))'
Support contains 76 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 14 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:19] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:57:19] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 06:57:19] [INFO ] Implicit Places using invariants in 121 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 124 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 13 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-COL-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GEQ s126 1) (GEQ s127 1) (GEQ s124 1) (GEQ s130 1) (GEQ s131 1) (GEQ s128 1) (GEQ s135 1) (GEQ s132 1) (GEQ s133 1) (GEQ s139 1) (GEQ s136 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 6 reset in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-01 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&(G(p1)||G(p0)))))'
Support contains 56 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:20] [INFO ] Invariant cache hit.
[2024-05-28 06:57:20] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-28 06:57:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:20] [INFO ] Invariant cache hit.
[2024-05-28 06:57:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:20] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-05-28 06:57:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:20] [INFO ] Invariant cache hit.
[2024-05-28 06:57:20] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 957 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s77 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-02 finished in 1182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U ((X(!p2)||p1) U p3))))'
Support contains 72 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:21] [INFO ] Invariant cache hit.
[2024-05-28 06:57:21] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 06:57:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:21] [INFO ] Invariant cache hit.
[2024-05-28 06:57:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:21] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2024-05-28 06:57:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:21] [INFO ] Invariant cache hit.
[2024-05-28 06:57:21] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p3) p2), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p3:(OR (GEQ s198 1) (GEQ s197 1) (GEQ s196 1) (GEQ s202 1) (GEQ s201 1) (GEQ s200 1) (GEQ s206 1) (GEQ s205 1) (GEQ s204 1) (GEQ s210 1) (GEQ s209 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 3804 reset in 558 ms.
Stack based approach found an accepted trace after 36 steps with 1 reset with depth 12 and stack size 12 in 2 ms.
FORMULA Peterson-COL-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-03 finished in 1519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(G(p1))||G(p2))))'
Support contains 100 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:22] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:22] [INFO ] Invariant cache hit.
[2024-05-28 06:57:22] [INFO ] Implicit Places using invariants in 95 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 97 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s11 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s11 1) (GEQ s20 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-04 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(p0))&&G(p1)))))'
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:23] [INFO ] Invariant cache hit.
[2024-05-28 06:57:23] [INFO ] Implicit Places using invariants in 166 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 173 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(AND (LT s61 1) (LT s60 1) (LT s63 1) (LT s62 1) (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-05 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:23] [INFO ] Invariant cache hit.
[2024-05-28 06:57:23] [INFO ] Implicit Places using invariants in 161 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 167 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s22 1) (GEQ s38 1)) (AND (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s31 1) (GEQ s43 1)) (AND (GEQ s20 1) (GEQ s32 1)) (AND (GEQ s26 1) (GEQ s39 1...], 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]]
Product exploration explored 100000 steps with 0 reset in 350 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 95 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-06 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 244 transition count 272
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 184 transition count 272
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 120 place count 184 transition count 224
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 216 place count 136 transition count 224
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 24 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2024-05-28 06:57:24] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2024-05-28 06:57:24] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 06:57:24] [INFO ] Implicit Places using invariants in 82 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 120/244 places, 212/332 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : Peterson-COL-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s93 1)) (AND (GEQ s2 1) (GEQ s66 1)) (AND (GEQ s4 1) (GEQ s89 1)) (AND (GEQ s2 1) (GEQ s63 1)) (AND (GEQ s6 1) (GEQ s62 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 496 ms.
Stack based approach found an accepted trace after 182 steps with 0 reset with depth 183 and stack size 175 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-07 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:24] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:57:24] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 06:57:25] [INFO ] Implicit Places using invariants in 132 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 133 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-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 s11 1) (GEQ s22 1)) (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s11 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s11 1) (GEQ s20 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 6 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-08 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((!p1&&(!p1 U (p2||G(!p1)))) U ((!p1 U (p2||G(!p1)))&&p3)))||p0))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 1 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:25] [INFO ] Invariant cache hit.
[2024-05-28 06:57:25] [INFO ] Implicit Places using invariants in 158 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 160 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s142 1) (GEQ s108 1) (GEQ s125 1) (GEQ s147 1) (GEQ s112 1) (GEQ s129 1) (GEQ s134 1) (GEQ s151 1) (GEQ s116 1) (GEQ s138 1) (GEQ s155 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12552 reset in 1002 ms.
Product exploration explored 100000 steps with 12455 reset in 1009 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 p0) (NOT p3) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 06:57:28] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2024-05-28 06:57:28] [INFO ] Computed 11 invariants in 12 ms
[2024-05-28 06:57:28] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p3 (NOT p2) (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p1)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2024-05-28 06:57:28] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:29] [INFO ] Invariant cache hit.
[2024-05-28 06:57:29] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-28 06:57:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:57:29] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-05-28 06:57:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:57:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:57:30] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-28 06:57:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:30] [INFO ] [Nat]Added 57 Read/Feed constraints in 27 ms returned sat
[2024-05-28 06:57:30] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
[2024-05-28 06:57:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-28 06:57:30] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 25 ms.
[2024-05-28 06:57:31] [INFO ] Added : 106 causal constraints over 22 iterations in 669 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 60 out of 240 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:31] [INFO ] Invariant cache hit.
[2024-05-28 06:57:31] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-28 06:57:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:31] [INFO ] Invariant cache hit.
[2024-05-28 06:57:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:31] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-28 06:57:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:31] [INFO ] Invariant cache hit.
[2024-05-28 06:57:31] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 240/240 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3)), (X (X (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3))))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2024-05-28 06:57:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-28 06:57:32] [INFO ] Invariant cache hit.
[2024-05-28 06:57:32] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-28 06:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 06:57:32] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-05-28 06:57:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:57:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 06:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 06:57:33] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-05-28 06:57:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:33] [INFO ] [Nat]Added 57 Read/Feed constraints in 27 ms returned sat
[2024-05-28 06:57:33] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2024-05-28 06:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-28 06:57:33] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 46 ms.
[2024-05-28 06:57:34] [INFO ] Added : 106 causal constraints over 22 iterations in 879 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 12565 reset in 606 ms.
Product exploration explored 100000 steps with 12364 reset in 593 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 60 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 240 transition count 332
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 39 place count 240 transition count 332
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 240 transition count 332
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 60 place count 240 transition count 332
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 232 transition count 324
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 232 transition count 324
Deduced a syphon composed of 52 places in 0 ms
Applied a total of 76 rules in 41 ms. Remains 232 /240 variables (removed 8) and now considering 324/332 (removed 8) transitions.
[2024-05-28 06:57:36] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-28 06:57:36] [INFO ] Flow matrix only has 300 transitions (discarded 24 similar events)
// Phase 1: matrix 300 rows 232 cols
[2024-05-28 06:57:36] [INFO ] Computed 11 invariants in 2 ms
[2024-05-28 06:57:36] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/240 places, 324/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 232/240 places, 324/332 transitions.
Built C files in :
/tmp/ltsmin17807990236905158100
[2024-05-28 06:57:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17807990236905158100
Running compilation step : cd /tmp/ltsmin17807990236905158100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 996 ms.
Running link step : cd /tmp/ltsmin17807990236905158100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17807990236905158100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5161821752628171128.hoa' '--buchi-type=spotba'
LTSmin run took 9172 ms.
FORMULA Peterson-COL-3-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-3-LTLFireability-09 finished in 21628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 40 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:46] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:57:46] [INFO ] Computed 15 invariants in 5 ms
[2024-05-28 06:57:46] [INFO ] Implicit Places using invariants in 115 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 128 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s189 1)) (AND (GEQ s2 1) (GEQ s162 1)) (AND (GEQ s4 1) (GEQ s185 1)) (AND (GEQ s2 1) (GEQ s159 1)) (AND (GEQ s6 1) (GEQ s158 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 477 reset in 339 ms.
Stack based approach found an accepted trace after 214 steps with 1 reset with depth 206 and stack size 206 in 2 ms.
FORMULA Peterson-COL-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-10 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 244 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 181 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 144 place count 172 transition count 212
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 18 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2024-05-28 06:57:47] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2024-05-28 06:57:47] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 06:57:47] [INFO ] Implicit Places using invariants in 152 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 154 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 120/244 places, 212/332 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(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 s83 1) (LT s95 1) (LT s111 1) (LT s86 1) (LT s98 1) (LT s107 1) (LT s101 1) (LT s89 1) (LT s119 1) (LT s92 1) (LT s104 1) (LT s115 1)), p0:(AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 192 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 06:57:48] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 120 cols
[2024-05-28 06:57:48] [INFO ] Computed 11 invariants in 1 ms
[2024-05-28 06:57:48] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 06:57:48] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 06:57:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 06:57:48] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 06:57:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:48] [INFO ] After 28ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 06:57:48] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2024-05-28 06:57:48] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:57:49] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1123 ms
[2024-05-28 06:57:49] [INFO ] After 1172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-28 06:57:49] [INFO ] After 1316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 120/120 places, 212/212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 134378 steps, run visited all 1 properties in 369 ms. (steps per millisecond=364 )
Probabilistic random walk after 134378 steps, saw 27163 distinct states, run finished after 369 ms. (steps per millisecond=364 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-05-28 06:57:50] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-28 06:57:50] [INFO ] Invariant cache hit.
[2024-05-28 06:57:50] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 06:57:50] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-28 06:57:50] [INFO ] Invariant cache hit.
[2024-05-28 06:57:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:51] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2024-05-28 06:57:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 06:57:51] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-28 06:57:51] [INFO ] Invariant cache hit.
[2024-05-28 06:57:51] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 616 ms. Remains : 120/120 places, 212/212 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 06:57:51] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2024-05-28 06:57:51] [INFO ] Invariant cache hit.
[2024-05-28 06:57:51] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 06:57:51] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 06:57:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 06:57:51] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 06:57:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-28 06:57:51] [INFO ] After 22ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-28 06:57:51] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2024-05-28 06:57:51] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-28 06:57:51] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:57:51] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:57:52] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:57:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 304 ms
[2024-05-28 06:57:52] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-28 06:57:52] [INFO ] After 483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 120/120 places, 212/212 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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 134378 steps, run visited all 1 properties in 309 ms. (steps per millisecond=434 )
Probabilistic random walk after 134378 steps, saw 27163 distinct states, run finished after 310 ms. (steps per millisecond=433 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 176 ms.
Product exploration explored 100000 steps with 0 reset in 194 ms.
Built C files in :
/tmp/ltsmin7503251006641909728
[2024-05-28 06:57:53] [INFO ] Computing symmetric may disable matrix : 212 transitions.
[2024-05-28 06:57:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:53] [INFO ] Computing symmetric may enable matrix : 212 transitions.
[2024-05-28 06:57:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:53] [INFO ] Computing Do-Not-Accords matrix : 212 transitions.
[2024-05-28 06:57:53] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:57:53] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7503251006641909728
Running compilation step : cd /tmp/ltsmin7503251006641909728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 582 ms.
Running link step : cd /tmp/ltsmin7503251006641909728;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7503251006641909728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14077610491182407138.hoa' '--buchi-type=spotba'
LTSmin run took 3412 ms.
FORMULA Peterson-COL-3-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-3-LTLFireability-11 finished in 9773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||G(p1))))'
Support contains 52 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 244 transition count 278
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 190 transition count 278
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 108 place count 190 transition count 227
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 210 place count 139 transition count 227
Applied a total of 210 rules in 13 ms. Remains 139 /244 variables (removed 105) and now considering 227/332 (removed 105) transitions.
[2024-05-28 06:57:57] [INFO ] Flow matrix only has 203 transitions (discarded 24 similar events)
// Phase 1: matrix 203 rows 139 cols
[2024-05-28 06:57:57] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 06:57:57] [INFO ] Implicit Places using invariants in 184 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 187 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/244 places, 227/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 135/244 places, 227/332 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s7 1) (GEQ s65 1)) (AND (GEQ s5 1) (GEQ s95 1)) (AND (GEQ s5 1) (GEQ s92 1)) (AND (GEQ s7 1) (GEQ s68 1)) (AND (GEQ s7 1) (GEQ s71 1)) (A...], 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 0 reset in 543 ms.
Stack based approach found an accepted trace after 137 steps with 0 reset with depth 138 and stack size 131 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-12 finished in 825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 192 place count 148 transition count 192
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 280 place count 104 transition count 192
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 304 place count 92 transition count 180
Applied a total of 304 rules in 13 ms. Remains 92 /244 variables (removed 152) and now considering 180/332 (removed 152) transitions.
[2024-05-28 06:57:58] [INFO ] Flow matrix only has 156 transitions (discarded 24 similar events)
// Phase 1: matrix 156 rows 92 cols
[2024-05-28 06:57:58] [INFO ] Computed 15 invariants in 1 ms
[2024-05-28 06:57:58] [INFO ] Implicit Places using invariants in 93 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 103 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/244 places, 180/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 88/244 places, 180/332 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s62 1)) (AND (GEQ s7 1) (GEQ s63 1)) (AND (GEQ s1 1) (GEQ s60 1)) (AND (GEQ s3 1) (GEQ s61 1)))], 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 2074 reset in 163 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-13 finished in 396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 36 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 244 transition count 290
Reduce places removed 42 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 78 rules applied. Total rules applied 120 place count 202 transition count 254
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 156 place count 166 transition count 254
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 156 place count 166 transition count 230
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 204 place count 142 transition count 230
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 222 place count 133 transition count 221
Applied a total of 222 rules in 14 ms. Remains 133 /244 variables (removed 111) and now considering 221/332 (removed 111) transitions.
[2024-05-28 06:57:58] [INFO ] Flow matrix only has 197 transitions (discarded 24 similar events)
// Phase 1: matrix 197 rows 133 cols
[2024-05-28 06:57:58] [INFO ] Computed 15 invariants in 1 ms
[2024-05-28 06:57:58] [INFO ] Implicit Places using invariants in 219 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 222 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/244 places, 221/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 129/244 places, 221/332 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0]
Running random walk in product with property : Peterson-COL-3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s95 1) (GEQ s94 1) (GEQ s93 1) (GEQ s98 1) (GEQ s97 1) (GEQ s96 1) (GEQ s101 1) (GEQ s100 1) (GEQ s99 1) (GEQ s104 1) (GEQ s103 1) (GEQ s102 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3624 reset in 238 ms.
Stack based approach found an accepted trace after 53 steps with 0 reset with depth 54 and stack size 50 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-14 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(G(p1))))))'
Support contains 44 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-28 06:57:59] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-28 06:57:59] [INFO ] Computed 15 invariants in 3 ms
[2024-05-28 06:57:59] [INFO ] Implicit Places using invariants in 122 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 123 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (OR (GEQ s142 1) (GEQ s108 1) (GEQ s125 1) (GEQ s147 1) (GEQ s112 1) (GEQ s129 1) (GEQ s134 1) (GEQ s151 1) (GEQ s116 1) (GEQ s138 1) (GEQ s155 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1222 reset in 171 ms.
Stack based approach found an accepted trace after 36 steps with 1 reset with depth 18 and stack size 18 in 1 ms.
FORMULA Peterson-COL-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-15 finished in 495 ms.
All properties solved by simple procedures.
Total runtime 47644 ms.

BK_STOP 1716879480564

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Peterson-COL-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654422000133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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