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.r263-tall-171654372600358.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 NoC3x3-PT-2A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372600358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 12 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 07:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 127K 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 NoC3x3-PT-2A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-2A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716689621571

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=NoC3x3-PT-2A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 02:13:43] [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-26 02:13:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:13:43] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-26 02:13:43] [INFO ] Transformed 361 places.
[2024-05-26 02:13:43] [INFO ] Transformed 428 transitions.
[2024-05-26 02:13:43] [INFO ] Found NUPN structural information;
[2024-05-26 02:13:43] [INFO ] Parsed PT model containing 361 places and 428 transitions and 1697 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA NoC3x3-PT-2A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 428/428 transitions.
Ensure Unique test removed 23 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 338 transition count 428
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 111 place count 250 transition count 319
Ensure Unique test removed 28 places
Iterating global reduction 1 with 116 rules applied. Total rules applied 227 place count 222 transition count 319
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 279 place count 222 transition count 267
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 299 place count 222 transition count 247
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 303 place count 218 transition count 247
Applied a total of 303 rules in 41 ms. Remains 218 /361 variables (removed 143) and now considering 247/428 (removed 181) transitions.
[2024-05-26 02:13:44] [INFO ] Flow matrix only has 235 transitions (discarded 12 similar events)
// Phase 1: matrix 235 rows 218 cols
[2024-05-26 02:13:44] [INFO ] Computed 72 invariants in 18 ms
[2024-05-26 02:13:44] [INFO ] Implicit Places using invariants in 218 ms returned [9, 49]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 243 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 216/361 places, 247/428 transitions.
Applied a total of 0 rules in 5 ms. Remains 216 /216 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 289 ms. Remains : 216/361 places, 247/428 transitions.
Support contains 62 out of 216 places after structural reductions.
[2024-05-26 02:13:44] [INFO ] Flatten gal took : 43 ms
[2024-05-26 02:13:44] [INFO ] Flatten gal took : 19 ms
[2024-05-26 02:13:44] [INFO ] Input system was already deterministic with 247 transitions.
Support contains 58 out of 216 places (down from 62) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 35) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-26 02:13:44] [INFO ] Flow matrix only has 235 transitions (discarded 12 similar events)
// Phase 1: matrix 235 rows 216 cols
[2024-05-26 02:13:44] [INFO ] Computed 70 invariants in 3 ms
[2024-05-26 02:13:45] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 02:13:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 13 ms returned sat
[2024-05-26 02:13:45] [INFO ] [Nat]Absence check using 61 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-26 02:13:45] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-26 02:13:45] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-26 02:13:45] [INFO ] After 29ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-26 02:13:45] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-26 02:13:45] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 247/247 transitions.
Graph (complete) has 606 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 213 transition count 188
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 111 place count 163 transition count 188
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 128 place count 146 transition count 168
Ensure Unique test removed 9 places
Iterating global reduction 2 with 26 rules applied. Total rules applied 154 place count 137 transition count 168
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 19 rules applied. Total rules applied 173 place count 137 transition count 149
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 182 place count 128 transition count 149
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 184 place count 128 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 186 place count 126 transition count 147
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 216 place count 126 transition count 147
Applied a total of 216 rules in 34 ms. Remains 126 /216 variables (removed 90) and now considering 147/247 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 126/216 places, 147/247 transitions.
Finished random walk after 258 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 643 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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(p0)||X(p1)))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 213 transition count 247
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 196 transition count 227
Ensure Unique test removed 9 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 46 place count 187 transition count 227
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 56 place count 187 transition count 217
Applied a total of 56 rules in 7 ms. Remains 187 /216 variables (removed 29) and now considering 217/247 (removed 30) transitions.
[2024-05-26 02:13:45] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
// Phase 1: matrix 208 rows 187 cols
[2024-05-26 02:13:45] [INFO ] Computed 58 invariants in 2 ms
[2024-05-26 02:13:45] [INFO ] Implicit Places using invariants in 87 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/216 places, 217/247 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 186/216 places, 217/247 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 255 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s17 0) (EQ s27 0)), p0:(OR (EQ s5 0) (EQ s64 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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]]
Product exploration explored 100000 steps with 50000 reset in 552 ms.
Product exploration explored 100000 steps with 50000 reset in 385 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-2A-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-2A-LTLFireability-01 finished in 1372 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(p0)||X((G(p1)&&F(p2)))))'
Support contains 5 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 213 transition count 247
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 197 transition count 228
Ensure Unique test removed 8 places
Iterating global reduction 1 with 24 rules applied. Total rules applied 43 place count 189 transition count 228
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 52 place count 189 transition count 219
Applied a total of 52 rules in 12 ms. Remains 189 /216 variables (removed 27) and now considering 219/247 (removed 28) transitions.
[2024-05-26 02:13:47] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 189 cols
[2024-05-26 02:13:47] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 02:13:47] [INFO ] Implicit Places using invariants in 84 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/216 places, 219/247 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 188/216 places, 219/247 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (EQ s156 0) (EQ s158 0)), p1:(EQ s124 1), p2:(OR (EQ s4 0) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-02 finished in 368 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(p1)&&p0))||G(p2)))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Graph (complete) has 643 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 211 transition count 194
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 121 place count 151 transition count 187
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 137 place count 135 transition count 167
Ensure Unique test removed 7 places
Iterating global reduction 2 with 23 rules applied. Total rules applied 160 place count 128 transition count 167
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 15 rules applied. Total rules applied 175 place count 128 transition count 152
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 184 place count 120 transition count 151
Applied a total of 184 rules in 22 ms. Remains 120 /216 variables (removed 96) and now considering 151/247 (removed 96) transitions.
// Phase 1: matrix 151 rows 120 cols
[2024-05-26 02:13:47] [INFO ] Computed 50 invariants in 0 ms
[2024-05-26 02:13:47] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-26 02:13:47] [INFO ] Invariant cache hit.
[2024-05-26 02:13:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-26 02:13:47] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-26 02:13:47] [INFO ] Redundant transitions in 53 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 59, 60, 67, 68, 71, 82, 97, 98, 100, 104, 107, 108, 109, 115, 116, 117, 119, 123, 126, 127, 128, 129, 132, 135, 140, 150]
Found 34 redundant transitions using SMT.
Drop transitions removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
// Phase 1: matrix 117 rows 120 cols
[2024-05-26 02:13:47] [INFO ] Computed 50 invariants in 3 ms
[2024-05-26 02:13:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/216 places, 117/247 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 120 transition count 104
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 94 transition count 104
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 45 place count 94 transition count 98
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 44 edges and 82 vertex of which 14 / 82 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 19 rules applied. Total rules applied 64 place count 75 transition count 92
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 71 place count 75 transition count 85
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 95 place count 59 transition count 77
Graph (trivial) has 37 edges and 59 vertex of which 16 / 59 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 51 transition count 77
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 104 place count 51 transition count 69
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 119 place count 51 transition count 54
Applied a total of 119 rules in 20 ms. Remains 51 /120 variables (removed 69) and now considering 54/117 (removed 63) transitions.
// Phase 1: matrix 54 rows 51 cols
[2024-05-26 02:13:47] [INFO ] Computed 23 invariants in 1 ms
[2024-05-26 02:13:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-26 02:13:47] [INFO ] Invariant cache hit.
[2024-05-26 02:13:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 02:13:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/216 places, 54/247 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 429 ms. Remains : 51/216 places, 54/247 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s49 1) (EQ s42 1) (EQ s44 1)), p2:(OR (EQ s39 0) (EQ s49 0)), p1:(AND (EQ s42 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 128 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-03 finished in 616 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((F(p1)&&(X(p2) U p3)))))'
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 214 transition count 247
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 197 transition count 227
Ensure Unique test removed 9 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 45 place count 188 transition count 227
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 55 place count 188 transition count 217
Applied a total of 55 rules in 9 ms. Remains 188 /216 variables (removed 28) and now considering 217/247 (removed 30) transitions.
[2024-05-26 02:13:48] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
// Phase 1: matrix 208 rows 188 cols
[2024-05-26 02:13:48] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 02:13:48] [INFO ] Implicit Places using invariants in 72 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/216 places, 217/247 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 187/216 places, 217/247 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s177 0) (EQ s179 0)), p1:(AND (EQ s80 1) (EQ s110 1)), p3:(AND (EQ s177 1) (EQ s179 1)), p2:(AND (EQ s155 1) (EQ s180 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 369 ms.
Product exploration explored 100000 steps with 50000 reset in 355 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 535 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-2A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-2A-LTLFireability-04 finished in 1161 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))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Graph (complete) has 643 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 213 transition count 197
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 163 transition count 197
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 117 place count 147 transition count 178
Ensure Unique test removed 8 places
Iterating global reduction 2 with 24 rules applied. Total rules applied 141 place count 139 transition count 178
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 17 rules applied. Total rules applied 158 place count 139 transition count 161
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 166 place count 131 transition count 161
Applied a total of 166 rules in 13 ms. Remains 131 /216 variables (removed 85) and now considering 161/247 (removed 86) transitions.
[2024-05-26 02:13:49] [INFO ] Flow matrix only has 152 transitions (discarded 9 similar events)
// Phase 1: matrix 152 rows 131 cols
[2024-05-26 02:13:49] [INFO ] Computed 59 invariants in 2 ms
[2024-05-26 02:13:49] [INFO ] Implicit Places using invariants in 66 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/216 places, 161/247 transitions.
Applied a total of 0 rules in 5 ms. Remains 130 /130 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 130/216 places, 161/247 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s62 1) (EQ s91 1)) (AND (EQ s84 1) (EQ s88 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-05 finished in 126 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(p1)||p0)))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Graph (complete) has 643 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 213 transition count 199
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 165 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 163 transition count 197
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 118 place count 146 transition count 176
Ensure Unique test removed 9 places
Iterating global reduction 3 with 26 rules applied. Total rules applied 144 place count 137 transition count 176
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 17 rules applied. Total rules applied 161 place count 137 transition count 159
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 169 place count 130 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 170 place count 129 transition count 158
Applied a total of 170 rules in 22 ms. Remains 129 /216 variables (removed 87) and now considering 158/247 (removed 89) transitions.
[2024-05-26 02:13:49] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
// Phase 1: matrix 150 rows 129 cols
[2024-05-26 02:13:49] [INFO ] Computed 58 invariants in 0 ms
[2024-05-26 02:13:49] [INFO ] Implicit Places using invariants in 64 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/216 places, 158/247 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 128/216 places, 158/247 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s28 1)), p0:(OR (AND (EQ s76 1) (EQ s103 1)) (AND (EQ s14 1) (EQ s28 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-07 finished in 143 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)&&F(G(p1)))))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Graph (complete) has 643 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 213 transition count 195
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 161 transition count 195
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 122 place count 144 transition count 174
Ensure Unique test removed 8 places
Iterating global reduction 2 with 25 rules applied. Total rules applied 147 place count 136 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 17 rules applied. Total rules applied 164 place count 136 transition count 157
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 172 place count 128 transition count 157
Applied a total of 172 rules in 16 ms. Remains 128 /216 variables (removed 88) and now considering 157/247 (removed 90) transitions.
[2024-05-26 02:13:49] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 128 cols
[2024-05-26 02:13:49] [INFO ] Computed 59 invariants in 10 ms
[2024-05-26 02:13:49] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-26 02:13:49] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2024-05-26 02:13:49] [INFO ] Invariant cache hit.
[2024-05-26 02:13:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-26 02:13:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-26 02:13:49] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-26 02:13:49] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2024-05-26 02:13:49] [INFO ] Invariant cache hit.
[2024-05-26 02:13:49] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/216 places, 157/247 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 128/216 places, 157/247 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s120 1) (EQ s122 1)), p1:(OR (NEQ s94 1) (NEQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-08 finished in 441 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(G(p0)) U p1)))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 213 transition count 247
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 197 transition count 228
Ensure Unique test removed 8 places
Iterating global reduction 1 with 24 rules applied. Total rules applied 43 place count 189 transition count 228
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 52 place count 189 transition count 219
Applied a total of 52 rules in 8 ms. Remains 189 /216 variables (removed 27) and now considering 219/247 (removed 28) transitions.
[2024-05-26 02:13:49] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 189 cols
[2024-05-26 02:13:49] [INFO ] Computed 59 invariants in 2 ms
[2024-05-26 02:13:50] [INFO ] Implicit Places using invariants in 80 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/216 places, 219/247 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 188/216 places, 219/247 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s84 1) (EQ s127 1))) (EQ s78 1) (EQ s98 1)), p0:(AND (EQ s78 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-09 finished in 354 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((G(F(!p0))||(F(!p0)&&X((!p1 U (p2||G(!p1))))))))))'
Support contains 5 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 213 transition count 247
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 196 transition count 226
Ensure Unique test removed 9 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 46 place count 187 transition count 226
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 56 place count 187 transition count 216
Applied a total of 56 rules in 8 ms. Remains 187 /216 variables (removed 29) and now considering 216/247 (removed 31) transitions.
[2024-05-26 02:13:50] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 187 cols
[2024-05-26 02:13:50] [INFO ] Computed 58 invariants in 1 ms
[2024-05-26 02:13:50] [INFO ] Implicit Places using invariants in 73 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/216 places, 216/247 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 186/216 places, 216/247 transitions.
Stuttering acceptance computed with spot in 216 ms :[p0, p0, p0, (AND (NOT p2) p0 p1), p0]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s128 1) (EQ s175 1)), p2:(AND (NEQ s140 1) (NOT (AND (EQ s1 1) (EQ s11 1)))), p1:(AND (EQ s1 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 24875 steps with 2068 reset in 114 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-10 finished in 442 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 U (p2 U (F(!p3)||G(p4))))))))'
Support contains 10 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Graph (complete) has 643 edges and 216 vertex of which 214 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 213 transition count 204
Reduce places removed 43 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 170 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 166 transition count 200
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 110 place count 151 transition count 182
Ensure Unique test removed 8 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 133 place count 143 transition count 182
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 14 rules applied. Total rules applied 147 place count 143 transition count 168
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 152 place count 138 transition count 168
Applied a total of 152 rules in 18 ms. Remains 138 /216 variables (removed 78) and now considering 168/247 (removed 79) transitions.
[2024-05-26 02:13:50] [INFO ] Flow matrix only has 159 transitions (discarded 9 similar events)
// Phase 1: matrix 159 rows 138 cols
[2024-05-26 02:13:50] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 02:13:50] [INFO ] Implicit Places using invariants in 64 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/216 places, 168/247 transitions.
Applied a total of 0 rules in 3 ms. Remains 137 /137 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 137/216 places, 168/247 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) p3 (NOT p4)), (AND (NOT p0) p3 (NOT p4)), (AND (NOT p0) p3 (NOT p4)), (AND (NOT p0) p3 (NOT p4)), (AND (NOT p0) p3 (NOT p4))]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p3 p4 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) p3 p4) (AND (NOT p0) p3 p2) (AND (NOT p0) p3 p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p4) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p3 p4 p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p4) p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p4 p2 (NOT p1)), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p4) p2 (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) p3 p4 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 4}], [{ cond=(AND (NOT p0) p3 (NOT p4) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p3 p4 p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p4) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p4 p2 (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p4) p2 (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p0) p3 p4 (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) p3 (NOT p4) (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p4) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p3 p4 p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p4) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p3 p4 p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p4) p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p3 p4 p2 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p4) p2 (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) p3 p4 (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p3 p4 (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) p3 (NOT p4) p2) (AND (NOT p0) p3 (NOT p4) p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p4) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p3 p4 p1), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p4) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p3 p4 p2 (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p4) p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p3 p4 p2) (AND (NOT p0) p3 p4 p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p3 p4 (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s26 1)), p3:(AND (EQ s78 1) (EQ s91 1)), p4:(AND (EQ s4 1) (EQ s12 1)), p2:(AND (EQ s60 1) (EQ s86 1)), p1:(AND (EQ s128 1) (EQ s13...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1365 steps with 1 reset in 10 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-11 finished in 375 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 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Graph (complete) has 643 edges and 216 vertex of which 215 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 214 transition count 201
Reduce places removed 46 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 168 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 165 transition count 198
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 117 place count 147 transition count 176
Ensure Unique test removed 9 places
Iterating global reduction 3 with 27 rules applied. Total rules applied 144 place count 138 transition count 176
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 18 rules applied. Total rules applied 162 place count 138 transition count 158
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 171 place count 130 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 172 place count 129 transition count 157
Applied a total of 172 rules in 15 ms. Remains 129 /216 variables (removed 87) and now considering 157/247 (removed 90) transitions.
[2024-05-26 02:13:51] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 129 cols
[2024-05-26 02:13:51] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 02:13:51] [INFO ] Implicit Places using invariants in 72 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/216 places, 157/247 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 128/216 places, 157/247 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s47 1) (EQ s48 1)) (AND (EQ s105 1) (EQ s118 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-13 finished in 146 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)) U p1))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 213 transition count 247
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 197 transition count 227
Ensure Unique test removed 7 places
Iterating global reduction 1 with 23 rules applied. Total rules applied 42 place count 190 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 50 place count 190 transition count 219
Applied a total of 50 rules in 7 ms. Remains 190 /216 variables (removed 26) and now considering 219/247 (removed 28) transitions.
[2024-05-26 02:13:51] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 190 cols
[2024-05-26 02:13:51] [INFO ] Computed 60 invariants in 1 ms
[2024-05-26 02:13:51] [INFO ] Implicit Places using invariants in 66 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/216 places, 219/247 transitions.
Applied a total of 0 rules in 1 ms. Remains 189 /189 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 189/216 places, 219/247 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s80 1) (EQ s105 1)), p1:(AND (EQ s117 1) (EQ s130 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-14 finished in 196 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(G((!F(p0)&&X(p1))))||F(p0))) U p2))'
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 247/247 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 214 transition count 247
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 196 transition count 225
Ensure Unique test removed 9 places
Iterating global reduction 1 with 27 rules applied. Total rules applied 47 place count 187 transition count 225
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 57 place count 187 transition count 215
Applied a total of 57 rules in 7 ms. Remains 187 /216 variables (removed 29) and now considering 215/247 (removed 32) transitions.
[2024-05-26 02:13:51] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 187 cols
[2024-05-26 02:13:51] [INFO ] Computed 59 invariants in 1 ms
[2024-05-26 02:13:51] [INFO ] Implicit Places using invariants in 69 ms returned [139]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/216 places, 215/247 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 186/216 places, 215/247 transitions.
Stuttering acceptance computed with spot in 228 ms :[p0, (NOT p2), (OR p1 p0), true, (OR (NOT p2) p1 p0), (OR p0 p1)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 3}]], initial=1, aps=[p0:(AND (EQ s135 1) (EQ s142 1)), p2:(AND (EQ s149 1) (EQ s167 1)), p1:(AND (EQ s133 1) (EQ s146 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-15 finished in 325 ms.
All properties solved by simple procedures.
Total runtime 8050 ms.

BK_STOP 1716689633133

--------------------
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="NoC3x3-PT-2A"
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 NoC3x3-PT-2A, 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 r263-tall-171654372600358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-2A.tgz
mv NoC3x3-PT-2A 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 ;