Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064600668.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-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064600668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K 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 68K 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-09b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748926321276

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-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 04:52:03] [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 04:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 04:52:04] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2025-06-03 04:52:04] [INFO ] Transformed 268 places.
[2025-06-03 04:52:04] [INFO ] Transformed 284 transitions.
[2025-06-03 04:52:04] [INFO ] Found NUPN structural information;
[2025-06-03 04:52:04] [INFO ] Parsed PT model containing 268 places and 284 transitions and 740 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 250 transition count 284
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 56 place count 212 transition count 246
Iterating global reduction 1 with 38 rules applied. Total rules applied 94 place count 212 transition count 246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 204 transition count 238
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 204 transition count 238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 114 place count 200 transition count 234
Iterating global reduction 1 with 4 rules applied. Total rules applied 118 place count 200 transition count 234
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 197 transition count 231
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 197 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 195 transition count 227
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 195 transition count 227
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 193 transition count 225
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 193 transition count 225
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 191 transition count 223
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 191 transition count 223
Applied a total of 136 rules in 214 ms. Remains 191 /268 variables (removed 77) and now considering 223/284 (removed 61) transitions.
// Phase 1: matrix 223 rows 191 cols
[2025-06-03 04:52:05] [INFO ] Computed 2 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:52:05] [INFO ] Implicit Places using invariants in 509 ms returned []
[2025-06-03 04:52:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:52:06] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-06-03 04:52:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/414 variables, 191/193 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:52:17] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:52:17] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:52:17] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:52:17] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:52:18] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:52:18] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:52:18] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:52:18] [INFO ] Deduced a trap composed of 14 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 04:52:18] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 9/202 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/414 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 202 constraints, problems are : Problem set: 0 solved, 222 unsolved in 27911 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/414 variables, 191/202 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 222/424 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/414 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 424 constraints, problems are : Problem set: 0 solved, 222 unsolved in 28312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56508ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 56535ms
Starting structural reductions in LTL mode, iteration 1 : 191/268 places, 223/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57912 ms. Remains : 191/268 places, 223/284 transitions.
Support contains 36 out of 191 places after structural reductions.
[2025-06-03 04:53:03] [INFO ] Flatten gal took : 88 ms
[2025-06-03 04:53:03] [INFO ] Flatten gal took : 38 ms
[2025-06-03 04:53:03] [INFO ] Input system was already deterministic with 223 transitions.
RANDOM walk for 40000 steps (136 resets) in 1404 ms. (28 steps per ms) remains 1/34 properties
BEST_FIRST walk for 4385 steps (0 resets) in 38 ms. (112 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-09b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 373 edges and 191 vertex of which 187 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' '!(G(F(p0)))'
Support contains 1 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Graph (complete) has 373 edges and 191 vertex of which 187 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 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 186 transition count 187
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 155 transition count 187
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 63 place count 155 transition count 160
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 117 place count 128 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 123 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 123 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 119 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 119 transition count 150
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 139 place count 115 transition count 143
Iterating global reduction 2 with 4 rules applied. Total rules applied 143 place count 115 transition count 143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 112 transition count 140
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 112 transition count 140
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 241 place count 66 transition count 94
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 248 place count 59 transition count 81
Iterating global reduction 2 with 7 rules applied. Total rules applied 255 place count 59 transition count 81
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 262 place count 52 transition count 72
Iterating global reduction 2 with 7 rules applied. Total rules applied 269 place count 52 transition count 72
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 276 place count 45 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 283 place count 45 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 290 place count 38 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 297 place count 38 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 304 place count 31 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 311 place count 31 transition count 38
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 318 place count 24 transition count 30
Iterating global reduction 2 with 7 rules applied. Total rules applied 325 place count 24 transition count 30
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 327 place count 22 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 330 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 331 place count 21 transition count 26
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 332 place count 21 transition count 25
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 333 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 335 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 20 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 342 place count 14 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 346 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 350 place count 8 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 352 place count 7 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 353 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 356 place count 5 transition count 10
Applied a total of 356 rules in 140 ms. Remains 5 /191 variables (removed 186) and now considering 10/223 (removed 213) transitions.
[2025-06-03 04:53:04] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2025-06-03 04:53:04] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:53:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 04:53:04] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2025-06-03 04:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:53:04] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:53:04] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 04:53:04] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2025-06-03 04:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 115 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 126 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 250ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/191 places, 10/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 475 ms. Remains : 5/191 places, 10/223 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-00 finished in 879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X(X(p1))&&F(((!p0&&X(F(p2)))||G(F(p2)))))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 179 transition count 211
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 179 transition count 211
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 174 transition count 204
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 174 transition count 204
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 169 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 169 transition count 198
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 164 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 164 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 161 transition count 188
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 161 transition count 188
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 159 transition count 186
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 159 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 158 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 158 transition count 185
Applied a total of 66 rules in 35 ms. Remains 158 /191 variables (removed 33) and now considering 185/223 (removed 38) transitions.
// Phase 1: matrix 185 rows 158 cols
[2025-06-03 04:53:05] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:53:05] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-03 04:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:53:05] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-03 04:53:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/343 variables, 158/160 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:12] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:12] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:13] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:13] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:13] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:13] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:13] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:13] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:13] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/343 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 169 constraints, problems are : Problem set: 0 solved, 184 unsolved in 20159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (OVERLAPS) 185/343 variables, 158/169 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 184/353 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 353 constraints, problems are : Problem set: 0 solved, 184 unsolved in 22314 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42535ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 42539ms
Starting structural reductions in LTL mode, iteration 1 : 158/191 places, 185/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42906 ms. Remains : 158/191 places, 185/223 transitions.
Stuttering acceptance computed with spot in 529 ms :[(OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-01
Product exploration explored 100000 steps with 1462 reset in 511 ms.
Stack based approach found an accepted trace after 224 steps with 5 reset with depth 44 and stack size 44 in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-01 finished in 44000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U (X(X(X(X(X(p1)))))&&G((p2 U p3))))))'
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 172 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 166 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 166 transition count 195
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 160 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 160 transition count 188
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 156 transition count 182
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 156 transition count 182
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 153 transition count 179
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 153 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 151 transition count 177
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 151 transition count 177
Applied a total of 80 rules in 61 ms. Remains 151 /191 variables (removed 40) and now considering 177/223 (removed 46) transitions.
// Phase 1: matrix 177 rows 151 cols
[2025-06-03 04:53:49] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:53:50] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-06-03 04:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:53:50] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-03 04:53: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/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/328 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:57] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:57] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:57] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:57] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:57] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:57] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:57] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:57] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:53:58] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 162 constraints, problems are : Problem set: 0 solved, 176 unsolved in 19247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/328 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 176/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 338 constraints, problems are : Problem set: 0 solved, 176 unsolved in 20325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39628ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 39630ms
Starting structural reductions in LTL mode, iteration 1 : 151/191 places, 177/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40418 ms. Remains : 151/191 places, 177/223 transitions.
Stuttering acceptance computed with spot in 12641 ms :[(OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3), (NOT p3), (OR (NOT p3) (NOT p1)), (NOT p1), (NOT p3), (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 90 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-03 finished in 53582 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||(G((p1&&X(p2))) U X(X(X(p3)))))))'
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 172 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 166 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 166 transition count 195
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 160 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 160 transition count 188
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 157 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 157 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 155 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 155 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 154 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 154 transition count 181
Applied a total of 74 rules in 24 ms. Remains 154 /191 variables (removed 37) and now considering 181/223 (removed 42) transitions.
// Phase 1: matrix 181 rows 154 cols
[2025-06-03 04:54:42] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:54:43] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-03 04:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:54:43] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-03 04:54:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 181/335 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:54:49] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:54:50] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:54:50] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:54:50] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:54:50] [INFO ] Deduced a trap composed of 11 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 04:54:50] [INFO ] Deduced a trap composed of 12 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 04:54:50] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:54:50] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:54:51] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 165 constraints, problems are : Problem set: 0 solved, 180 unsolved in 19239 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/335 variables, 154/165 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 180/345 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 345 constraints, problems are : Problem set: 0 solved, 180 unsolved in 20907 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40219ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 40221ms
Starting structural reductions in LTL mode, iteration 1 : 154/191 places, 181/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40656 ms. Remains : 154/191 places, 181/223 transitions.
Stuttering acceptance computed with spot in 541 ms :[(OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), true, (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-04 finished in 41239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Graph (complete) has 373 edges and 191 vertex of which 187 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 186 transition count 186
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 154 transition count 186
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 65 place count 154 transition count 161
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 115 place count 129 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 124 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 124 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 120 transition count 151
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 120 transition count 151
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 116 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 113 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 113 transition count 141
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 239 place count 67 transition count 95
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 247 place count 59 transition count 80
Iterating global reduction 2 with 8 rules applied. Total rules applied 255 place count 59 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 262 place count 52 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 269 place count 52 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 276 place count 45 transition count 58
Iterating global reduction 2 with 7 rules applied. Total rules applied 283 place count 45 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 290 place count 38 transition count 50
Iterating global reduction 2 with 7 rules applied. Total rules applied 297 place count 38 transition count 50
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 304 place count 31 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 311 place count 31 transition count 37
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 318 place count 24 transition count 29
Iterating global reduction 2 with 7 rules applied. Total rules applied 325 place count 24 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 327 place count 22 transition count 26
Iterating global reduction 2 with 2 rules applied. Total rules applied 329 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 330 place count 21 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 331 place count 21 transition count 25
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 332 place count 21 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 334 place count 19 transition count 22
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 336 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 337 place count 17 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 337 place count 17 transition count 18
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 343 place count 14 transition count 18
Applied a total of 343 rules in 73 ms. Remains 14 /191 variables (removed 177) and now considering 18/223 (removed 205) transitions.
[2025-06-03 04:55:24] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2025-06-03 04:55:24] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:55:24] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 04:55:24] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2025-06-03 04:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:55:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 04:55:24] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:55:24] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2025-06-03 04:55:24] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2025-06-03 04:55:24] [INFO ] Invariant cache hit.
[2025-06-03 04:55:24] [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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 16 constraints, problems are : Problem set: 0 solved, 17 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 919ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 919ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/191 places, 18/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1098 ms. Remains : 14/191 places, 18/223 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-05
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-05 finished in 1266 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(G(p0))||G(p1))))'
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 177 transition count 209
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 177 transition count 209
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 171 transition count 201
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 171 transition count 201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 165 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 165 transition count 194
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 159 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 159 transition count 187
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 155 transition count 181
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 155 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 152 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 152 transition count 178
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 150 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 150 transition count 176
Applied a total of 82 rules in 17 ms. Remains 150 /191 variables (removed 41) and now considering 176/223 (removed 47) transitions.
// Phase 1: matrix 176 rows 150 cols
[2025-06-03 04:55:25] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:55:25] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-03 04:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:55:25] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2025-06-03 04:55:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/326 variables, 150/152 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:55:31] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:55:32] [INFO ] Deduced a trap composed of 8 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 04:55:32] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:55:32] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:55:32] [INFO ] Deduced a trap composed of 11 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 04:55:32] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:55:32] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:55:32] [INFO ] Deduced a trap composed of 14 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 04:55:32] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 161 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/150 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/326 variables, 150/161 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 175/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 336 constraints, problems are : Problem set: 0 solved, 175 unsolved in 20786 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38507ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 38508ms
Starting structural reductions in LTL mode, iteration 1 : 150/191 places, 176/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38905 ms. Remains : 150/191 places, 176/223 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-06
Stuttering criterion allowed to conclude after 281 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-06 finished in 39065 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 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 179 transition count 211
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 179 transition count 211
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 175 transition count 206
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 175 transition count 206
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 171 transition count 202
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 171 transition count 202
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 167 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 167 transition count 197
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 164 transition count 192
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 164 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 161 transition count 189
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 161 transition count 189
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 159 transition count 187
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 159 transition count 187
Applied a total of 64 rules in 21 ms. Remains 159 /191 variables (removed 32) and now considering 187/223 (removed 36) transitions.
// Phase 1: matrix 187 rows 159 cols
[2025-06-03 04:56:04] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:56:04] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-03 04:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:56:04] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2025-06-03 04:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/346 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:12] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:12] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:12] [INFO ] Deduced a trap composed of 9 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 04:56:12] [INFO ] Deduced a trap composed of 10 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 04:56:12] [INFO ] Deduced a trap composed of 11 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 04:56:13] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:13] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:13] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:13] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/346 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 170 constraints, problems are : Problem set: 0 solved, 186 unsolved in 20521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/346 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 186/356 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/346 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/346 variables, and 356 constraints, problems are : Problem set: 0 solved, 186 unsolved in 19740 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40308ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 40311ms
Starting structural reductions in LTL mode, iteration 1 : 159/191 places, 187/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40795 ms. Remains : 159/191 places, 187/223 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 283 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-07 finished in 40967 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((p0||G((p1&&X(p2)))))))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 172 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 166 transition count 195
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 166 transition count 195
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 160 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 160 transition count 188
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 156 transition count 182
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 156 transition count 182
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 153 transition count 179
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 153 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 151 transition count 177
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 151 transition count 177
Applied a total of 80 rules in 18 ms. Remains 151 /191 variables (removed 40) and now considering 177/223 (removed 46) transitions.
// Phase 1: matrix 177 rows 151 cols
[2025-06-03 04:56:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:56:45] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-03 04:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:56:45] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-03 04:56:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/328 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:52] [INFO ] Deduced a trap composed of 7 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 04:56:52] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:52] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:52] [INFO ] Deduced a trap composed of 10 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 04:56:53] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:53] [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 04:56:53] [INFO ] Deduced a trap composed of 13 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 04:56:53] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:56:53] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 162 constraints, problems are : Problem set: 0 solved, 176 unsolved in 18724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/328 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 176/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 338 constraints, problems are : Problem set: 0 solved, 176 unsolved in 15542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34302ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 34304ms
Starting structural reductions in LTL mode, iteration 1 : 151/191 places, 177/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34741 ms. Remains : 151/191 places, 177/223 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-09
Product exploration explored 100000 steps with 20000 reset in 155 ms.
Product exploration explored 100000 steps with 20000 reset in 196 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 304 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 21268 steps (70 resets) in 100 ms. (210 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 1 factoid took 229 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Stuttering acceptance computed with spot in 236 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 177/177 transitions.
Applied a total of 0 rules in 1 ms. Remains 151 /151 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2025-06-03 04:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:57:21] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-03 04:57:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:57:22] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2025-06-03 04:57: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/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/328 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:26] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:26] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:26] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:26] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:26] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:27] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:27] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:27] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:57:27] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 162 constraints, problems are : Problem set: 0 solved, 176 unsolved in 15844 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/328 variables, 151/162 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 176/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 338 constraints, problems are : Problem set: 0 solved, 176 unsolved in 18130 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34005ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 34006ms
Finished structural reductions in LTL mode , in 1 iterations and 34275 ms. Remains : 151/151 places, 177/177 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 304 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 21047 steps (68 resets) in 100 ms. (208 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 1 factoid took 335 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Stuttering acceptance computed with spot in 367 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Stuttering acceptance computed with spot in 347 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Product exploration explored 100000 steps with 20000 reset in 137 ms.
Product exploration explored 100000 steps with 20000 reset in 525 ms.
Applying partial POR strategy [true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 304 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (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)))]
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 177/177 transitions.
Graph (complete) has 304 edges and 151 vertex of which 150 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 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 150 transition count 176
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 19 place count 150 transition count 176
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 47 place count 150 transition count 176
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 70 place count 150 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 148 transition count 184
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 148 transition count 184
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 92 place count 148 transition count 220
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 140 transition count 204
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 140 transition count 204
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 130 place count 118 transition count 167
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 152 place count 118 transition count 167
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 173 place count 97 transition count 132
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 194 place count 97 transition count 132
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 200 place count 91 transition count 126
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 206 place count 91 transition count 126
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 218 place count 79 transition count 108
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 230 place count 79 transition count 108
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 254 place count 55 transition count 72
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 278 place count 55 transition count 72
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 282 place count 55 transition count 68
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 285 place count 52 transition count 65
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 288 place count 52 transition count 65
Deduced a syphon composed of 29 places in 0 ms
Applied a total of 288 rules in 67 ms. Remains 52 /151 variables (removed 99) and now considering 65/177 (removed 112) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:57:59] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-03 04:57:59] [INFO ] Flow matrix only has 62 transitions (discarded 3 similar events)
// Phase 1: matrix 62 rows 52 cols
[2025-06-03 04:57:59] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 04:57:59] [INFO ] State equation strengthened by 20 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, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:00] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 4 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 61 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 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 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 TDEAD37 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 4 (OVERLAPS) 61/113 variables, 52/56 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 19/75 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/75 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/114 variables, 1/76 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/76 constraints. Problems are: Problem set: 37 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 76 constraints, problems are : Problem set: 37 solved, 27 unsolved in 2530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 37 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 4/26 variables, 2/2 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 2/4 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 58/84 variables, 26/30 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 18/48 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 27/75 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/75 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 27/111 variables, 25/100 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/100 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 2/113 variables, 2/102 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/102 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 1/114 variables, 1/103 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 0/103 constraints. Problems are: Problem set: 37 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/114 variables, 0/103 constraints. Problems are: Problem set: 37 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 103 constraints, problems are : Problem set: 37 solved, 27 unsolved in 2795 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 52/52 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 27/64 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5337ms problems are : Problem set: 37 solved, 27 unsolved
Search for dead transitions found 37 dead transitions in 5338ms
Found 37 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 37 transitions
Dead transitions reduction (with SMT) removed 37 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/151 places, 28/177 transitions.
Graph (complete) has 63 edges and 52 vertex of which 23 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 23 /52 variables (removed 29) and now considering 28/28 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/151 places, 28/177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5422 ms. Remains : 23/151 places, 28/177 transitions.
Built C files in :
/tmp/ltsmin12452998940430981030
[2025-06-03 04:58:04] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12452998940430981030
Running compilation step : cd /tmp/ltsmin12452998940430981030;'/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 943 ms.
Running link step : cd /tmp/ltsmin12452998940430981030;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin12452998940430981030;'/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/stateBased17553811396478436256.hoa' '--buchi-type=spotba'
LTSmin run took 198 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-09 finished in 80760 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(F(p0))))&&F((!p0 U (p1||G(!p0))))))'
Support contains 2 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 172 transition count 202
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 172 transition count 202
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 167 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 167 transition count 197
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 162 transition count 191
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 162 transition count 191
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 159 transition count 186
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 159 transition count 186
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 156 transition count 183
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 156 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 154 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 154 transition count 181
Applied a total of 74 rules in 39 ms. Remains 154 /191 variables (removed 37) and now considering 181/223 (removed 42) transitions.
// Phase 1: matrix 181 rows 154 cols
[2025-06-03 04:58:06] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:58:06] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-03 04:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:58:06] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2025-06-03 04:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 181/335 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:12] [INFO ] Deduced a trap composed of 7 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 04:58:12] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:12] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:12] [INFO ] Deduced a trap composed of 10 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 04:58:12] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:13] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:13] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:13] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:13] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 9/165 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/335 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 165 constraints, problems are : Problem set: 0 solved, 180 unsolved in 14553 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/335 variables, 154/165 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 180/345 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 335/335 variables, and 345 constraints, problems are : Problem set: 0 solved, 180 unsolved in 17832 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32438ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 32440ms
Starting structural reductions in LTL mode, iteration 1 : 154/191 places, 181/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32931 ms. Remains : 154/191 places, 181/223 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-10
Product exploration explored 100000 steps with 642 reset in 157 ms.
Stack based approach found an accepted trace after 239 steps with 2 reset with depth 51 and stack size 51 in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-10 finished in 33313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0||F(p1)) U p2)&&(p3||X(X(p2)))))))'
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 173 transition count 203
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 173 transition count 203
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 168 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 168 transition count 197
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 163 transition count 191
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 163 transition count 191
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 160 transition count 187
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 160 transition count 187
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 158 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 158 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 157 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 157 transition count 184
Applied a total of 68 rules in 24 ms. Remains 157 /191 variables (removed 34) and now considering 184/223 (removed 39) transitions.
// Phase 1: matrix 184 rows 157 cols
[2025-06-03 04:58:39] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:58:39] [INFO ] Implicit Places using invariants in 204 ms returned []
[2025-06-03 04:58:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:58:40] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2025-06-03 04:58:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (OVERLAPS) 184/341 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:46] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:46] [INFO ] Deduced a trap composed of 8 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 04:58:46] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:46] [INFO ] Deduced a trap composed of 10 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 04:58:46] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:46] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:46] [INFO ] Deduced a trap composed of 13 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 04:58:46] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:58:47] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 168 constraints, problems are : Problem set: 0 solved, 183 unsolved in 17446 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/341 variables, 157/168 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 183/351 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 351 constraints, problems are : Problem set: 0 solved, 183 unsolved in 15203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32686ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 32689ms
Starting structural reductions in LTL mode, iteration 1 : 157/191 places, 184/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33202 ms. Remains : 157/191 places, 184/223 transitions.
Stuttering acceptance computed with spot in 406 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-11
Stuttering criterion allowed to conclude after 2935 steps with 162 reset in 8 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-11 finished in 33656 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((X(p1)&&p0))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 178 transition count 210
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 178 transition count 210
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 173 transition count 203
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 173 transition count 203
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 168 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 168 transition count 197
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 163 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 163 transition count 192
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 160 transition count 187
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 160 transition count 187
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 158 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 158 transition count 185
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 156 transition count 183
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 156 transition count 183
Applied a total of 70 rules in 25 ms. Remains 156 /191 variables (removed 35) and now considering 183/223 (removed 40) transitions.
// Phase 1: matrix 183 rows 156 cols
[2025-06-03 04:59:13] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:59:13] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-03 04:59:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:59:13] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2025-06-03 04:59:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (OVERLAPS) 183/339 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:59:20] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:59:20] [INFO ] Deduced a trap composed of 8 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 04:59:20] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:59:21] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:59:21] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:59:21] [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 04:59:21] [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 04:59:21] [INFO ] Deduced a trap composed of 14 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 04:59:21] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 0/339 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 167 constraints, problems are : Problem set: 0 solved, 182 unsolved in 21069 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/339 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 182/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 349 constraints, problems are : Problem set: 0 solved, 182 unsolved in 20542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41648ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 41649ms
Starting structural reductions in LTL mode, iteration 1 : 156/191 places, 183/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42105 ms. Remains : 156/191 places, 183/223 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-12
Stuttering criterion allowed to conclude after 566 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-12 finished in 42287 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||X((p0||G(F((p1 U (p2||G(p1))))))))))'
Support contains 3 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 223/223 transitions.
Graph (complete) has 373 edges and 191 vertex of which 187 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 186 transition count 187
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 155 transition count 187
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 63 place count 155 transition count 161
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 115 place count 129 transition count 161
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 124 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 124 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 120 transition count 151
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 120 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 117 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 117 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 115 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 115 transition count 144
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 233 place count 70 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 240 place count 63 transition count 86
Iterating global reduction 2 with 7 rules applied. Total rules applied 247 place count 63 transition count 86
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 254 place count 56 transition count 77
Iterating global reduction 2 with 7 rules applied. Total rules applied 261 place count 56 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 268 place count 49 transition count 64
Iterating global reduction 2 with 7 rules applied. Total rules applied 275 place count 49 transition count 64
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 282 place count 42 transition count 56
Iterating global reduction 2 with 7 rules applied. Total rules applied 289 place count 42 transition count 56
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 295 place count 36 transition count 45
Iterating global reduction 2 with 6 rules applied. Total rules applied 301 place count 36 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 307 place count 30 transition count 38
Iterating global reduction 2 with 6 rules applied. Total rules applied 313 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 315 place count 28 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 317 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 318 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 27 transition count 34
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 320 place count 27 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 321 place count 27 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 25 transition count 31
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 29 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 329 place count 20 transition count 25
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 333 place count 17 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 333 place count 17 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 335 place count 16 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 339 place count 14 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
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 343 place count 12 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 345 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 346 place count 11 transition count 17
Applied a total of 346 rules in 49 ms. Remains 11 /191 variables (removed 180) and now considering 17/223 (removed 206) transitions.
[2025-06-03 04:59:55] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2025-06-03 04:59:55] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:59:55] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-03 04:59:55] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2025-06-03 04:59:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:59:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:59:55] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-03 04:59:55] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2025-06-03 04:59:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 11 unsolved in 220 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 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, 11 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/23 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 252 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 479ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/191 places, 17/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 641 ms. Remains : 11/191 places, 17/223 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-15 finished in 776 ms.
All properties solved by simple procedures.
Total runtime 472257 ms.

BK_STOP 1748926796268

--------------------
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-09b"
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-09b, 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-174854064600668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09b.tgz
mv DiscoveryGPU-PT-09b 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;