About the Execution of ITS-Tools for NoC3x3-PT-2A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 322871.00 | 0.00 | 0.00 | FFFFTFFFFFFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100172.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
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 r142-tall-174876812100172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 127K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml 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 1748815775679
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 22:09:36] [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]
[2025-06-01 22:09:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:09:37] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-01 22:09:37] [INFO ] Transformed 361 places.
[2025-06-01 22:09:37] [INFO ] Transformed 428 transitions.
[2025-06-01 22:09:37] [INFO ] Found NUPN structural information;
[2025-06-01 22:09:37] [INFO ] Parsed PT model containing 361 places and 428 transitions and 1697 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-2A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 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 22 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 339 transition count 428
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 110 place count 251 transition count 319
Ensure Unique test removed 25 places
Iterating global reduction 1 with 113 rules applied. Total rules applied 223 place count 226 transition count 319
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 273 place count 226 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 293 place count 226 transition count 249
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 298 place count 221 transition count 249
Applied a total of 298 rules in 65 ms. Remains 221 /361 variables (removed 140) and now considering 249/428 (removed 179) transitions.
[2025-06-01 22:09:37] [INFO ] Flow matrix only has 237 transitions (discarded 12 similar events)
// Phase 1: matrix 237 rows 221 cols
[2025-06-01 22:09:37] [INFO ] Computed 75 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:37] [INFO ] Implicit Places using invariants in 281 ms returned [7, 48, 167]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 315 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/361 places, 249/428 transitions.
Applied a total of 0 rules in 5 ms. Remains 218 /218 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 218/361 places, 249/428 transitions.
Support contains 56 out of 218 places after structural reductions.
[2025-06-01 22:09:37] [INFO ] Flatten gal took : 42 ms
[2025-06-01 22:09:37] [INFO ] Flatten gal took : 20 ms
[2025-06-01 22:09:37] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 54 out of 218 places (down from 56) after GAL structural reductions.
RANDOM walk for 37944 steps (8 resets) in 1315 ms. (28 steps per ms) remains 0/30 properties
FORMULA NoC3x3-PT-2A-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 658 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U p1)))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 215 transition count 249
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 199 transition count 229
Ensure Unique test removed 10 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 45 place count 189 transition count 229
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 189 transition count 219
Applied a total of 55 rules in 13 ms. Remains 189 /218 variables (removed 29) and now considering 219/249 (removed 30) transitions.
[2025-06-01 22:09:38] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 189 cols
[2025-06-01 22:09:38] [INFO ] Computed 59 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:38] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-01 22:09:38] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:09:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:09:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:09:39] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-01 22:09:39] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:09:39] [INFO ] Invariant cache hit.
[2025-06-01 22:09:39] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 258 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9117 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 218/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 218 unsolved in 22167 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31363ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 31378ms
Starting structural reductions in LTL mode, iteration 1 : 189/218 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31662 ms. Remains : 189/218 places, 219/249 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-00 finished in 31946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Graph (complete) has 658 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 214 transition count 199
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 114 place count 157 transition count 192
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 130 place count 141 transition count 172
Ensure Unique test removed 10 places
Iterating global reduction 2 with 26 rules applied. Total rules applied 156 place count 131 transition count 172
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 20 rules applied. Total rules applied 176 place count 131 transition count 152
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 188 place count 120 transition count 151
Applied a total of 188 rules in 25 ms. Remains 120 /218 variables (removed 98) and now considering 151/249 (removed 98) transitions.
// Phase 1: matrix 151 rows 120 cols
[2025-06-01 22:10:10] [INFO ] Computed 50 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 22:10:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 22:10:10] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:10:10] [INFO ] Redundant transitions in 56 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, 122, 126, 129, 130, 131, 132, 135, 138, 139, 140, 141]
Found 34 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 117 rows 120 cols
[2025-06-01 22:10:10] [INFO ] Computed 50 invariants in 1 ms
[2025-06-01 22:10:10] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 13/120 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 116/236 variables, 120/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/237 variables, and 179 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 13/120 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 116/236 variables, 120/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 92/271 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/236 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/237 variables, and 271 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2607 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4496ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4497ms
Starting structural reductions in SI_LTL mode, iteration 1 : 120/218 places, 117/249 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 (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 94 transition count 99
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 46 edges and 84 vertex of which 16 / 84 are part of one of the 8 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 76 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 76 transition count 86
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 92 place count 60 transition count 78
Graph (trivial) has 38 edges and 60 vertex of which 16 / 60 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 93 place count 52 transition count 78
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 101 place count 52 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 52 transition count 54
Applied a total of 117 rules in 21 ms. Remains 52 /120 variables (removed 68) and now considering 54/117 (removed 63) transitions.
// Phase 1: matrix 54 rows 52 cols
[2025-06-01 22:10:15] [INFO ] Computed 24 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:15] [INFO ] Implicit Places using invariants in 30 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/218 places, 54/249 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4809 ms. Remains : 51/218 places, 54/249 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-01
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-01 finished in 4942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1))||F(G(p2))))'
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Graph (complete) has 658 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 215 transition count 202
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 168 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 167 transition count 201
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 114 place count 150 transition count 180
Ensure Unique test removed 12 places
Iterating global reduction 3 with 29 rules applied. Total rules applied 143 place count 138 transition count 180
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 23 rules applied. Total rules applied 166 place count 138 transition count 157
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 177 place count 127 transition count 157
Applied a total of 177 rules in 34 ms. Remains 127 /218 variables (removed 91) and now considering 157/249 (removed 92) transitions.
[2025-06-01 22:10:15] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 127 cols
[2025-06-01 22:10:15] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:15] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-01 22:10:15] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2025-06-01 22:10:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:15] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-01 22:10:15] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:10:15] [INFO ] Redundant transitions in 5 ms returned []
Running 156 sub problems to find dead transitions.
[2025-06-01 22:10:15] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2025-06-01 22:10:15] [INFO ] Invariant cache hit.
[2025-06-01 22:10:15] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 148/275 variables, 127/184 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 33/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/276 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 218 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4275 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 127/127 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 148/275 variables, 127/184 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 33/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 156/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 1/276 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 374 constraints, problems are : Problem set: 0 solved, 156 unsolved in 8864 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 127/127 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13168ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 13169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/218 places, 157/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13402 ms. Remains : 127/218 places, 157/249 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-02
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-02 finished in 13554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 249/249 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 216 transition count 249
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 199 transition count 229
Ensure Unique test removed 12 places
Iterating global reduction 1 with 29 rules applied. Total rules applied 48 place count 187 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 60 place count 187 transition count 217
Applied a total of 60 rules in 6 ms. Remains 187 /218 variables (removed 31) and now considering 217/249 (removed 32) transitions.
[2025-06-01 22:10:29] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
// Phase 1: matrix 208 rows 187 cols
[2025-06-01 22:10:29] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-01 22:10:29] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
[2025-06-01 22:10:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:10:29] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-01 22:10:29] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
[2025-06-01 22:10:29] [INFO ] Invariant cache hit.
[2025-06-01 22:10:29] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 207/394 variables, 187/245 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 255 constraints, problems are : Problem set: 0 solved, 216 unsolved in 8456 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 207/394 variables, 187/245 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 216/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 1/395 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/395 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 471 constraints, problems are : Problem set: 0 solved, 216 unsolved in 21406 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29890ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 29891ms
Starting structural reductions in LTL mode, iteration 1 : 187/218 places, 217/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30113 ms. Remains : 187/218 places, 217/249 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-03 finished in 30240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p1&&X(X(X(!p0))))||(X(X(X(!p0)))&&G(!p2))))))'
Support contains 6 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 215 transition count 249
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 199 transition count 229
Ensure Unique test removed 10 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 45 place count 189 transition count 229
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 189 transition count 219
Applied a total of 55 rules in 6 ms. Remains 189 /218 variables (removed 29) and now considering 219/249 (removed 30) transitions.
[2025-06-01 22:10:59] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 189 cols
[2025-06-01 22:10:59] [INFO ] Computed 59 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 22:10:59] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:10:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:10:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:10:59] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-01 22:10:59] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:10:59] [INFO ] Invariant cache hit.
[2025-06-01 22:10:59] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 258 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8904 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 218/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20591 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29518ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 29519ms
Starting structural reductions in LTL mode, iteration 1 : 189/218 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29791 ms. Remains : 189/218 places, 219/249 transitions.
Stuttering acceptance computed with spot in 747 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-05
Product exploration explored 100000 steps with 20038 reset in 512 ms.
Product exploration explored 100000 steps with 19994 reset in 398 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 (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 283 ms. Reduced automaton from 17 states, 87 edges and 3 AP (stutter sensitive) to 17 states, 87 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 755 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2)]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 663 ms. (60 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
[2025-06-01 22:11:32] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:11:32] [INFO ] Invariant cache hit.
[2025-06-01 22:11:32] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf10 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Real declared 15/400 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 4/57 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/189 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (G (OR (NOT p0) (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p0 (NOT p2) p1))), (F p2), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F (NOT (OR (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 25 factoid took 3571 ms. Reduced automaton from 17 states, 87 edges and 3 AP (stutter sensitive) to 17 states, 63 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 819 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 742 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), (AND p2 p1 p0)]
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 219/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 189 /189 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2025-06-01 22:11:37] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:11:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:11:37] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 22:11:37] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:11:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:11:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:11:37] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-01 22:11:37] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:11:37] [INFO ] Invariant cache hit.
[2025-06-01 22:11:37] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 258 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8732 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 218/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20253 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29012ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 29013ms
Finished structural reductions in LTL mode , in 1 iterations and 29250 ms. Remains : 189/189 places, 219/219 transitions.
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 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 2929 ms. Reduced automaton from 17 states, 63 edges and 3 AP (stutter sensitive) to 17 states, 63 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 798 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), (AND p2 p1 p0)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 264 ms. (150 steps per ms) remains 1/10 properties
BEST_FIRST walk for 18829 steps (2 resets) in 28 ms. (649 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 18 factoid took 3556 ms. Reduced automaton from 17 states, 63 edges and 3 AP (stutter sensitive) to 17 states, 63 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 763 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 796 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), (AND p2 p1 p0)]
Stuttering acceptance computed with spot in 764 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), p0, (AND p0 p2), (AND p2 p1 p0)]
Stuttering criterion allowed to conclude after 57298 steps with 11494 reset in 204 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-05 finished in 77247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Graph (complete) has 658 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 214 transition count 200
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 113 place count 158 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 157 transition count 192
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 132 place count 139 transition count 170
Ensure Unique test removed 12 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 162 place count 127 transition count 170
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 24 rules applied. Total rules applied 186 place count 127 transition count 146
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 200 place count 114 transition count 145
Applied a total of 200 rules in 18 ms. Remains 114 /218 variables (removed 104) and now considering 145/249 (removed 104) transitions.
// Phase 1: matrix 145 rows 114 cols
[2025-06-01 22:12:16] [INFO ] Computed 48 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:12:16] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-01 22:12:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:12:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 22:12:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:12:16] [INFO ] Redundant transitions in 52 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 59, 60, 67, 68, 71, 82, 97, 98, 100, 106, 107, 108, 114, 115, 116, 118, 122, 125, 126, 127, 128, 131, 134, 135, 136, 137, 143, 144]
Found 36 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 36 transitions
Redundant transitions reduction (with SMT) removed 36 transitions.
Running 84 sub problems to find dead transitions.
// Phase 1: matrix 109 rows 114 cols
[2025-06-01 22:12:16] [INFO ] Computed 48 invariants in 0 ms
[2025-06-01 22:12:16] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 14/114 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 108/222 variables, 114/162 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/223 variables, and 171 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 114/114 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 14/114 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 108/222 variables, 114/162 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 84/255 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/223 variables, and 255 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 114/114 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3745ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3746ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/218 places, 109/249 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 114 transition count 95
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 86 transition count 95
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 47 place count 86 transition count 90
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 44 edges and 76 vertex of which 16 / 76 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 63 place count 68 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 71 place count 68 transition count 77
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 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 98 place count 50 transition count 68
Graph (trivial) has 36 edges and 50 vertex of which 18 / 50 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 41 transition count 68
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 108 place count 41 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 125 place count 41 transition count 42
Applied a total of 125 rules in 14 ms. Remains 41 /114 variables (removed 73) and now considering 42/109 (removed 67) transitions.
// Phase 1: matrix 42 rows 41 cols
[2025-06-01 22:12:20] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:12:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-01 22:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:12:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/218 places, 42/249 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4054 ms. Remains : 41/218 places, 42/249 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-06 finished in 4128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(F(p1) U X(p0)))) U (p2||F(p3))))'
Support contains 6 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 215 transition count 249
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 199 transition count 231
Ensure Unique test removed 12 places
Iterating global reduction 1 with 28 rules applied. Total rules applied 47 place count 187 transition count 231
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 59 place count 187 transition count 219
Applied a total of 59 rules in 7 ms. Remains 187 /218 variables (removed 31) and now considering 219/249 (removed 30) transitions.
[2025-06-01 22:12:20] [INFO ] Flow matrix only has 209 transitions (discarded 10 similar events)
// Phase 1: matrix 209 rows 187 cols
[2025-06-01 22:12:20] [INFO ] Computed 57 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:12:20] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 22:12:20] [INFO ] Flow matrix only has 209 transitions (discarded 10 similar events)
[2025-06-01 22:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:12:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:12:21] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-01 22:12:21] [INFO ] Flow matrix only has 209 transitions (discarded 10 similar events)
[2025-06-01 22:12:21] [INFO ] Invariant cache hit.
[2025-06-01 22:12:21] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 208/395 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 1/396 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/396 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 254 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8012 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 208/395 variables, 187/244 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 218/471 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/396 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/396 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 472 constraints, problems are : Problem set: 0 solved, 218 unsolved in 19758 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 187/187 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27793ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 27795ms
Starting structural reductions in LTL mode, iteration 1 : 187/218 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28001 ms. Remains : 187/218 places, 219/249 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-07
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 28208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((G(p0) U !p1) U (F(p1)&&p2))&&F(p3))))'
Support contains 6 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 215 transition count 249
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 198 transition count 229
Ensure Unique test removed 12 places
Iterating global reduction 1 with 29 rules applied. Total rules applied 49 place count 186 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 61 place count 186 transition count 217
Applied a total of 61 rules in 8 ms. Remains 186 /218 variables (removed 32) and now considering 217/249 (removed 32) transitions.
[2025-06-01 22:12:49] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
// Phase 1: matrix 208 rows 186 cols
[2025-06-01 22:12:49] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:12:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 22:12:49] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
[2025-06-01 22:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:12:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:12:49] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-01 22:12:49] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
[2025-06-01 22:12:49] [INFO ] Invariant cache hit.
[2025-06-01 22:12:49] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/394 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 253 constraints, problems are : Problem set: 0 solved, 216 unsolved in 7945 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 216/468 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 469 constraints, problems are : Problem set: 0 solved, 216 unsolved in 19989 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27952ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 27953ms
Starting structural reductions in LTL mode, iteration 1 : 186/218 places, 217/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28171 ms. Remains : 186/218 places, 217/249 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), true, (NOT p0), p1, (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-08
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 28480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 215 transition count 249
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 199 transition count 229
Ensure Unique test removed 10 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 45 place count 189 transition count 229
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 189 transition count 219
Applied a total of 55 rules in 9 ms. Remains 189 /218 variables (removed 29) and now considering 219/249 (removed 30) transitions.
[2025-06-01 22:13:17] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 189 cols
[2025-06-01 22:13:17] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:13:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-01 22:13:17] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:13:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:13:17] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-01 22:13:17] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:13:17] [INFO ] Invariant cache hit.
[2025-06-01 22:13:17] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 258 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8875 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 218/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 218 unsolved in 19832 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28724ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 28725ms
Starting structural reductions in LTL mode, iteration 1 : 189/218 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28953 ms. Remains : 189/218 places, 219/249 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-09
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-09 finished in 29095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) 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 43 place count 216 transition count 206
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 89 place count 173 transition count 203
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 170 transition count 203
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 110 place count 152 transition count 181
Ensure Unique test removed 12 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 140 place count 140 transition count 181
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 23 rules applied. Total rules applied 163 place count 140 transition count 158
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 12 rules applied. Total rules applied 175 place count 129 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 176 place count 128 transition count 157
Applied a total of 176 rules in 15 ms. Remains 128 /218 variables (removed 90) and now considering 157/249 (removed 92) transitions.
[2025-06-01 22:13:46] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 128 cols
[2025-06-01 22:13:46] [INFO ] Computed 58 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:13:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-01 22:13:46] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2025-06-01 22:13:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:13:46] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-01 22:13:46] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:13:46] [INFO ] Redundant transitions in 1 ms returned []
Running 156 sub problems to find dead transitions.
[2025-06-01 22:13:46] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
[2025-06-01 22:13:46] [INFO ] Invariant cache hit.
[2025-06-01 22:13:46] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 148/276 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 156 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 30/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 1/277 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 217 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4856 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 128/128 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 1/128 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (OVERLAPS) 148/276 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 30/216 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 156/372 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 1/277 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/277 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 373 constraints, problems are : Problem set: 0 solved, 156 unsolved in 9026 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 128/128 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13901ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 13901ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/218 places, 157/249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14092 ms. Remains : 128/218 places, 157/249 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-13
Stuttering criterion allowed to conclude after 2 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 14142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U p1))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 249/249 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 215 transition count 249
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 199 transition count 229
Ensure Unique test removed 10 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 45 place count 189 transition count 229
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 189 transition count 219
Applied a total of 55 rules in 11 ms. Remains 189 /218 variables (removed 29) and now considering 219/249 (removed 30) transitions.
[2025-06-01 22:14:00] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 189 cols
[2025-06-01 22:14:00] [INFO ] Computed 59 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:14:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-01 22:14:00] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:14:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:14:00] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-01 22:14:01] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:14:01] [INFO ] Invariant cache hit.
[2025-06-01 22:14:01] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 258 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8727 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/248 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 218/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28821ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 28822ms
Starting structural reductions in LTL mode, iteration 1 : 189/218 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29055 ms. Remains : 189/218 places, 219/249 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-2A-LTLFireability-14
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 29191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(G((!F(p0)&&X(p1))))||F(p0))) U p2))'
Support contains 6 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 249/249 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 216 transition count 249
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 198 transition count 227
Ensure Unique test removed 12 places
Iterating global reduction 1 with 30 rules applied. Total rules applied 50 place count 186 transition count 227
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 62 place count 186 transition count 215
Applied a total of 62 rules in 7 ms. Remains 186 /218 variables (removed 32) and now considering 215/249 (removed 34) transitions.
[2025-06-01 22:14:29] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
// Phase 1: matrix 207 rows 186 cols
[2025-06-01 22:14:29] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:14:30] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-01 22:14:30] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:14:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:14:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:14:30] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-01 22:14:30] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
[2025-06-01 22:14:30] [INFO ] Invariant cache hit.
[2025-06-01 22:14:30] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 254 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8292 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/186 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 206/392 variables, 186/244 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 9/253 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 214/467 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/393 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 468 constraints, problems are : Problem set: 0 solved, 214 unsolved in 19795 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28110ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 28110ms
Starting structural reductions in LTL mode, iteration 1 : 186/218 places, 215/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28330 ms. Remains : 186/218 places, 215/249 transitions.
Stuttering acceptance computed with spot in 200 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
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-2A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-2A-LTLFireability-15 finished in 28553 ms.
All properties solved by simple procedures.
Total runtime 321649 ms.
BK_STOP 1748816098550
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
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 r142-tall-174876812100172"
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.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 '
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 ;