About the Execution of ITS-Tools for DiscoveryGPU-PT-11b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 400900.00 | 0.00 | 0.00 | FFFFTFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064600700.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 DiscoveryGPU-PT-11b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064600700
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 82K 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 DiscoveryGPU-PT-11b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748935764813
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 07:29:27] [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-03 07:29:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:29:27] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2025-06-03 07:29:27] [INFO ] Transformed 324 places.
[2025-06-03 07:29:27] [INFO ] Transformed 344 transitions.
[2025-06-03 07:29:27] [INFO ] Found NUPN structural information;
[2025-06-03 07:29:27] [INFO ] Parsed PT model containing 324 places and 344 transitions and 898 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 302 transition count 344
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 74 place count 250 transition count 292
Iterating global reduction 1 with 52 rules applied. Total rules applied 126 place count 250 transition count 292
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 242 transition count 284
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 242 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 148 place count 236 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 236 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 231 transition count 273
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 231 transition count 273
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 168 place count 227 transition count 265
Iterating global reduction 1 with 4 rules applied. Total rules applied 172 place count 227 transition count 265
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 176 place count 223 transition count 261
Iterating global reduction 1 with 4 rules applied. Total rules applied 180 place count 223 transition count 261
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 184 place count 219 transition count 257
Iterating global reduction 1 with 4 rules applied. Total rules applied 188 place count 219 transition count 257
Applied a total of 188 rules in 133 ms. Remains 219 /324 variables (removed 105) and now considering 257/344 (removed 87) transitions.
// Phase 1: matrix 257 rows 219 cols
[2025-06-03 07:29:28] [INFO ] Computed 2 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:29:28] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-03 07:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:29:29] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-03 07:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/476 variables, 219/221 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:42] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:42] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:42] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:43] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:43] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:43] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:43] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:43] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:43] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:44] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:44] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:44] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:44] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:44] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:45] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:45] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:45] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:45] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:45] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:45] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:46] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:29:46] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 243 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/476 variables, 219/243 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 256/499 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 499 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60352ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Starting structural reductions in LTL mode, iteration 1 : 219/324 places, 257/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61392 ms. Remains : 219/324 places, 257/344 transitions.
Support contains 37 out of 219 places after structural reductions.
[2025-06-03 07:30:29] [INFO ] Flatten gal took : 67 ms
[2025-06-03 07:30:29] [INFO ] Flatten gal took : 30 ms
[2025-06-03 07:30:29] [INFO ] Input system was already deterministic with 257 transitions.
Reduction of identical properties reduced properties to check from 36 to 35
RANDOM walk for 40000 steps (109 resets) in 1564 ms. (25 steps per ms) remains 1/35 properties
BEST_FIRST walk for 13901 steps (3 resets) in 123 ms. (112 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-11b-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-11b-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-11b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 37 stabilizing places and 37 stable transitions
Graph (complete) has 436 edges and 219 vertex of which 216 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 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 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Graph (complete) has 436 edges and 219 vertex of which 216 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 215 transition count 223
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 185 transition count 223
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 61 place count 185 transition count 187
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 133 place count 149 transition count 187
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 140 place count 142 transition count 179
Iterating global reduction 2 with 7 rules applied. Total rules applied 147 place count 142 transition count 179
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 152 place count 137 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 157 place count 137 transition count 174
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 161 place count 133 transition count 166
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 133 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 129 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 129 transition count 162
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 271 place count 80 transition count 113
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 280 place count 71 transition count 95
Iterating global reduction 2 with 9 rules applied. Total rules applied 289 place count 71 transition count 95
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 298 place count 62 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 307 place count 62 transition count 86
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 316 place count 53 transition count 68
Iterating global reduction 2 with 9 rules applied. Total rules applied 325 place count 53 transition count 68
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 334 place count 44 transition count 59
Iterating global reduction 2 with 9 rules applied. Total rules applied 343 place count 44 transition count 59
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 351 place count 36 transition count 43
Iterating global reduction 2 with 8 rules applied. Total rules applied 359 place count 36 transition count 43
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 367 place count 28 transition count 35
Iterating global reduction 2 with 8 rules applied. Total rules applied 375 place count 28 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 377 place count 28 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 28 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 380 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 383 place count 25 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 385 place count 23 transition count 29
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 385 place count 23 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 393 place count 19 transition count 25
Applied a total of 393 rules in 103 ms. Remains 19 /219 variables (removed 200) and now considering 25/257 (removed 232) transitions.
[2025-06-03 07:30:31] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 19 cols
[2025-06-03 07:30:31] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:30:31] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-03 07:30:31] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 07:30:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:30:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 07:30:31] [INFO ] Implicit Places using invariants and state equation in 130 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-03 07:30:31] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-03 07:30:31] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 07:30:31] [INFO ] Invariant cache hit.
[2025-06-03 07:30:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 21 constraints, problems are : Problem set: 0 solved, 24 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 45 constraints, problems are : Problem set: 0 solved, 24 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1239ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/219 places, 25/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1518 ms. Remains : 19/219 places, 25/257 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-00
Product exploration explored 100000 steps with 907 reset in 449 ms.
Stack based approach found an accepted trace after 44 steps with 1 reset with depth 19 and stack size 19 in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-00 finished in 2399 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 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Graph (complete) has 436 edges and 219 vertex of which 216 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 215 transition count 222
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 184 transition count 222
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 63 place count 184 transition count 186
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 135 place count 148 transition count 186
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 141 transition count 178
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 141 transition count 178
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 154 place count 136 transition count 173
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 136 transition count 173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 163 place count 132 transition count 165
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 132 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 128 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 128 transition count 161
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 277 place count 77 transition count 110
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 287 place count 67 transition count 91
Iterating global reduction 2 with 10 rules applied. Total rules applied 297 place count 67 transition count 91
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 306 place count 58 transition count 81
Iterating global reduction 2 with 9 rules applied. Total rules applied 315 place count 58 transition count 81
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 324 place count 49 transition count 63
Iterating global reduction 2 with 9 rules applied. Total rules applied 333 place count 49 transition count 63
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 342 place count 40 transition count 54
Iterating global reduction 2 with 9 rules applied. Total rules applied 351 place count 40 transition count 54
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 360 place count 31 transition count 36
Iterating global reduction 2 with 9 rules applied. Total rules applied 369 place count 31 transition count 36
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 378 place count 22 transition count 27
Iterating global reduction 2 with 9 rules applied. Total rules applied 387 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 388 place count 21 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 390 place count 20 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 391 place count 20 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 392 place count 20 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 394 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 396 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 397 place count 16 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 397 place count 16 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 403 place count 13 transition count 17
Applied a total of 403 rules in 63 ms. Remains 13 /219 variables (removed 206) and now considering 17/257 (removed 240) transitions.
[2025-06-03 07:30:33] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2025-06-03 07:30:33] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:30:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-03 07:30:33] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2025-06-03 07:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:30:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 07:30:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:30:33] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-03 07:30:33] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2025-06-03 07:30:33] [INFO ] Invariant cache hit.
[2025-06-03 07:30:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 15/28 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 15 constraints, problems are : Problem set: 0 solved, 16 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 15/28 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 31 constraints, problems are : Problem set: 0 solved, 16 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 590ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/219 places, 17/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 727 ms. Remains : 13/219 places, 17/257 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-01
Product exploration explored 100000 steps with 785 reset in 184 ms.
Stack based approach found an accepted trace after 432 steps with 3 reset with depth 49 and stack size 39 in 2 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-01 finished in 962 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 X(p0))||F(G(p1))))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 208 transition count 245
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 208 transition count 245
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 202 transition count 239
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 202 transition count 239
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 196 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 196 transition count 232
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 191 transition count 225
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 191 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 186 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 186 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 182 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 180 transition count 212
Applied a total of 78 rules in 36 ms. Remains 180 /219 variables (removed 39) and now considering 212/257 (removed 45) transitions.
// Phase 1: matrix 212 rows 180 cols
[2025-06-03 07:30:34] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:30:34] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-03 07:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:30:34] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-03 07:30:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:42] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:42] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:42] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:42] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:42] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:42] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:42] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:43] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:43] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:43] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:30:43] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 193 constraints, problems are : Problem set: 0 solved, 211 unsolved in 21123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 27242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48424ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 48427ms
Starting structural reductions in LTL mode, iteration 1 : 180/219 places, 212/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48875 ms. Remains : 180/219 places, 212/257 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-02
Product exploration explored 100000 steps with 283 reset in 191 ms.
Stack based approach found an accepted trace after 63839 steps with 179 reset with depth 157 and stack size 156 in 384 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-02 finished in 49643 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((p0||(X(p1) U ((X(p1)&&G((!p2||X(p3))))||X(G(p1))))))))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 208 transition count 245
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 208 transition count 245
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 202 transition count 239
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 202 transition count 239
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 196 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 196 transition count 232
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 191 transition count 225
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 191 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 186 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 186 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 182 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 180 transition count 212
Applied a total of 78 rules in 40 ms. Remains 180 /219 variables (removed 39) and now considering 212/257 (removed 45) transitions.
[2025-06-03 07:31:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:31:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-03 07:31:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:31:24] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-03 07:31:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:32] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:32] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:32] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:32] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:32] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:32] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:33] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:33] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:33] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:33] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:31:33] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 193 constraints, problems are : Problem set: 0 solved, 211 unsolved in 22948 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 29492 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52496ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 52498ms
Starting structural reductions in LTL mode, iteration 1 : 180/219 places, 212/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52832 ms. Remains : 180/219 places, 212/257 transitions.
Stuttering acceptance computed with spot in 492 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p3) p2 (NOT p1)), (AND p2 (NOT p3)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 365 edges and 180 vertex of which 179 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/180 stabilizing places and 35/212 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p3 p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 28 ms. Reduced automaton from 10 states, 29 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-11b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-04 finished in 53833 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(p0))||F(p1)))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 209 transition count 246
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 209 transition count 246
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 204 transition count 241
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 204 transition count 241
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 199 transition count 235
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 199 transition count 235
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 195 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 195 transition count 229
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 191 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 191 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 188 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 188 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 187 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 187 transition count 220
Applied a total of 64 rules in 29 ms. Remains 187 /219 variables (removed 32) and now considering 220/257 (removed 37) transitions.
// Phase 1: matrix 220 rows 187 cols
[2025-06-03 07:32:17] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:17] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-03 07:32:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:32:18] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-03 07:32:18] [INFO ] Invariant cache hit.
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, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 220/407 variables, 187/189 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:28] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:28] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:28] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:28] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:28] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:28] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:29] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:29] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:29] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:29] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:32:29] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 11/200 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 200 constraints, problems are : Problem set: 0 solved, 219 unsolved in 26865 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 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, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/407 variables, 187/200 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 219/419 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/407 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 419 constraints, problems are : Problem set: 0 solved, 219 unsolved in 29849 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56768ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 56770ms
Starting structural reductions in LTL mode, iteration 1 : 187/219 places, 220/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57325 ms. Remains : 187/219 places, 220/257 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-05
Stuttering criterion allowed to conclude after 789 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-05 finished in 57504 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(p1) U X((G(p2)||G(F(!p3)))))&&p0)))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 208 transition count 245
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 208 transition count 245
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 202 transition count 239
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 202 transition count 239
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 196 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 196 transition count 232
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 191 transition count 225
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 191 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 186 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 186 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 182 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 182 transition count 214
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 180 transition count 212
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 180 transition count 212
Applied a total of 78 rules in 31 ms. Remains 180 /219 variables (removed 39) and now considering 212/257 (removed 45) transitions.
// Phase 1: matrix 212 rows 180 cols
[2025-06-03 07:33:15] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:33:15] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-03 07:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:33:15] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-03 07:33:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/392 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:24] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:25] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:25] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:25] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:25] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:25] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:25] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:26] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:26] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:26] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:33:26] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 11/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 193 constraints, problems are : Problem set: 0 solved, 211 unsolved in 24887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/392 variables, 180/193 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 211/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 20206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45143ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 45145ms
Starting structural reductions in LTL mode, iteration 1 : 180/219 places, 212/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45595 ms. Remains : 180/219 places, 212/257 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p0) (AND (NOT p2) p3)), (OR (NOT p0) (AND (NOT p2) p3)), true, (AND (NOT p2) p3), (AND (NOT p2) p3), p3, p3, (AND p3 (NOT p2)), (AND p3 (NOT p1) p2), (AND p3 (NOT p1) p2), (AND p3 (NOT p1) (NOT p2)), (AND (NOT p2) p3)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-06 finished in 46102 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(p1))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Graph (complete) has 436 edges and 219 vertex of which 216 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 215 transition count 223
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 185 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 184 transition count 222
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 63 place count 184 transition count 186
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 135 place count 148 transition count 186
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 141 place count 142 transition count 179
Iterating global reduction 3 with 6 rules applied. Total rules applied 147 place count 142 transition count 179
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 151 place count 138 transition count 175
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 138 transition count 175
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 135 transition count 170
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 135 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 163 place count 133 transition count 168
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 133 transition count 168
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 267 place count 82 transition count 117
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 275 place count 74 transition count 102
Iterating global reduction 3 with 8 rules applied. Total rules applied 283 place count 74 transition count 102
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 291 place count 66 transition count 92
Iterating global reduction 3 with 8 rules applied. Total rules applied 299 place count 66 transition count 92
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 307 place count 58 transition count 77
Iterating global reduction 3 with 8 rules applied. Total rules applied 315 place count 58 transition count 77
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 323 place count 50 transition count 68
Iterating global reduction 3 with 8 rules applied. Total rules applied 331 place count 50 transition count 68
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 339 place count 42 transition count 53
Iterating global reduction 3 with 8 rules applied. Total rules applied 347 place count 42 transition count 53
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 355 place count 34 transition count 44
Iterating global reduction 3 with 8 rules applied. Total rules applied 363 place count 34 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 365 place count 32 transition count 41
Iterating global reduction 3 with 2 rules applied. Total rules applied 367 place count 32 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 368 place count 31 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 369 place count 31 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 370 place count 31 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 31 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 373 place count 29 transition count 37
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 33 edges and 27 vertex of which 24 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
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 3 with 8 rules applied. Total rules applied 381 place count 24 transition count 29
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 387 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 18 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 396 place count 14 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 398 place count 14 transition count 22
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 401 place count 11 transition count 19
Applied a total of 401 rules in 56 ms. Remains 11 /219 variables (removed 208) and now considering 19/257 (removed 238) transitions.
[2025-06-03 07:34:01] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 11 cols
[2025-06-03 07:34:01] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:34:01] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 07:34:01] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2025-06-03 07:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:34:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:34:01] [INFO ] Redundant transitions in 1 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 07:34:01] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2025-06-03 07:34:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/25 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/26 variables, and 11 constraints, problems are : Problem set: 0 solved, 12 unsolved in 183 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/25 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/26 variables, and 23 constraints, problems are : Problem set: 0 solved, 12 unsolved in 187 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 375ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/219 places, 19/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 11/219 places, 19/257 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-07 finished in 604 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((p0&&G(p1)&&X(p2))) U X(X(!p2))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 209 transition count 246
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 209 transition count 246
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 203 transition count 240
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 203 transition count 240
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 198 transition count 234
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 198 transition count 234
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 194 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 194 transition count 229
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 191 transition count 225
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 191 transition count 225
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 189 transition count 223
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 189 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 188 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 188 transition count 222
Applied a total of 62 rules in 20 ms. Remains 188 /219 variables (removed 31) and now considering 222/257 (removed 35) transitions.
// Phase 1: matrix 222 rows 188 cols
[2025-06-03 07:34:02] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:34:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-03 07:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:34:02] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-06-03 07:34:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/410 variables, 188/190 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:08] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:08] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:08] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:09] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 11/201 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/410 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 201 constraints, problems are : Problem set: 0 solved, 221 unsolved in 18199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/410 variables, 188/201 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 221/422 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/410 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 422 constraints, problems are : Problem set: 0 solved, 221 unsolved in 19768 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38014ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 38015ms
Starting structural reductions in LTL mode, iteration 1 : 188/219 places, 222/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38389 ms. Remains : 188/219 places, 222/257 transitions.
Stuttering acceptance computed with spot in 520 ms :[p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p1) p2), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-08
Stuttering criterion allowed to conclude after 317 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-08 finished in 38941 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 p1)&&p2) U G(!p0)) U X(!p2)))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 210 transition count 248
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 210 transition count 248
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 205 transition count 243
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 205 transition count 243
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 200 transition count 237
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 200 transition count 237
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 195 transition count 230
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 195 transition count 230
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 190 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 190 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 186 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 186 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 184 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 184 transition count 217
Applied a total of 70 rules in 23 ms. Remains 184 /219 variables (removed 35) and now considering 217/257 (removed 40) transitions.
// Phase 1: matrix 217 rows 184 cols
[2025-06-03 07:34:40] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:34:41] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-03 07:34:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:34:41] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-03 07:34:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/401 variables, 184/186 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:47] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:47] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:47] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:47] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:47] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:47] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:47] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:48] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:48] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:48] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:34:48] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 11/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 197 constraints, problems are : Problem set: 0 solved, 216 unsolved in 17367 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 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/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/401 variables, 184/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 216/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 413 constraints, problems are : Problem set: 0 solved, 216 unsolved in 19619 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37025ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 37026ms
Starting structural reductions in LTL mode, iteration 1 : 184/219 places, 217/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37378 ms. Remains : 184/219 places, 217/257 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-09
Product exploration explored 100000 steps with 33354 reset in 130 ms.
Product exploration explored 100000 steps with 33207 reset in 258 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 372 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (AND p2 p1)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (OR (AND p2 p1) (NOT p0))), (X (NOT p0)), (X (OR (AND p2 p1) (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (OR (AND p2 p1) (NOT p0)))), (X (X (NOT p0))), (X (X (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 247 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 507 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p2) p1), false]
RANDOM walk for 40000 steps (111 resets) in 733 ms. (54 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40003 steps (20 resets) in 143 ms. (277 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (17 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2025-06-03 07:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 92/103 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/107 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 241/348 variables, 125/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 44/392 variables, 34/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:20] [INFO ] Deduced a trap along path composed of 4 places in 41 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 401/401 variables, and 187 constraints, problems are : Problem set: 2 solved, 0 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 323ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (AND p2 p1)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p2), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (OR (AND p2 p1) (NOT p0))), (X (NOT p0)), (X (OR (AND p2 p1) (AND (NOT p0) p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (OR (AND p2 p1) (NOT p0)))), (X (X (NOT p0))), (X (X (OR (AND p2 p1) (AND (NOT p0) p1)))), (X (X p1)), (G (OR p1 p2 (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p0))), (F (NOT (OR (NOT p1) p2 p0))), (F p0), (F (NOT (OR p2 p0))), (F (NOT (AND p2 (NOT p0)))), (F (NOT p2)), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p1 p2))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 505 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter insensitive) to 13 states, 39 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 505 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p2) p1), false, false, false]
Stuttering acceptance computed with spot in 502 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p2) p1), false, false, false]
Support contains 3 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 217/217 transitions.
Graph (complete) has 372 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 182 transition count 192
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 159 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 158 transition count 191
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 49 place count 158 transition count 155
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 121 place count 122 transition count 155
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 211 place count 77 transition count 110
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 220 place count 68 transition count 92
Iterating global reduction 3 with 9 rules applied. Total rules applied 229 place count 68 transition count 92
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 237 place count 60 transition count 84
Iterating global reduction 3 with 8 rules applied. Total rules applied 245 place count 60 transition count 84
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 253 place count 52 transition count 68
Iterating global reduction 3 with 8 rules applied. Total rules applied 261 place count 52 transition count 68
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 269 place count 44 transition count 60
Iterating global reduction 3 with 8 rules applied. Total rules applied 277 place count 44 transition count 60
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 285 place count 36 transition count 44
Iterating global reduction 3 with 8 rules applied. Total rules applied 293 place count 36 transition count 44
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 301 place count 28 transition count 36
Iterating global reduction 3 with 8 rules applied. Total rules applied 309 place count 28 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 310 place count 28 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 312 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 29 edges and 24 vertex of which 21 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
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 3 with 8 rules applied. Total rules applied 320 place count 21 transition count 25
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 326 place count 16 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 332 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 13 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 336 place count 10 transition count 17
Applied a total of 336 rules in 29 ms. Remains 10 /184 variables (removed 174) and now considering 17/217 (removed 200) transitions.
[2025-06-03 07:35:22] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 10 cols
[2025-06-03 07:35:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:35:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-03 07:35:22] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2025-06-03 07:35:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:35:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:35:22] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 07:35:22] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2025-06-03 07:35:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 10 constraints, problems are : Problem set: 0 solved, 9 unsolved in 150 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/23 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 147 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 301ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/184 places, 17/217 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 387 ms. Remains : 10/184 places, 17/217 transitions.
Computed a total of 6 stabilizing places and 9 stable transitions
Graph (complete) has 13 edges and 10 vertex of which 8 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 9 stable transitions
Detected a total of 6/10 stabilizing places and 9/17 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (AND p1 p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 610 ms. Reduced automaton from 13 states, 39 edges and 3 AP (stutter insensitive) to 13 states, 39 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 497 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false, false, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1), false, false, false, false]
RANDOM walk for 40008 steps (1464 resets) in 143 ms. (277 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (410 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (412 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2025-06-03 07:35:23] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2025-06-03 07:35:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/18 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 23/24 variables, and 10 constraints, problems are : Problem set: 2 solved, 0 unsolved in 45 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (AND p1 p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p2)), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 (NOT p0) (NOT p1))), (G (OR p2 (NOT p0) p1))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F p0), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p2 p1))), (F (NOT (AND p2 (NOT p0)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) p0 p1)))]
Knowledge based reduction with 23 factoid took 1137 ms. Reduced automaton from 13 states, 39 edges and 3 AP (stutter insensitive) to 13 states, 39 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 495 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 496 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 497 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1), false, false, false, false, false, false]
Stuttering criterion allowed to conclude after 136 steps with 5 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-09 finished in 45404 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(X(X(X(F(p0)))))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 208 transition count 245
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 208 transition count 245
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 203 transition count 240
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 203 transition count 240
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 198 transition count 234
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 198 transition count 234
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 194 transition count 228
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 194 transition count 228
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 190 transition count 223
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 190 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 187 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 187 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 186 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 186 transition count 219
Applied a total of 66 rules in 19 ms. Remains 186 /219 variables (removed 33) and now considering 219/257 (removed 38) transitions.
// Phase 1: matrix 219 rows 186 cols
[2025-06-03 07:35:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:35:26] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-03 07:35:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:35:26] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-03 07:35:26] [INFO ] Invariant cache hit.
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, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/405 variables, 186/188 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:32] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:33] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:35:34] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 11/199 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/405 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 199 constraints, problems are : Problem set: 0 solved, 218 unsolved in 17756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 11/11 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/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/405 variables, 186/199 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 218/417 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 417 constraints, problems are : Problem set: 0 solved, 218 unsolved in 19047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36878ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 36879ms
Starting structural reductions in LTL mode, iteration 1 : 186/219 places, 219/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37300 ms. Remains : 186/219 places, 219/257 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-12
Stuttering criterion allowed to conclude after 658 steps with 1 reset in 7 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-12 finished in 37528 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(((p0 U G(p1))&&X(G(p2)))))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 257/257 transitions.
Graph (complete) has 436 edges and 219 vertex of which 217 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 216 transition count 223
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 185 transition count 223
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 63 place count 185 transition count 188
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 133 place count 150 transition count 188
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 138 place count 145 transition count 182
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 145 transition count 182
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 142 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 142 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 140 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 140 transition count 175
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 138 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 138 transition count 173
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 261 place count 86 transition count 121
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 269 place count 78 transition count 106
Iterating global reduction 2 with 8 rules applied. Total rules applied 277 place count 78 transition count 106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 285 place count 70 transition count 97
Iterating global reduction 2 with 8 rules applied. Total rules applied 293 place count 70 transition count 97
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 301 place count 62 transition count 81
Iterating global reduction 2 with 8 rules applied. Total rules applied 309 place count 62 transition count 81
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 317 place count 54 transition count 73
Iterating global reduction 2 with 8 rules applied. Total rules applied 325 place count 54 transition count 73
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 333 place count 46 transition count 57
Iterating global reduction 2 with 8 rules applied. Total rules applied 341 place count 46 transition count 57
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 349 place count 38 transition count 49
Iterating global reduction 2 with 8 rules applied. Total rules applied 357 place count 38 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 358 place count 37 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 37 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 360 place count 36 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 361 place count 36 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 364 place count 36 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 36 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 367 place count 34 transition count 41
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 371 place count 33 transition count 38
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 374 place count 30 transition count 38
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 374 place count 30 transition count 32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 386 place count 24 transition count 32
Applied a total of 386 rules in 30 ms. Remains 24 /219 variables (removed 195) and now considering 32/257 (removed 225) transitions.
[2025-06-03 07:36:03] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2025-06-03 07:36:03] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:36:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 07:36:03] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2025-06-03 07:36:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:36:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 07:36:04] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:36:04] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
[2025-06-03 07:36:04] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2025-06-03 07:36:04] [INFO ] Invariant cache hit.
[2025-06-03 07:36:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/51 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 26 constraints, problems are : Problem set: 0 solved, 31 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 27/51 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 31/57 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 31 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1410ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1411ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/219 places, 32/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1558 ms. Remains : 24/219 places, 32/257 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLFireability-15
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLFireability-15 finished in 1791 ms.
All properties solved by simple procedures.
Total runtime 398322 ms.
BK_STOP 1748936165713
--------------------
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="DiscoveryGPU-PT-11b"
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 DiscoveryGPU-PT-11b, 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 r058-smll-174854064600700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11b.tgz
mv DiscoveryGPU-PT-11b 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 ;