About the Execution of ITS-Tools for DiscoveryGPU-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 257408.00 | 0.00 | 0.00 | FFFFFTFTFFTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064600652.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-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064600652
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 61K 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-08b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748921869207
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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 03:37:51] [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 03:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 03:37:51] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2025-06-03 03:37:51] [INFO ] Transformed 240 places.
[2025-06-03 03:37:51] [INFO ] Transformed 254 transitions.
[2025-06-03 03:37:51] [INFO ] Found NUPN structural information;
[2025-06-03 03:37:51] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 54 place count 186 transition count 216
Iterating global reduction 1 with 38 rules applied. Total rules applied 92 place count 186 transition count 216
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 178 transition count 208
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 178 transition count 208
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 173 transition count 203
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 173 transition count 203
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 170 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 170 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 169 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 169 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 168 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 168 transition count 197
Applied a total of 128 rules in 128 ms. Remains 168 /240 variables (removed 72) and now considering 197/254 (removed 57) transitions.
// Phase 1: matrix 197 rows 168 cols
[2025-06-03 03:37:52] [INFO ] Computed 2 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:37:52] [INFO ] Implicit Places using invariants in 415 ms returned []
[2025-06-03 03:37:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:37:53] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-03 03:37:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 197/365 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:00] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:00] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:01] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:01] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:01] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:01] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:01] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:01] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 178 constraints, problems are : Problem set: 0 solved, 196 unsolved in 20592 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/365 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 196/374 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 374 constraints, problems are : Problem set: 0 solved, 196 unsolved in 18345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39107ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 39128ms
Starting structural reductions in LTL mode, iteration 1 : 168/240 places, 197/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40016 ms. Remains : 168/240 places, 197/254 transitions.
Support contains 27 out of 168 places after structural reductions.
[2025-06-03 03:38:32] [INFO ] Flatten gal took : 64 ms
[2025-06-03 03:38:32] [INFO ] Flatten gal took : 27 ms
[2025-06-03 03:38:32] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 26 out of 168 places (down from 27) after GAL structural reductions.
RANDOM walk for 7310 steps (24 resets) in 592 ms. (12 steps per ms) remains 0/26 properties
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 331 edges and 168 vertex of which 164 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 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 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Graph (complete) has 331 edges and 168 vertex of which 165 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 164 transition count 167
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 138 transition count 167
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 53 place count 138 transition count 140
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 107 place count 111 transition count 140
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 107 transition count 135
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 107 transition count 135
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 104 transition count 131
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 104 transition count 131
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 102 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 102 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 101 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 101 transition count 127
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 205 place count 62 transition count 88
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 211 place count 56 transition count 77
Iterating global reduction 2 with 6 rules applied. Total rules applied 217 place count 56 transition count 77
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 50 transition count 69
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 50 transition count 69
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 235 place count 44 transition count 58
Iterating global reduction 2 with 6 rules applied. Total rules applied 241 place count 44 transition count 58
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 247 place count 38 transition count 51
Iterating global reduction 2 with 6 rules applied. Total rules applied 253 place count 38 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 259 place count 32 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 265 place count 32 transition count 40
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 271 place count 26 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 277 place count 26 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 279 place count 24 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 281 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 282 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 283 place count 23 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 285 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 19 vertex of which 16 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 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 296 place count 16 transition count 16
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 302 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 306 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 309 place count 6 transition count 11
Applied a total of 309 rules in 85 ms. Remains 6 /168 variables (removed 162) and now considering 11/197 (removed 186) transitions.
[2025-06-03 03:38:33] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2025-06-03 03:38:33] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:38:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-03 03:38:33] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2025-06-03 03:38:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:38:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:38:33] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 03:38:33] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2025-06-03 03:38:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 93 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/168 places, 11/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 6/168 places, 11/197 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-00 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U (p1 U p2))&&G((p3||X(X(p4)))))))'
Support contains 5 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 162 transition count 190
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 162 transition count 190
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 158 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 158 transition count 185
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 154 transition count 180
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 154 transition count 180
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 151 transition count 177
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 151 transition count 177
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 149 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 149 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 148 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 148 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 147 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 147 transition count 172
Applied a total of 42 rules in 24 ms. Remains 147 /168 variables (removed 21) and now considering 172/197 (removed 25) transitions.
// Phase 1: matrix 172 rows 147 cols
[2025-06-03 03:38:34] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:38:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 03:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:38:34] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2025-06-03 03:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 172/319 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:38] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:38] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:39] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:39] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:39] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:39] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:39] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:38:39] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 8/157 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/319 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 157 constraints, problems are : Problem set: 0 solved, 171 unsolved in 15168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/319 variables, 147/157 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 171/328 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 328 constraints, problems are : Problem set: 0 solved, 171 unsolved in 17675 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32898ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 32904ms
Starting structural reductions in LTL mode, iteration 1 : 147/168 places, 172/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33183 ms. Remains : 147/168 places, 172/197 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p0), (NOT p2), (NOT p4), (AND (NOT p3) (NOT p4)), (NOT p4), true]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 190 steps with 0 reset in 7 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-01 finished in 33614 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((F((p0&&(p1 U p2)))&&X(X(F(p3)))))))'
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 159 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 159 transition count 187
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 153 transition count 179
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 153 transition count 179
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 147 transition count 172
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 147 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 142 transition count 167
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 142 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 139 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 139 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 137 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 137 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 135 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 135 transition count 158
Applied a total of 66 rules in 35 ms. Remains 135 /168 variables (removed 33) and now considering 158/197 (removed 39) transitions.
// Phase 1: matrix 158 rows 135 cols
[2025-06-03 03:39:07] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:39:07] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-03 03:39:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:39:08] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2025-06-03 03:39:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 158/293 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:12] [INFO ] Deduced a trap composed of 7 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 03:39:12] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:12] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:12] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:12] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:12] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:13] [INFO ] Deduced a trap composed of 13 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 03:39:13] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 145 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13426 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/293 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 157/302 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 302 constraints, problems are : Problem set: 0 solved, 157 unsolved in 11761 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25228ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 25230ms
Starting structural reductions in LTL mode, iteration 1 : 135/168 places, 158/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25629 ms. Remains : 135/168 places, 158/197 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2)), (NOT p3), (NOT p2), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-02
Stuttering criterion allowed to conclude after 286 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-02 finished in 25996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))&&X(G((p0 U p2))))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Graph (complete) has 331 edges and 168 vertex of which 164 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 163 transition count 168
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 139 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 137 transition count 166
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 53 place count 137 transition count 141
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 103 place count 112 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 107 transition count 135
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 107 transition count 135
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 117 place count 103 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 103 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 100 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 100 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 98 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 98 transition count 123
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 203 place count 62 transition count 87
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 209 place count 56 transition count 76
Iterating global reduction 3 with 6 rules applied. Total rules applied 215 place count 56 transition count 76
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 221 place count 50 transition count 69
Iterating global reduction 3 with 6 rules applied. Total rules applied 227 place count 50 transition count 69
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 233 place count 44 transition count 57
Iterating global reduction 3 with 6 rules applied. Total rules applied 239 place count 44 transition count 57
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 245 place count 38 transition count 51
Iterating global reduction 3 with 6 rules applied. Total rules applied 251 place count 38 transition count 51
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 33 transition count 41
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 33 transition count 41
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 265 place count 29 transition count 37
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 28 transition count 35
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 272 place count 27 transition count 34
Iterating global reduction 3 with 1 rules applied. Total rules applied 273 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 3 with 1 rules applied. Total rules applied 274 place count 27 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 277 place count 24 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 277 place count 24 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 281 place count 22 transition count 29
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 285 place count 20 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 286 place count 20 transition count 26
Applied a total of 286 rules in 69 ms. Remains 20 /168 variables (removed 148) and now considering 26/197 (removed 171) transitions.
[2025-06-03 03:39:33] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 20 cols
[2025-06-03 03:39:33] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:39:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 03:39:33] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2025-06-03 03:39:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:39:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 03:39:33] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:39:33] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-03 03:39:33] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
[2025-06-03 03:39:33] [INFO ] Invariant cache hit.
[2025-06-03 03:39:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 23/42 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/43 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 22 constraints, problems are : Problem set: 0 solved, 24 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 23/42 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 46 constraints, problems are : Problem set: 0 solved, 24 unsolved in 716 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/168 places, 26/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1443 ms. Remains : 20/168 places, 26/197 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-03
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-03 finished in 1702 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 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 161 transition count 189
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 161 transition count 189
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 156 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 156 transition count 183
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 151 transition count 177
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 151 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 147 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 147 transition count 173
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 144 transition count 168
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 144 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 140 transition count 164
Applied a total of 56 rules in 21 ms. Remains 140 /168 variables (removed 28) and now considering 164/197 (removed 33) transitions.
// Phase 1: matrix 164 rows 140 cols
[2025-06-03 03:39:35] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:39:35] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-03 03:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:39:35] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-03 03:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 164/304 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:40] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:40] [INFO ] Deduced a trap composed of 8 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 03:39:40] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:40] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:40] [INFO ] Deduced a trap composed of 11 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 03:39:40] [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 03:39:40] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:39:40] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 150 constraints, problems are : Problem set: 0 solved, 163 unsolved in 13025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/304 variables, 140/150 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 163/313 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 313 constraints, problems are : Problem set: 0 solved, 163 unsolved in 13329 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26397ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 26399ms
Starting structural reductions in LTL mode, iteration 1 : 140/168 places, 164/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26732 ms. Remains : 140/168 places, 164/197 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-09
Stuttering criterion allowed to conclude after 1754 steps with 5 reset in 13 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-09 finished in 26892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||((!p1 U (p2||G(!p1))) U X(X(X(p3))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 160 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 160 transition count 189
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 155 transition count 182
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 155 transition count 182
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 150 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 150 transition count 176
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 145 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 145 transition count 171
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 142 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 140 transition count 164
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 138 transition count 162
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 138 transition count 162
Applied a total of 60 rules in 19 ms. Remains 138 /168 variables (removed 30) and now considering 162/197 (removed 35) transitions.
// Phase 1: matrix 162 rows 138 cols
[2025-06-03 03:40:02] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:40:02] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-03 03:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:40:02] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-03 03:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 162/300 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:05] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:06] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:06] [INFO ] Deduced a trap composed of 9 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 03:40:06] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:06] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:06] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:06] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 148 constraints, problems are : Problem set: 0 solved, 161 unsolved in 12230 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/300 variables, 138/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 161/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 309 constraints, problems are : Problem set: 0 solved, 161 unsolved in 12397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24686ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 24687ms
Starting structural reductions in LTL mode, iteration 1 : 138/168 places, 162/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24905 ms. Remains : 138/168 places, 162/197 transitions.
Stuttering acceptance computed with spot in 918 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) p1 (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-11
Product exploration explored 100000 steps with 1984 reset in 594 ms.
Product exploration explored 100000 steps with 2052 reset in 442 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 278 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p3) p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 137 ms. Reduced automaton from 18 states, 35 edges and 4 AP (stutter sensitive) to 12 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 518 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 2074 steps (4 resets) in 68 ms. (30 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p3) p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR p1 p2))), (F (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND p2 p0 (NOT p3))))), (F p3), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (OR p1 p0 p3) (OR (NOT p2) p0 p3)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F p1)]
Knowledge based reduction with 11 factoid took 575 ms. Reduced automaton from 12 states, 20 edges and 4 AP (stutter sensitive) to 12 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 615 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 575 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2025-06-03 03:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:40:31] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-03 03:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:40:31] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-03 03:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 162/300 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:35] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:36] [INFO ] Deduced a trap composed of 8 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 03:40:36] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:36] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:36] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:36] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:36] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:40:36] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 148 constraints, problems are : Problem set: 0 solved, 161 unsolved in 13319 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/300 variables, 138/148 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 161/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 309 constraints, problems are : Problem set: 0 solved, 161 unsolved in 13298 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26648ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 26649ms
Finished structural reductions in LTL mode , in 1 iterations and 26955 ms. Remains : 138/138 places, 162/162 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 278 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 12 states, 20 edges and 4 AP (stutter sensitive) to 12 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 2062 steps (5 resets) in 34 ms. (58 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 p0)]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 p2 (NOT p3))))), (F (NOT (OR p1 p2))), (F p3), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT (AND (OR p0 p1 p3) (OR p0 (NOT p2) p3)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F p1)]
Knowledge based reduction with 1 factoid took 473 ms. Reduced automaton from 12 states, 20 edges and 4 AP (stutter sensitive) to 12 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 602 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 573 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 628 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 2138 reset in 328 ms.
Product exploration explored 100000 steps with 2042 reset in 415 ms.
Applying partial POR strategy [false, false, false, true, true, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 637 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 162/162 transitions.
Graph (complete) has 278 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 137 transition count 161
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 17 place count 137 transition count 161
Deduced a syphon composed of 41 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 42 place count 137 transition count 161
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 61 place count 137 transition count 169
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 136 transition count 168
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 136 transition count 168
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 136 transition count 202
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 130 transition count 190
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 130 transition count 190
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 110 place count 112 transition count 160
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 128 place count 112 transition count 160
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 145 place count 95 transition count 132
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 162 place count 95 transition count 132
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 166 place count 91 transition count 128
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 170 place count 91 transition count 128
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 178 place count 83 transition count 116
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 186 place count 83 transition count 116
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 200 place count 69 transition count 94
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 214 place count 69 transition count 94
Deduced a syphon composed of 37 places in 0 ms
Applied a total of 214 rules in 57 ms. Remains 69 /138 variables (removed 69) and now considering 94/162 (removed 68) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:41:03] [INFO ] Redundant transitions in 3 ms returned []
Running 93 sub problems to find dead transitions.
[2025-06-03 03:41:03] [INFO ] Flow matrix only has 89 transitions (discarded 5 similar events)
// Phase 1: matrix 89 rows 69 cols
[2025-06-03 03:41:03] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 03:41:03] [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/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 90 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 4 (OVERLAPS) 89/158 variables, 69/73 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/74 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/74 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/158 variables, 0/74 constraints. Problems are: Problem set: 53 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 74 constraints, problems are : Problem set: 53 solved, 40 unsolved in 3637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 4/35 variables, 2/2 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/4 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 87/122 variables, 35/39 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/40 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 40/80 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 36/158 variables, 34/114 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/114 constraints. Problems are: Problem set: 53 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/114 constraints. Problems are: Problem set: 53 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 114 constraints, problems are : Problem set: 53 solved, 40 unsolved in 2848 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/93 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6512ms problems are : Problem set: 53 solved, 40 unsolved
Search for dead transitions found 53 dead transitions in 6512ms
Found 53 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 53 transitions
Dead transitions reduction (with SMT) removed 53 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 69/138 places, 41/162 transitions.
Graph (complete) has 89 edges and 69 vertex of which 32 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /69 variables (removed 37) and now considering 41/41 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/138 places, 41/162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6586 ms. Remains : 32/138 places, 41/162 transitions.
Built C files in :
/tmp/ltsmin15605455235681862461
[2025-06-03 03:41:09] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15605455235681862461
Running compilation step : cd /tmp/ltsmin15605455235681862461;'/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 814 ms.
Running link step : cd /tmp/ltsmin15605455235681862461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin15605455235681862461;'/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/stateBased10249538325106529626.hoa' '--buchi-type=spotba'
LTSmin run took 1710 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-11 finished in 70240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(p2)))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 160 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 160 transition count 188
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 155 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 155 transition count 181
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 150 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 150 transition count 176
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 146 transition count 172
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 146 transition count 172
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 144 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 144 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 142 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 140 transition count 164
Applied a total of 56 rules in 22 ms. Remains 140 /168 variables (removed 28) and now considering 164/197 (removed 33) transitions.
// Phase 1: matrix 164 rows 140 cols
[2025-06-03 03:41:12] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:41:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-03 03:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:41:12] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-03 03:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 164/304 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:17] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:17] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:17] [INFO ] Deduced a trap composed of 9 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 03:41:18] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:18] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:18] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:18] [INFO ] Deduced a trap composed of 13 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 03:41:18] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 150 constraints, problems are : Problem set: 0 solved, 163 unsolved in 13909 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/304 variables, 140/150 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 163/313 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 313 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12984 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26913ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 26915ms
Starting structural reductions in LTL mode, iteration 1 : 140/168 places, 164/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27203 ms. Remains : 140/168 places, 164/197 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-13 finished in 27416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((p1 U (G(p1)||(p1&&(!p0 U (p2||G(!p0)))))))))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Graph (complete) has 331 edges and 168 vertex of which 164 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 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 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 163 transition count 168
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 139 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 137 transition count 166
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 53 place count 137 transition count 141
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 103 place count 112 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 107 transition count 135
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 107 transition count 135
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 117 place count 103 transition count 130
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 103 transition count 130
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 100 transition count 125
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 100 transition count 125
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 98 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 98 transition count 123
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 203 place count 62 transition count 87
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 210 place count 55 transition count 74
Iterating global reduction 3 with 7 rules applied. Total rules applied 217 place count 55 transition count 74
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 224 place count 48 transition count 65
Iterating global reduction 3 with 7 rules applied. Total rules applied 231 place count 48 transition count 65
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 238 place count 41 transition count 52
Iterating global reduction 3 with 7 rules applied. Total rules applied 245 place count 41 transition count 52
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 252 place count 34 transition count 44
Iterating global reduction 3 with 7 rules applied. Total rules applied 259 place count 34 transition count 44
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 265 place count 28 transition count 33
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 28 transition count 33
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 277 place count 22 transition count 26
Iterating global reduction 3 with 6 rules applied. Total rules applied 283 place count 22 transition count 26
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 285 place count 20 transition count 23
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 20 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 288 place count 20 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 290 place count 18 transition count 20
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 292 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 293 place count 16 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 293 place count 16 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 297 place count 14 transition count 17
Applied a total of 297 rules in 34 ms. Remains 14 /168 variables (removed 154) and now considering 17/197 (removed 180) transitions.
[2025-06-03 03:41:39] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 14 cols
[2025-06-03 03:41:39] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:41:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 03:41:39] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2025-06-03 03:41:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:41:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 03:41:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:41:40] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2025-06-03 03:41:40] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2025-06-03 03:41:40] [INFO ] Invariant cache hit.
[2025-06-03 03:41:40] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 16/29 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 1/30 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 16 constraints, problems are : Problem set: 0 solved, 15 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 16/29 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/30 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 31 constraints, problems are : Problem set: 0 solved, 15 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 706ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 706ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/168 places, 17/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 843 ms. Remains : 14/168 places, 17/197 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-14
Stuttering criterion allowed to conclude after 3214 steps with 149 reset in 8 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-14 finished in 1001 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 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 197/197 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 159 transition count 187
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 159 transition count 187
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 153 transition count 179
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 153 transition count 179
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 147 transition count 172
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 147 transition count 172
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 142 transition count 167
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 142 transition count 167
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 139 transition count 162
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 139 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 137 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 137 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 135 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 135 transition count 158
Applied a total of 66 rules in 13 ms. Remains 135 /168 variables (removed 33) and now considering 158/197 (removed 39) transitions.
// Phase 1: matrix 158 rows 135 cols
[2025-06-03 03:41:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:41:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-03 03:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:41:41] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2025-06-03 03:41:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 158/293 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:45] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:45] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:46] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:46] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:46] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:46] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:46] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:41:46] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 145 constraints, problems are : Problem set: 0 solved, 157 unsolved in 13649 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/293 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 157/302 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 302 constraints, problems are : Problem set: 0 solved, 157 unsolved in 11599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25276ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 25277ms
Starting structural reductions in LTL mode, iteration 1 : 135/168 places, 158/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25534 ms. Remains : 135/168 places, 158/197 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-15 finished in 25688 ms.
All properties solved by simple procedures.
Total runtime 254941 ms.
BK_STOP 1748922126615
--------------------
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-08b"
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-08b, 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-174854064600652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08b.tgz
mv DiscoveryGPU-PT-08b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;