About the Execution of ITS-Tools for DiscoveryGPU-PT-13b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFF?FFFFFFTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064700732.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-13b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064700732
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 97K 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-13b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748948263713
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-13b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 10:57:46] [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 10:57:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 10:57:46] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-06-03 10:57:46] [INFO ] Transformed 380 places.
[2025-06-03 10:57:46] [INFO ] Transformed 404 transitions.
[2025-06-03 10:57:46] [INFO ] Found NUPN structural information;
[2025-06-03 10:57:46] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 89 place count 291 transition count 341
Iterating global reduction 1 with 63 rules applied. Total rules applied 152 place count 291 transition count 341
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 165 place count 278 transition count 328
Iterating global reduction 1 with 13 rules applied. Total rules applied 178 place count 278 transition count 328
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 188 place count 268 transition count 318
Iterating global reduction 1 with 10 rules applied. Total rules applied 198 place count 268 transition count 318
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 206 place count 260 transition count 310
Iterating global reduction 1 with 8 rules applied. Total rules applied 214 place count 260 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 221 place count 253 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 228 place count 253 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 234 place count 247 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 240 place count 247 transition count 290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 246 place count 241 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 252 place count 241 transition count 284
Applied a total of 252 rules in 230 ms. Remains 241 /380 variables (removed 139) and now considering 284/404 (removed 120) transitions.
// Phase 1: matrix 284 rows 241 cols
[2025-06-03 10:57:47] [INFO ] Computed 2 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:57:47] [INFO ] Implicit Places using invariants in 493 ms returned []
[2025-06-03 10:57:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:57:47] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2025-06-03 10:57:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/525 variables, 241/243 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:01] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:02] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:02] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:02] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:02] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:03] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:03] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:03] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:03] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:03] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:04] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:04] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:04] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 13/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 256 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/525 variables, 241/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 283/539 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:58:28] [INFO ] Deduced a trap composed of 156 places in 132 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 540 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 241/380 places, 284/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61520 ms. Remains : 241/380 places, 284/404 transitions.
Support contains 33 out of 241 places after structural reductions.
[2025-06-03 10:58:48] [INFO ] Flatten gal took : 137 ms
[2025-06-03 10:58:48] [INFO ] Flatten gal took : 62 ms
[2025-06-03 10:58:49] [INFO ] Input system was already deterministic with 284 transitions.
RANDOM walk for 21426 steps (48 resets) in 991 ms. (21 steps per ms) remains 0/30 properties
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 482 edges and 241 vertex of which 237 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 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(F(p1))))))'
Support contains 2 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 232 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 232 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 226 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 226 transition count 267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 221 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 221 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 217 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 217 transition count 257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 214 transition count 252
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 214 transition count 252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 212 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 212 transition count 250
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 210 transition count 248
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 210 transition count 248
Applied a total of 62 rules in 50 ms. Remains 210 /241 variables (removed 31) and now considering 248/284 (removed 36) transitions.
// Phase 1: matrix 248 rows 210 cols
[2025-06-03 10:58:50] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:58:50] [INFO ] Implicit Places using invariants in 310 ms returned []
[2025-06-03 10:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:58:50] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-03 10:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:01] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:01] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:01] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:02] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:02] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:02] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:02] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:02] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:02] [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 10:59:03] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:03] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:03] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 10:59:03] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 13/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 225 constraints, problems are : Problem set: 0 solved, 247 unsolved in 28648 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 472 constraints, problems are : Problem set: 0 solved, 247 unsolved in 28861 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57667ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 57671ms
Starting structural reductions in LTL mode, iteration 1 : 210/241 places, 248/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58644 ms. Remains : 210/241 places, 248/284 transitions.
Stuttering acceptance computed with spot in 410 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-00 finished in 59144 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 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 482 edges and 241 vertex of which 237 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 236 transition count 246
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 203 transition count 246
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 67 place count 203 transition count 203
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 153 place count 160 transition count 203
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 160 place count 153 transition count 195
Iterating global reduction 2 with 7 rules applied. Total rules applied 167 place count 153 transition count 195
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 149 transition count 190
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 149 transition count 190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 178 place count 146 transition count 185
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 146 transition count 185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 183 place count 144 transition count 183
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 144 transition count 183
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 295 place count 89 transition count 128
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 307 place count 77 transition count 105
Iterating global reduction 2 with 12 rules applied. Total rules applied 319 place count 77 transition count 105
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 331 place count 65 transition count 92
Iterating global reduction 2 with 12 rules applied. Total rules applied 343 place count 65 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 355 place count 53 transition count 68
Iterating global reduction 2 with 12 rules applied. Total rules applied 367 place count 53 transition count 68
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 379 place count 41 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 391 place count 41 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 403 place count 29 transition count 32
Iterating global reduction 2 with 12 rules applied. Total rules applied 415 place count 29 transition count 32
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 426 place count 18 transition count 21
Iterating global reduction 2 with 11 rules applied. Total rules applied 437 place count 18 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 438 place count 17 transition count 19
Iterating global reduction 2 with 1 rules applied. Total rules applied 439 place count 17 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 440 place count 16 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 441 place count 16 transition count 18
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 442 place count 16 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 444 place count 14 transition count 15
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 446 place count 13 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 447 place count 12 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 447 place count 12 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 451 place count 10 transition count 12
Applied a total of 451 rules in 150 ms. Remains 10 /241 variables (removed 231) and now considering 12/284 (removed 272) transitions.
[2025-06-03 10:59:49] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 10 cols
[2025-06-03 10:59:49] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:59:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-03 10:59:49] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2025-06-03 10:59:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:59:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 10:59:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 10:59:49] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2025-06-03 10:59:49] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
[2025-06-03 10:59:49] [INFO ] Invariant cache hit.
[2025-06-03 10:59:49] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/20 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/20 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 542ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/241 places, 12/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 790 ms. Remains : 10/241 places, 12/284 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-01
Product exploration explored 100000 steps with 665 reset in 594 ms.
Stack based approach found an accepted trace after 320 steps with 2 reset with depth 5 and stack size 5 in 3 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-01 finished in 1441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U p1))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 232 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 232 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 226 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 226 transition count 267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 221 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 221 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 217 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 217 transition count 257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 214 transition count 252
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 214 transition count 252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 212 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 212 transition count 250
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 210 transition count 248
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 210 transition count 248
Applied a total of 62 rules in 58 ms. Remains 210 /241 variables (removed 31) and now considering 248/284 (removed 36) transitions.
// Phase 1: matrix 248 rows 210 cols
[2025-06-03 10:59:50] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:59:50] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-03 10:59:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 10:59:51] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-03 10:59:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:00] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:00] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:01] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:01] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:01] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:01] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:01] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:01] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:01] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:02] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:02] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:02] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:00:02] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 13/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 225 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 472 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 210/241 places, 248/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60658 ms. Remains : 210/241 places, 248/284 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-02 finished in 60850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 482 edges and 241 vertex of which 237 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 236 transition count 249
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 206 transition count 247
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 204 transition count 247
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 65 place count 204 transition count 203
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 153 place count 160 transition count 203
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 160 place count 153 transition count 195
Iterating global reduction 3 with 7 rules applied. Total rules applied 167 place count 153 transition count 195
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 171 place count 149 transition count 190
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 149 transition count 190
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 178 place count 146 transition count 185
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 146 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 144 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 144 transition count 183
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 291 place count 91 transition count 130
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 302 place count 80 transition count 109
Iterating global reduction 3 with 11 rules applied. Total rules applied 313 place count 80 transition count 109
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 323 place count 70 transition count 98
Iterating global reduction 3 with 10 rules applied. Total rules applied 333 place count 70 transition count 98
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 343 place count 60 transition count 78
Iterating global reduction 3 with 10 rules applied. Total rules applied 353 place count 60 transition count 78
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 363 place count 50 transition count 68
Iterating global reduction 3 with 10 rules applied. Total rules applied 373 place count 50 transition count 68
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 383 place count 40 transition count 48
Iterating global reduction 3 with 10 rules applied. Total rules applied 393 place count 40 transition count 48
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 403 place count 30 transition count 38
Iterating global reduction 3 with 10 rules applied. Total rules applied 413 place count 30 transition count 38
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 414 place count 30 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 416 place count 28 transition count 35
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 3 with 2 rules applied. Total rules applied 418 place count 27 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 419 place count 26 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 419 place count 26 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 427 place count 22 transition count 30
Applied a total of 427 rules in 49 ms. Remains 22 /241 variables (removed 219) and now considering 30/284 (removed 254) transitions.
[2025-06-03 11:00:51] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
// Phase 1: matrix 27 rows 22 cols
[2025-06-03 11:00:51] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:00:51] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-03 11:00:51] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
[2025-06-03 11:00:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:00:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 11:00:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:00:51] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
[2025-06-03 11:00:51] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
[2025-06-03 11:00:51] [INFO ] Invariant cache hit.
[2025-06-03 11:00:51] [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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 27/49 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 24 constraints, problems are : Problem set: 0 solved, 29 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 27/49 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 29/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 53 constraints, problems are : Problem set: 0 solved, 29 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1623ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 1623ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/241 places, 30/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1820 ms. Remains : 22/241 places, 30/284 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-03
Stuttering criterion allowed to conclude after 21958 steps with 1048 reset in 88 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-03 finished in 2079 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(p0)&&X(X(F((p1&&X(p2))))))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 232 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 232 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 226 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 226 transition count 267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 221 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 221 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 217 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 217 transition count 257
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 215 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 214 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 213 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 213 transition count 252
Applied a total of 56 rules in 45 ms. Remains 213 /241 variables (removed 28) and now considering 252/284 (removed 32) transitions.
// Phase 1: matrix 252 rows 213 cols
[2025-06-03 11:00:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:00:53] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-03 11:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:00:53] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-03 11:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (OVERLAPS) 252/465 variables, 213/215 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:03] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:04] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:04] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:04] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:04] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:04] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:05] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:05] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:05] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:05] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:05] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:05] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:01:05] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 13/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/465 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 228 constraints, problems are : Problem set: 0 solved, 251 unsolved in 29828 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/465 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 251/479 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/465 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 479 constraints, problems are : Problem set: 0 solved, 251 unsolved in 29769 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59676ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 59677ms
Starting structural reductions in LTL mode, iteration 1 : 213/241 places, 252/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60120 ms. Remains : 213/241 places, 252/284 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-04
Product exploration explored 100000 steps with 981 reset in 422 ms.
Product exploration explored 100000 steps with 996 reset in 546 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 433 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (93 resets) in 390 ms. (102 steps per ms) remains 2/9 properties
BEST_FIRST walk for 13470 steps (2 resets) in 103 ms. (129 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 366 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 283 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 252/252 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2025-06-03 11:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:01:56] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-03 11:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:01:56] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-03 11:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (OVERLAPS) 252/465 variables, 213/215 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:07] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:07] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:08] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:08] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:08] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:08] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:08] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:08] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:08] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:09] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:09] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:09] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:02:09] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 13/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/465 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 228 constraints, problems are : Problem set: 0 solved, 251 unsolved in 28893 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/465 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 251/479 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 7 (OVERLAPS) 0/465 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 479 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58949ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 58950ms
Finished structural reductions in LTL mode , in 1 iterations and 59429 ms. Remains : 213/213 places, 252/252 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 433 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 30453 steps (68 resets) in 299 ms. (101 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 466 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1006 reset in 347 ms.
Product exploration explored 100000 steps with 973 reset in 491 ms.
Built C files in :
/tmp/ltsmin11498214625701214982
[2025-06-03 11:02:59] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11498214625701214982
Running compilation step : cd /tmp/ltsmin11498214625701214982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 837 ms.
Running link step : cd /tmp/ltsmin11498214625701214982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin11498214625701214982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13047395770210561513.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 252/252 transitions.
Applied a total of 0 rules in 3 ms. Remains 213 /213 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2025-06-03 11:03:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:03:14] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-03 11:03:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:03:14] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-03 11:03:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (OVERLAPS) 252/465 variables, 213/215 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:26] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:27] [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 11:03:27] [INFO ] Deduced a trap composed of 9 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 11:03:27] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:27] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:27] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:27] [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 11:03:28] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:28] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:28] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:28] [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 11:03:28] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:03:28] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 13/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/465 variables, and 228 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 252/465 variables, 213/228 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 251/479 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 479 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Finished structural reductions in LTL mode , in 1 iterations and 60528 ms. Remains : 213/213 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin10496399852426020576
[2025-06-03 11:04:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10496399852426020576
Running compilation step : cd /tmp/ltsmin10496399852426020576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 933 ms.
Running link step : cd /tmp/ltsmin10496399852426020576;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin10496399852426020576;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4434139123000228380.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 11:04:29] [INFO ] Flatten gal took : 19 ms
[2025-06-03 11:04:29] [INFO ] Flatten gal took : 17 ms
[2025-06-03 11:04:29] [INFO ] Time to serialize gal into /tmp/LTL12389258432246768318.gal : 6 ms
[2025-06-03 11:04:30] [INFO ] Time to serialize properties into /tmp/LTL17338538778303646478.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12389258432246768318.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3315526948277075519.hoa' '-atoms' '/tmp/LTL17338538778303646478.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17338538778303646478.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3315526948277075519.hoa
Detected timeout of ITS tools.
[2025-06-03 11:04:45] [INFO ] Flatten gal took : 19 ms
[2025-06-03 11:04:45] [INFO ] Flatten gal took : 18 ms
[2025-06-03 11:04:45] [INFO ] Time to serialize gal into /tmp/LTL17590046102130268858.gal : 8 ms
[2025-06-03 11:04:45] [INFO ] Time to serialize properties into /tmp/LTL13420383555223295046.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17590046102130268858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13420383555223295046.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(F("(p117!=1)")))||((F("(p117!=1)"))&&(X(X(F(("(p49!=1)")&&(X("((p118==1)&&(p371==1))")))))))))
Formula 0 simplified : FG!"(p117!=1)" & (G!"(p117!=1)" | XXG(!"(p49!=1)" | X!"((p118==1)&&(p371==1))"))
Detected timeout of ITS tools.
[2025-06-03 11:05:00] [INFO ] Flatten gal took : 15 ms
[2025-06-03 11:05:00] [INFO ] Applying decomposition
[2025-06-03 11:05:00] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2190070304365690074.txt' '-o' '/tmp/graph2190070304365690074.bin' '-w' '/tmp/graph2190070304365690074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2190070304365690074.bin' '-l' '-1' '-v' '-w' '/tmp/graph2190070304365690074.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:05:00] [INFO ] Decomposing Gal with order
[2025-06-03 11:05:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:05:00] [INFO ] Removed a total of 102 redundant transitions.
[2025-06-03 11:05:00] [INFO ] Flatten gal took : 80 ms
[2025-06-03 11:05:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 11 ms.
[2025-06-03 11:05:00] [INFO ] Time to serialize gal into /tmp/LTL17891309318276673620.gal : 9 ms
[2025-06-03 11:05:00] [INFO ] Time to serialize properties into /tmp/LTL4091650443533871815.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17891309318276673620.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4091650443533871815.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i10.u26.p117!=1)")))||((F("(i10.u26.p117!=1)"))&&(X(X(F(("(i3.u8.p49!=1)")&&(X("((i10.u26.p118==1)&&(u76.p371==1))")))))))))
Formula 0 simplified : FG!"(i10.u26.p117!=1)" & (G!"(i10.u26.p117!=1)" | XXG(!"(i3.u8.p49!=1)" | X!"((i10.u26.p118==1)&&(u76.p371==1))"))
Detected timeout of ITS tools.
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-04 finished in 262108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(!((F(p0) U X(!X(F(p1))))||p0)) U p2))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 232 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 232 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 226 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 226 transition count 267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 221 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 221 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 217 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 217 transition count 257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 214 transition count 252
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 214 transition count 252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 212 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 212 transition count 250
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 210 transition count 248
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 210 transition count 248
Applied a total of 62 rules in 22 ms. Remains 210 /241 variables (removed 31) and now considering 248/284 (removed 36) transitions.
// Phase 1: matrix 248 rows 210 cols
[2025-06-03 11:05:15] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:05:15] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-03 11:05:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:05:16] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-03 11:05:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:26] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:27] [INFO ] Deduced a trap composed of 8 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 11:05:27] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:27] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:27] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:27] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:27] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:28] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:28] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:28] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:28] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:28] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:05:29] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 13/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/458 variables, and 225 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 472 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Starting structural reductions in LTL mode, iteration 1 : 210/241 places, 248/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60764 ms. Remains : 210/241 places, 248/284 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-05
Product exploration explored 100000 steps with 18133 reset in 181 ms.
Product exploration explored 100000 steps with 18231 reset in 212 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 427 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 108 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 670 steps (0 resets) in 7 ms. (83 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
[2025-06-03 11:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 11:06:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 11:06:19] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2025-06-03 11:06:19] [INFO ] Computed and/alt/rep : 242/351/242 causal constraints (skipped 5 transitions) in 25 ms.
[2025-06-03 11:06:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 11:06:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 11:06:19] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2025-06-03 11:06:19] [INFO ] Computed and/alt/rep : 242/351/242 causal constraints (skipped 5 transitions) in 30 ms.
[2025-06-03 11:06:21] [INFO ] Added : 154 causal constraints over 31 iterations in 1428 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2025-06-03 11:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:06:21] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-03 11:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:06:21] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-03 11:06: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/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:32] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:32] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:32] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:32] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:32] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:33] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:33] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:33] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:33] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:33] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:33] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:34] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:06:34] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 13/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 225 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 472 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Finished structural reductions in LTL mode , in 1 iterations and 60708 ms. Remains : 210/210 places, 248/248 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 427 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 721 steps (0 resets) in 11 ms. (60 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p0 (NOT p1)))), (F p0)]
Knowledge based reduction with 6 factoid took 223 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
[2025-06-03 11:07:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 11:07:23] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 11:07:23] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2025-06-03 11:07:23] [INFO ] Computed and/alt/rep : 242/351/242 causal constraints (skipped 5 transitions) in 26 ms.
[2025-06-03 11:07:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 11:07:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 11:07:24] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2025-06-03 11:07:24] [INFO ] Computed and/alt/rep : 242/351/242 causal constraints (skipped 5 transitions) in 26 ms.
[2025-06-03 11:07:25] [INFO ] Added : 154 causal constraints over 31 iterations in 1008 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 18174 reset in 184 ms.
Product exploration explored 100000 steps with 18282 reset in 124 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 248/248 transitions.
Graph (complete) has 427 edges and 210 vertex of which 209 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 209 transition count 247
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 27 place count 209 transition count 247
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 67 place count 209 transition count 247
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 97 place count 209 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 207 transition count 258
Deduced a syphon composed of 94 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 207 transition count 258
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 127 place count 207 transition count 310
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 139 place count 195 transition count 286
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 151 place count 195 transition count 286
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 187 place count 159 transition count 226
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 223 place count 159 transition count 226
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 258 place count 124 transition count 168
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 293 place count 124 transition count 168
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 304 place count 113 transition count 157
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 315 place count 113 transition count 157
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 336 place count 92 transition count 126
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 357 place count 92 transition count 126
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 397 place count 52 transition count 66
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 437 place count 52 transition count 66
Deduced a syphon composed of 31 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 439 place count 52 transition count 64
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 439 rules in 109 ms. Remains 52 /210 variables (removed 158) and now considering 64/248 (removed 184) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:07:26] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-03 11:07:26] [INFO ] Flow matrix only has 62 transitions (discarded 2 similar events)
// Phase 1: matrix 62 rows 52 cols
[2025-06-03 11:07:26] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 11:07:26] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 4 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:27] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 60 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 4 (OVERLAPS) 62/114 variables, 52/56 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 6/62 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/62 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/62 constraints. Problems are: Problem set: 39 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 62 constraints, problems are : Problem set: 39 solved, 24 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/24 variables, 2/2 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 2/4 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 61/85 variables, 24/28 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 6/34 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 24/58 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/58 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 29/114 variables, 28/86 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/86 constraints. Problems are: Problem set: 39 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/114 variables, 0/86 constraints. Problems are: Problem set: 39 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 86 constraints, problems are : Problem set: 39 solved, 24 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 24/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3061ms problems are : Problem set: 39 solved, 24 unsolved
Search for dead transitions found 39 dead transitions in 3063ms
Found 39 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/210 places, 25/248 transitions.
Graph (complete) has 56 edges and 52 vertex of which 21 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 21 /52 variables (removed 31) and now considering 25/25 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/210 places, 25/248 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3185 ms. Remains : 21/210 places, 25/248 transitions.
Built C files in :
/tmp/ltsmin4385658821555366914
[2025-06-03 11:07:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4385658821555366914
Running compilation step : cd /tmp/ltsmin4385658821555366914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 819 ms.
Running link step : cd /tmp/ltsmin4385658821555366914;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4385658821555366914;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10171569280492175029.hoa' '--buchi-type=spotba'
LTSmin run took 140 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-05 finished in 135381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F((p1||G(p2)))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 277
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 235 transition count 277
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 232 transition count 274
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 232 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 229 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 229 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 227 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 227 transition count 269
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 225 transition count 265
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 225 transition count 265
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 223 transition count 263
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 223 transition count 263
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 221 transition count 261
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 221 transition count 261
Applied a total of 40 rules in 33 ms. Remains 221 /241 variables (removed 20) and now considering 261/284 (removed 23) transitions.
// Phase 1: matrix 261 rows 221 cols
[2025-06-03 11:07:30] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:07:31] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-03 11:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:07:31] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2025-06-03 11:07:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/482 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:41] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:41] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:41] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:42] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:42] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:42] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:42] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:42] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:42] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:42] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:43] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:43] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:07:43] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 13/236 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 236 constraints, problems are : Problem set: 0 solved, 260 unsolved in 29878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/482 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 260/496 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 496 constraints, problems are : Problem set: 0 solved, 260 unsolved in 28883 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58826ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 58827ms
Starting structural reductions in LTL mode, iteration 1 : 221/241 places, 261/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59298 ms. Remains : 221/241 places, 261/284 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-06
Stuttering criterion allowed to conclude after 1433 steps with 3 reset in 7 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-06 finished in 59499 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)&&((!p1&&X(p1)&&F(p2))||X(G(p1)))))'
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 233 transition count 275
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 233 transition count 275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 227 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 227 transition count 268
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 222 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 222 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 218 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 218 transition count 258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 215 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 215 transition count 253
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 213 transition count 251
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 213 transition count 251
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 211 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 211 transition count 249
Applied a total of 60 rules in 54 ms. Remains 211 /241 variables (removed 30) and now considering 249/284 (removed 35) transitions.
// Phase 1: matrix 249 rows 211 cols
[2025-06-03 11:08:30] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:08:30] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-03 11:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:08:31] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-03 11:08:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 249/460 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:40] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:40] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:40] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:40] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:40] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:40] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:41] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:41] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:41] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:41] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:41] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:41] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:08:42] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 13/226 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 226 constraints, problems are : Problem set: 0 solved, 248 unsolved in 26947 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/460 variables, 211/226 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 248/474 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 474 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57035ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 57037ms
Starting structural reductions in LTL mode, iteration 1 : 211/241 places, 249/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57680 ms. Remains : 211/241 places, 249/284 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-09 finished in 58021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 232 transition count 274
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 232 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 226 transition count 267
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 226 transition count 267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 221 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 221 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 217 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 217 transition count 257
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 214 transition count 252
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 214 transition count 252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 212 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 212 transition count 250
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 210 transition count 248
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 210 transition count 248
Applied a total of 62 rules in 20 ms. Remains 210 /241 variables (removed 31) and now considering 248/284 (removed 36) transitions.
// Phase 1: matrix 248 rows 210 cols
[2025-06-03 11:09:28] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:09:28] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-03 11:09:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:09:28] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2025-06-03 11:09:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 248/458 variables, 210/212 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:39] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:39] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:39] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:39] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:40] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:40] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:40] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:40] [INFO ] Deduced a trap composed of 14 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 11:09:40] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:40] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:41] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:41] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:09:41] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 13/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/458 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 225 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/458 variables, 210/225 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 247/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 472 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 210/241 places, 248/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60547 ms. Remains : 210/241 places, 248/284 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 258 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-10 finished in 60730 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(p0)))))||(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 234 transition count 276
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 234 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 229 transition count 270
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 229 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 225 transition count 265
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 225 transition count 265
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 222 transition count 262
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 222 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 220 transition count 259
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 220 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 219 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 219 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 218 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 218 transition count 257
Applied a total of 46 rules in 32 ms. Remains 218 /241 variables (removed 23) and now considering 257/284 (removed 27) transitions.
// Phase 1: matrix 257 rows 218 cols
[2025-06-03 11:10:29] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:10:29] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-03 11:10:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:10:29] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-03 11:10: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/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/475 variables, 218/220 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 11:10:41] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:41] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:41] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:41] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:41] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:42] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:42] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:42] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:42] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:42] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:43] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:43] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:10:43] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/475 variables, and 233 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 13/13 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/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/475 variables, 218/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 256/489 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 11:11:07] [INFO ] Deduced a trap composed of 135 places in 179 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 490 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 218/241 places, 257/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60683 ms. Remains : 218/241 places, 257/284 transitions.
Stuttering acceptance computed with spot in 1275 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-11
Product exploration explored 100000 steps with 16666 reset in 222 ms.
Product exploration explored 100000 steps with 16666 reset in 202 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 441 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Detected a total of 41/218 stabilizing places and 41/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 394 ms. Reduced automaton from 24 states, 61 edges and 3 AP (stutter sensitive) to 16 states, 37 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 583 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (94 resets) in 435 ms. (91 steps per ms) remains 3/14 properties
BEST_FIRST walk for 23048 steps (7 resets) in 34 ms. (658 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT p0)), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR p1 p0))), (F (NOT p1)), (F (NOT (OR p1 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p2 p0)))]
Knowledge based reduction with 14 factoid took 913 ms. Reduced automaton from 16 states, 37 edges and 3 AP (stutter sensitive) to 16 states, 37 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 738 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 735 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 257/257 transitions.
Applied a total of 0 rules in 5 ms. Remains 218 /218 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2025-06-03 11:11:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:11:35] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-03 11:11:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:11:35] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2025-06-03 11:11:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/475 variables, 218/220 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 11:11:48] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:48] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:48] [INFO ] Deduced a trap composed of 10 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 11:11:48] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:48] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:48] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:48] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:49] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:49] [INFO ] Deduced a trap composed of 16 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 11:11:49] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:49] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:49] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:11:49] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 13/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/475 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 233 constraints, problems are : Problem set: 0 solved, 256 unsolved in 29984 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 13/13 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/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/475 variables, 218/233 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 256/489 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 11:12:13] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 490 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Finished structural reductions in LTL mode , in 1 iterations and 60651 ms. Remains : 218/218 places, 257/257 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 441 edges and 218 vertex of which 216 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Detected a total of 41/218 stabilizing places and 41/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 16 states, 37 edges and 3 AP (stutter sensitive) to 16 states, 37 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 833 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (93 resets) in 327 ms. (121 steps per ms) remains 3/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (20 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 31533 steps (11 resets) in 92 ms. (339 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT (OR p0 p1 p2))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p1)), (F (NOT (OR p1 (NOT p2)))), (F (NOT p2)), (F (NOT (AND p1 p2))), (F (NOT (OR p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 695 ms. Reduced automaton from 16 states, 37 edges and 3 AP (stutter sensitive) to 16 states, 37 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 829 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 826 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 644 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 16666 reset in 182 ms.
Product exploration explored 100000 steps with 16666 reset in 199 ms.
Applying partial POR strategy [true, false, false, false, true, true, true, true, true, false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 715 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 257/257 transitions.
Graph (complete) has 441 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 217 transition count 256
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 29 place count 217 transition count 256
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 70 place count 217 transition count 256
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 100 place count 217 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 214 transition count 267
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 214 transition count 267
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 123 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 133 place count 214 transition count 321
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 144 place count 203 transition count 299
Deduced a syphon composed of 123 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 155 place count 203 transition count 299
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 188 place count 170 transition count 244
Deduced a syphon composed of 101 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 221 place count 170 transition count 244
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 254 place count 137 transition count 189
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 287 place count 137 transition count 189
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 298 place count 126 transition count 178
Deduced a syphon composed of 79 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 309 place count 126 transition count 178
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 331 place count 104 transition count 145
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 353 place count 104 transition count 145
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 396 place count 61 transition count 80
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 439 place count 61 transition count 80
Deduced a syphon composed of 36 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 442 place count 61 transition count 77
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 442 rules in 51 ms. Remains 61 /218 variables (removed 157) and now considering 77/257 (removed 180) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:12:41] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-03 11:12:41] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 61 cols
[2025-06-03 11:12:41] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 11:12:41] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:12:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:12:42] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 73 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 4 (OVERLAPS) 74/135 variables, 61/65 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 48 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 48 solved, 28 unsolved in 2756 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 4/28 variables, 2/2 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/4 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 71/99 variables, 28/32 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 21/53 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 28/81 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/81 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 34/133 variables, 32/113 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/113 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/114 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/114 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 1/135 variables, 1/115 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/115 constraints. Problems are: Problem set: 48 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/115 constraints. Problems are: Problem set: 48 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 115 constraints, problems are : Problem set: 48 solved, 28 unsolved in 3410 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 28/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6180ms problems are : Problem set: 48 solved, 28 unsolved
Search for dead transitions found 48 dead transitions in 6181ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 61/218 places, 29/257 transitions.
Graph (complete) has 68 edges and 61 vertex of which 25 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 25 /61 variables (removed 36) and now considering 29/29 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/218 places, 29/257 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6268 ms. Remains : 25/218 places, 29/257 transitions.
Built C files in :
/tmp/ltsmin15110346147091396666
[2025-06-03 11:12:47] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15110346147091396666
Running compilation step : cd /tmp/ltsmin15110346147091396666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 907 ms.
Running link step : cd /tmp/ltsmin15110346147091396666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15110346147091396666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9306374853602520629.hoa' '--buchi-type=spotba'
LTSmin run took 151 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-11 finished in 139752 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((p0&&F((p1&&X(X(p2)))))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 234 transition count 277
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 234 transition count 277
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 230 transition count 272
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 230 transition count 272
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 227 transition count 268
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 227 transition count 268
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 224 transition count 265
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 224 transition count 265
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 222 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 222 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 221 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 221 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 220 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 220 transition count 260
Applied a total of 42 rules in 22 ms. Remains 220 /241 variables (removed 21) and now considering 260/284 (removed 24) transitions.
// Phase 1: matrix 260 rows 220 cols
[2025-06-03 11:12:48] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:12:49] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-03 11:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:12:49] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2025-06-03 11:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/480 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:01] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:02] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:02] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:02] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:02] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:03] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:03] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:03] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:03] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:03] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:03] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:04] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:13:04] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 13/235 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/480 variables, and 235 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/480 variables, 220/235 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 259/494 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 494 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 220/241 places, 260/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60641 ms. Remains : 220/241 places, 260/284 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-12 finished in 61037 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 U (p1||G(p0))))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 482 edges and 241 vertex of which 237 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 236 transition count 247
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 204 transition count 247
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 65 place count 204 transition count 204
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 151 place count 161 transition count 204
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 158 place count 154 transition count 196
Iterating global reduction 2 with 7 rules applied. Total rules applied 165 place count 154 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 169 place count 150 transition count 191
Iterating global reduction 2 with 4 rules applied. Total rules applied 173 place count 150 transition count 191
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 176 place count 147 transition count 186
Iterating global reduction 2 with 3 rules applied. Total rules applied 179 place count 147 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 145 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 145 transition count 184
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 291 place count 91 transition count 130
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 303 place count 79 transition count 107
Iterating global reduction 2 with 12 rules applied. Total rules applied 315 place count 79 transition count 107
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 327 place count 67 transition count 94
Iterating global reduction 2 with 12 rules applied. Total rules applied 339 place count 67 transition count 94
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 350 place count 56 transition count 72
Iterating global reduction 2 with 11 rules applied. Total rules applied 361 place count 56 transition count 72
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 372 place count 45 transition count 61
Iterating global reduction 2 with 11 rules applied. Total rules applied 383 place count 45 transition count 61
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 394 place count 34 transition count 39
Iterating global reduction 2 with 11 rules applied. Total rules applied 405 place count 34 transition count 39
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 416 place count 23 transition count 28
Iterating global reduction 2 with 11 rules applied. Total rules applied 427 place count 23 transition count 28
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 428 place count 23 transition count 27
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 429 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 431 place count 21 transition count 25
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 433 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 19 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 434 place count 19 transition count 21
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 440 place count 16 transition count 21
Applied a total of 440 rules in 51 ms. Remains 16 /241 variables (removed 225) and now considering 21/284 (removed 263) transitions.
[2025-06-03 11:13:50] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 16 cols
[2025-06-03 11:13:50] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 11:13:50] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2025-06-03 11:13:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 11:13:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 11:13:50] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2025-06-03 11:13:50] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2025-06-03 11:13:50] [INFO ] Invariant cache hit.
[2025-06-03 11:13:50] [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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 18 constraints, problems are : Problem set: 0 solved, 20 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 38 constraints, problems are : Problem set: 0 solved, 20 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1135ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/241 places, 21/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1316 ms. Remains : 16/241 places, 21/284 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-14
Product exploration explored 100000 steps with 919 reset in 371 ms.
Stack based approach found an accepted trace after 1068 steps with 8 reset with depth 56 and stack size 48 in 5 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-14 finished in 1819 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||X(F(p1))) U (G((!p0||X(F(p1))))||((!p0||X(F(p1)))&&X(p0)))))'
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 233 transition count 275
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 233 transition count 275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 227 transition count 268
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 227 transition count 268
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 222 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 222 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 218 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 218 transition count 258
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 216 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 216 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 215 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 214 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 214 transition count 253
Applied a total of 54 rules in 29 ms. Remains 214 /241 variables (removed 27) and now considering 253/284 (removed 31) transitions.
// Phase 1: matrix 253 rows 214 cols
[2025-06-03 11:13:51] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:52] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-03 11:13:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:13:52] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-03 11:13:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 253/467 variables, 214/216 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:04] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:04] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:04] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:04] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:05] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:05] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:05] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:05] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:05] [INFO ] Deduced a trap composed of 15 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 11:14:06] [INFO ] Deduced a trap composed of 16 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 11:14:06] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:06] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 11:14:06] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 13/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/467 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 229 constraints, problems are : Problem set: 0 solved, 252 unsolved in 29505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/467 variables, 214/229 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 252/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 481 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59596ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 59597ms
Starting structural reductions in LTL mode, iteration 1 : 214/241 places, 253/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60182 ms. Remains : 214/241 places, 253/284 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-15
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-15 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-15 finished in 60326 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(p0)&&X(X(F((p1&&X(p2))))))))'
Found a Shortening insensitive property : DiscoveryGPU-PT-13b-LTLFireability-04
Stuttering acceptance computed with spot in 404 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 241/241 places, 284/284 transitions.
Graph (complete) has 482 edges and 241 vertex of which 237 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 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 236 transition count 248
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 205 transition count 246
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 203 transition count 246
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 67 place count 203 transition count 203
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 153 place count 160 transition count 203
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 160 place count 153 transition count 195
Iterating global reduction 3 with 7 rules applied. Total rules applied 167 place count 153 transition count 195
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 171 place count 149 transition count 190
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 149 transition count 190
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 178 place count 146 transition count 185
Iterating global reduction 3 with 3 rules applied. Total rules applied 181 place count 146 transition count 185
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 183 place count 144 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 144 transition count 183
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 291 place count 91 transition count 130
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 303 place count 79 transition count 107
Iterating global reduction 3 with 12 rules applied. Total rules applied 315 place count 79 transition count 107
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 326 place count 68 transition count 96
Iterating global reduction 3 with 11 rules applied. Total rules applied 337 place count 68 transition count 96
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 348 place count 57 transition count 74
Iterating global reduction 3 with 11 rules applied. Total rules applied 359 place count 57 transition count 74
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 370 place count 46 transition count 63
Iterating global reduction 3 with 11 rules applied. Total rules applied 381 place count 46 transition count 63
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 391 place count 36 transition count 43
Iterating global reduction 3 with 10 rules applied. Total rules applied 401 place count 36 transition count 43
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 411 place count 26 transition count 33
Iterating global reduction 3 with 10 rules applied. Total rules applied 421 place count 26 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 423 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 424 place count 23 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 424 place count 23 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 428 place count 21 transition count 29
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 432 place count 19 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 433 place count 19 transition count 25
Applied a total of 433 rules in 46 ms. Remains 19 /241 variables (removed 222) and now considering 25/284 (removed 259) transitions.
[2025-06-03 11:14:52] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 19 cols
[2025-06-03 11:14:52] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:14:52] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-03 11:14:52] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 11:14:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:14:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 11:14:52] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2025-06-03 11:14:52] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 11:14:53] [INFO ] Invariant cache hit.
[2025-06-03 11:14:53] [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 702 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 721 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 1443ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1444ms
Starting structural reductions in LI_LTL mode, iteration 1 : 19/241 places, 25/284 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1645 ms. Remains : 19/241 places, 25/284 transitions.
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-04
Product exploration explored 100000 steps with 7783 reset in 265 ms.
Product exploration explored 100000 steps with 7791 reset in 312 ms.
Computed a total of 10 stabilizing places and 13 stable transitions
Computed a total of 10 stabilizing places and 13 stable transitions
Detected a total of 10/19 stabilizing places and 13/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 8979 steps (56 resets) in 49 ms. (179 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 615 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2025-06-03 11:14:56] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 11:14:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:14:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 11:14:56] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 11:14:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 11:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 11:14:56] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 24 sub problems to find dead transitions.
[2025-06-03 11:14:56] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2025-06-03 11:14:56] [INFO ] Invariant cache hit.
[2025-06-03 11:14:56] [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 650 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 692 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 1375ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1376ms
Finished structural reductions in LTL mode , in 1 iterations and 1472 ms. Remains : 19/19 places, 25/25 transitions.
Computed a total of 10 stabilizing places and 13 stable transitions
Computed a total of 10 stabilizing places and 13 stable transitions
Detected a total of 10/19 stabilizing places and 13/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 15744 steps (101 resets) in 104 ms. (149 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND (NOT p2) p1))), (F p2), (F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 717 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 7832 reset in 213 ms.
Product exploration explored 100000 steps with 7767 reset in 221 ms.
Built C files in :
/tmp/ltsmin9477588584643443917
[2025-06-03 11:15:01] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9477588584643443917
Running compilation step : cd /tmp/ltsmin9477588584643443917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin9477588584643443917;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9477588584643443917;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9910441619002173291.hoa' '--buchi-type=spotba'
LTSmin run took 163 ms.
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-04 finished in 9428 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-06-03 11:15:01] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14587999851005512403
[2025-06-03 11:15:01] [INFO ] Computing symmetric may disable matrix : 284 transitions.
[2025-06-03 11:15:01] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:15:01] [INFO ] Applying decomposition
[2025-06-03 11:15:01] [INFO ] Computing symmetric may enable matrix : 284 transitions.
[2025-06-03 11:15:01] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:15:01] [INFO ] Flatten gal took : 29 ms
[2025-06-03 11:15:01] [INFO ] Computing Do-Not-Accords matrix : 284 transitions.
[2025-06-03 11:15:01] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 11:15:01] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14587999851005512403
Running compilation step : cd /tmp/ltsmin14587999851005512403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7380213427588981973.txt' '-o' '/tmp/graph7380213427588981973.bin' '-w' '/tmp/graph7380213427588981973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7380213427588981973.bin' '-l' '-1' '-v' '-w' '/tmp/graph7380213427588981973.weights' '-q' '0' '-e' '0.001'
[2025-06-03 11:15:01] [INFO ] Decomposing Gal with order
[2025-06-03 11:15:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:15:01] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-03 11:15:01] [INFO ] Flatten gal took : 44 ms
[2025-06-03 11:15:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 6 ms.
[2025-06-03 11:15:01] [INFO ] Time to serialize gal into /tmp/LTLFireability7792470134375887379.gal : 9 ms
[2025-06-03 11:15:01] [INFO ] Time to serialize properties into /tmp/LTLFireability2511647951684914255.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7792470134375887379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2511647951684914255.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i3.i2.u27.p117!=1)")))||((F("(i3.i2.u27.p117!=1)"))&&(X(X(F(("(i6.i0.u14.p49!=1)")&&(X("((i3.i2.u27.p118==1)&&(u88.p371==1))...165
Formula 0 simplified : FG!"(i3.i2.u27.p117!=1)" & (G!"(i3.i2.u27.p117!=1)" | XXG(!"(i6.i0.u14.p49!=1)" | X!"((i3.i2.u27.p118==1)&&(u88.p371==1))"))
Compilation finished in 1197 ms.
Running link step : cd /tmp/ltsmin14587999851005512403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14587999851005512403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(<>(((LTLAPp1==true)&&X((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: LTL layer: formula: ([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(<>(((LTLAPp1==true)&&X((LTLAPp2==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.017: "([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(<>(((LTLAPp1==true)&&X((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.144: DFS-FIFO for weak LTL, using special progress label 288
pins2lts-mc-linux64( 0/ 8), 0.144: There are 289 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.144: State length is 242, there are 301 groups
pins2lts-mc-linux64( 0/ 8), 0.144: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.144: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.144: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.144: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.167: ~1 levels ~960 states ~4312 transitions
pins2lts-mc-linux64( 6/ 8), 0.207: ~1 levels ~1920 states ~9592 transitions
pins2lts-mc-linux64( 6/ 8), 0.261: ~1 levels ~3840 states ~21784 transitions
pins2lts-mc-linux64( 6/ 8), 0.415: ~1 levels ~7680 states ~45352 transitions
pins2lts-mc-linux64( 2/ 8), 0.725: ~1 levels ~15360 states ~126080 transitions
pins2lts-mc-linux64( 6/ 8), 1.296: ~1 levels ~30720 states ~238968 transitions
pins2lts-mc-linux64( 2/ 8), 2.264: ~1 levels ~61440 states ~577744 transitions
pins2lts-mc-linux64( 2/ 8), 3.917: ~1 levels ~122880 states ~1181360 transitions
pins2lts-mc-linux64( 5/ 8), 6.612: ~1 levels ~245760 states ~1926744 transitions
pins2lts-mc-linux64( 5/ 8), 10.537: ~1 levels ~491520 states ~4016712 transitions
pins2lts-mc-linux64( 5/ 8), 16.978: ~1 levels ~983040 states ~8324064 transitions
pins2lts-mc-linux64( 5/ 8), 28.636: ~1 levels ~1966080 states ~16573680 transitions
pins2lts-mc-linux64( 5/ 8), 53.251: ~1 levels ~3932160 states ~34129992 transitions
pins2lts-mc-linux64( 3/ 8), 102.503: ~1 levels ~7864320 states ~68099192 transitions
pins2lts-mc-linux64( 5/ 8), 201.254: ~1 levels ~15728640 states ~140890544 transitions
pins2lts-mc-linux64( 5/ 8), 398.436: ~1 levels ~31457280 states ~285468424 transitions
pins2lts-mc-linux64( 5/ 8), 797.651: ~1 levels ~62914560 states ~576888488 transitions
pins2lts-mc-linux64( 4/ 8), 1252.500: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1252.563:
pins2lts-mc-linux64( 0/ 8), 1252.563: mean standard work distribution: 3.4% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1252.564:
pins2lts-mc-linux64( 0/ 8), 1252.564: Explored 89956760 states 897412201 transitions, fanout: 9.976
pins2lts-mc-linux64( 0/ 8), 1252.564: Total exploration time 1252.400 sec (1252.360 sec minimum, 1252.376 sec on average)
pins2lts-mc-linux64( 0/ 8), 1252.564: States per second: 71828, Transitions per second: 716554
pins2lts-mc-linux64( 0/ 8), 1252.564:
pins2lts-mc-linux64( 0/ 8), 1252.564: Progress states detected: 134217205
pins2lts-mc-linux64( 0/ 8), 1252.564: Redundant explorations: -32.9768
pins2lts-mc-linux64( 0/ 8), 1252.564:
pins2lts-mc-linux64( 0/ 8), 1252.564: Queue width: 8B, total height: 79585517, memory: 607.19MB
pins2lts-mc-linux64( 0/ 8), 1252.564: Tree memory: 1046.8MB, 8.2 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1252.564: Tree fill ratio (roots/leafs): 99.0%/8.0%
pins2lts-mc-linux64( 0/ 8), 1252.569: Stored 286 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1252.583: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1252.583: Est. total memory use: 1654.0MB (~1631.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14587999851005512403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(<>(((LTLAPp1==true)&&X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14587999851005512403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(<>(((LTLAPp1==true)&&X((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-03 11:40:50] [INFO ] Applying decomposition
[2025-06-03 11:40:51] [INFO ] Flatten gal took : 694 ms
[2025-06-03 11:40:51] [INFO ] Decomposing Gal with order
[2025-06-03 11:40:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 11:40:51] [INFO ] Removed a total of 108 redundant transitions.
[2025-06-03 11:40:51] [INFO ] Flatten gal took : 214 ms
[2025-06-03 11:40:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 734 labels/synchronizations in 399 ms.
[2025-06-03 11:40:52] [INFO ] Time to serialize gal into /tmp/LTLFireability14725801539365923317.gal : 72 ms
[2025-06-03 11:40:52] [INFO ] Time to serialize properties into /tmp/LTLFireability1548969704375634653.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14725801539365923317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1548969704375634653.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u16.p117!=1)")))||((F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u16.p117!=1)"))&&(X(X(F(("(i0.i0.i0.i0.i...270
Formula 0 simplified : FG!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u16.p117!=1)" & (G!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u16.p117!=1)" | XXG(!"(i0.i0.i0.i0.i0.i0.i0.i0...252
BK_TIME_CONFINEMENT_REACHED
--------------------
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-13b"
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-13b, 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-174854064700732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b 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 ;