Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600276.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 ErlangenMainframeV0-PT-0505, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.6K Jun 6 09:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 6 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 11:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 11:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Jun 6 09:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Jun 6 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 485K Jun 5 20:08 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 ErlangenMainframeV0-PT-0505-LTLFireability-00
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-01
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-02
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-03
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-04
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-05
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-06
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-07
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-08
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-09
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-10
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-11
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-12
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-13
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-14
FORMULA_NAME ErlangenMainframeV0-PT-0505-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749352585532

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0505
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-08 03:16:26] [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-08 03:16:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:16:26] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-06-08 03:16:26] [INFO ] Transformed 203 places.
[2025-06-08 03:16:26] [INFO ] Transformed 949 transitions.
[2025-06-08 03:16:26] [INFO ] Found NUPN structural information;
[2025-06-08 03:16:26] [INFO ] Parsed PT model containing 203 places and 949 transitions and 10344 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 949/949 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 152 transition count 898
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 152 transition count 898
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 126 place count 128 transition count 874
Iterating global reduction 0 with 24 rules applied. Total rules applied 150 place count 128 transition count 874
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 151 place count 127 transition count 873
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 127 transition count 873
Applied a total of 152 rules in 58 ms. Remains 127 /203 variables (removed 76) and now considering 873/949 (removed 76) transitions.
// Phase 1: matrix 873 rows 127 cols
[2025-06-08 03:16:27] [INFO ] Computed 16 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:16:27] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-08 03:16:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:16:27] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 872 sub problems to find dead transitions.
[2025-06-08 03:16:27] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:16:36] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:16:36] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:16:37] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 5 (OVERLAPS) 873/1000 variables, 127/146 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:16:52] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 147 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 872/128 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 872 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:02] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 6 (OVERLAPS) 873/1000 variables, 127/148 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 128/276 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:17:20] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 277 constraints, problems are : Problem set: 0 solved, 872 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 872/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61757ms problems are : Problem set: 0 solved, 872 unsolved
Search for dead transitions found 0 dead transitions in 61781ms
Starting structural reductions in LTL mode, iteration 1 : 127/203 places, 873/949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62416 ms. Remains : 127/203 places, 873/949 transitions.
Support contains 41 out of 127 places after structural reductions.
[2025-06-08 03:17:30] [INFO ] Flatten gal took : 220 ms
[2025-06-08 03:17:30] [INFO ] Flatten gal took : 100 ms
[2025-06-08 03:17:30] [INFO ] Input system was already deterministic with 873 transitions.
Reduction of identical properties reduced properties to check from 42 to 41
RANDOM walk for 40000 steps (8 resets) in 1962 ms. (20 steps per ms) remains 30/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
[2025-06-08 03:17:31] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/60 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 35/95 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 32/127 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 873/1000 variables, 127/143 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/1000 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 143 constraints, problems are : Problem set: 1 solved, 29 unsolved in 3683 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 30/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 29 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 26/60 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 35/95 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 32/127 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 873/1000 variables, 127/143 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/1000 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 143 constraints, problems are : Problem set: 1 solved, 29 unsolved in 3154 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 29/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6931ms problems are : Problem set: 1 solved, 29 unsolved
Fused 29 Parikh solutions to 26 different solutions.
Parikh walk visited 23 properties in 852 ms.
Support contains 13 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 873/873 transitions.
Graph (trivial) has 93 edges and 127 vertex of which 6 / 127 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 124 transition count 852
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 109 transition count 852
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 31 place count 109 transition count 838
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 59 place count 95 transition count 838
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 89 transition count 501
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 89 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 89 transition count 500
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 72 place count 89 transition count 497
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 86 transition count 497
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 79 place count 85 transition count 416
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 85 transition count 416
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 142 place count 54 transition count 385
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 52 transition count 373
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 52 transition count 373
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 52 transition count 371
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 152 place count 50 transition count 389
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 50 transition count 388
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 155 place count 50 transition count 386
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 165 place count 50 transition count 376
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 188 place count 40 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 197 place count 40 transition count 354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 198 place count 39 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 199 place count 38 transition count 353
Applied a total of 199 rules in 239 ms. Remains 38 /127 variables (removed 89) and now considering 353/873 (removed 520) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 38/127 places, 353/873 transitions.
RANDOM walk for 37870 steps (8 resets) in 1211 ms. (31 steps per ms) remains 0/6 properties
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 18 stable transitions
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&&F(((p3 U p4)&&p2))))))'
Support contains 13 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Graph (trivial) has 85 edges and 127 vertex of which 4 / 127 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 124 transition count 856
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 110 transition count 856
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 110 transition count 844
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 98 transition count 844
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 90 transition count 645
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 90 transition count 645
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 69 place count 90 transition count 642
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 87 transition count 642
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 86 transition count 480
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 86 transition count 480
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 85 transition count 478
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 85 transition count 478
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 135 place count 57 transition count 450
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 54 transition count 417
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 54 transition count 417
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 143 place count 54 transition count 415
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 53 transition count 307
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 53 transition count 307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 51 transition count 318
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 51 transition count 318
Applied a total of 151 rules in 117 ms. Remains 51 /127 variables (removed 76) and now considering 318/873 (removed 555) transitions.
[2025-06-08 03:17:40] [INFO ] Flow matrix only has 303 transitions (discarded 15 similar events)
// Phase 1: matrix 303 rows 51 cols
[2025-06-08 03:17:40] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:17:40] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-08 03:17:40] [INFO ] Flow matrix only has 303 transitions (discarded 15 similar events)
[2025-06-08 03:17:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:17:40] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-08 03:17:41] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:17:41] [INFO ] Redundant transitions in 21 ms returned []
Running 316 sub problems to find dead transitions.
[2025-06-08 03:17:41] [INFO ] Flow matrix only has 303 transitions (discarded 15 similar events)
[2025-06-08 03:17:41] [INFO ] Invariant cache hit.
[2025-06-08 03:17:41] [INFO ] State equation strengthened by 119 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 302/353 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 186 constraints, problems are : Problem set: 0 solved, 316 unsolved in 22130 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 316/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 302/353 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 118/185 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 58/243 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/354 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 244 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 51/51 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 316/58 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52700ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 52702ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/127 places, 318/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53441 ms. Remains : 51/127 places, 318/873 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4)))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-00
Stuttering criterion allowed to conclude after 74692 steps with 0 reset in 345 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-00 finished in 54161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 9 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 628
Ensure Unique test removed 4 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 30 place count 110 transition count 628
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 104 transition count 283
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 104 transition count 283
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 101 transition count 279
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 49 place count 100 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 50 place count 99 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 99 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 52 place count 98 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 98 transition count 229
Applied a total of 53 rules in 13 ms. Remains 98 /127 variables (removed 29) and now considering 229/873 (removed 644) transitions.
// Phase 1: matrix 229 rows 98 cols
[2025-06-08 03:18:34] [INFO ] Computed 11 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:18:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-08 03:18:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:18:34] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2025-06-08 03:18: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/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:36] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:36] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/327 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 0/327 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 111 constraints, problems are : Problem set: 0 solved, 228 unsolved in 8919 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:44] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 229/327 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 228/340 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:48] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:58] [INFO ] Deduced a trap along path composed of 7 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:58] [INFO ] Deduced a trap along path composed of 11 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:18:58] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:01] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/327 variables, and 345 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 39122ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 39123ms
Starting structural reductions in LTL mode, iteration 1 : 98/127 places, 229/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39291 ms. Remains : 98/127 places, 229/873 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 170 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 1 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-01 finished in 39643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U X(p1))||X(p2))))'
Support contains 10 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 121 transition count 734
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 121 transition count 734
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 116 transition count 461
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 116 transition count 461
Applied a total of 22 rules in 12 ms. Remains 116 /127 variables (removed 11) and now considering 461/873 (removed 412) transitions.
// Phase 1: matrix 461 rows 116 cols
[2025-06-08 03:19:14] [INFO ] Computed 16 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:19:14] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-08 03:19:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:19:14] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-08 03:19:14] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:18] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:18] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (OVERLAPS) 461/577 variables, 116/134 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:24] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:24] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:24] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:25] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 577/577 variables, and 138 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 460/136 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:46] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 461/577 variables, 116/139 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 136/275 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:53] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:53] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:53] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:53] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:19:53] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:20:09] [INFO ] Deduced a trap along path composed of 10 places in 151 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:20:09] [INFO ] Deduced a trap along path composed of 11 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:20:12] [INFO ] Deduced a trap along path composed of 3 places in 117 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/577 variables, and 283 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 460/136 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60727ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60729ms
Starting structural reductions in LTL mode, iteration 1 : 116/127 places, 461/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61145 ms. Remains : 116/127 places, 461/873 transitions.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-02
Product exploration explored 100000 steps with 720 reset in 201 ms.
Stack based approach found an accepted trace after 83 steps with 0 reset with depth 84 and stack size 84 in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-02 finished in 61644 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||G(p1)))))'
Support contains 8 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Graph (trivial) has 93 edges and 127 vertex of which 6 / 127 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 123 transition count 855
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 109 transition count 855
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 109 transition count 842
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 96 transition count 842
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 88 transition count 415
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 88 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 88 transition count 414
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 72 place count 88 transition count 411
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 85 transition count 411
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 82 transition count 240
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 82 transition count 240
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 148 place count 50 transition count 208
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 48 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 48 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 154 place count 48 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 156 place count 47 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 47 transition count 198
Applied a total of 159 rules in 50 ms. Remains 47 /127 variables (removed 80) and now considering 198/873 (removed 675) transitions.
[2025-06-08 03:20:15] [INFO ] Flow matrix only has 184 transitions (discarded 14 similar events)
// Phase 1: matrix 184 rows 47 cols
[2025-06-08 03:20:15] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:20:15] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-08 03:20:15] [INFO ] Flow matrix only has 184 transitions (discarded 14 similar events)
[2025-06-08 03:20:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:20:15] [INFO ] State equation strengthened by 88 read => feed constraints.
[2025-06-08 03:20:16] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:20:16] [INFO ] Redundant transitions in 2 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-08 03:20:16] [INFO ] Flow matrix only has 184 transitions (discarded 14 similar events)
[2025-06-08 03:20:16] [INFO ] Invariant cache hit.
[2025-06-08 03:20:16] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 183/230 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 87/150 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 1/231 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 151 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8889 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 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/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 183/230 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 87/150 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 196/346 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 1/231 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 347 constraints, problems are : Problem set: 0 solved, 196 unsolved in 20270 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29415ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 29416ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/127 places, 198/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29727 ms. Remains : 47/127 places, 198/873 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-04 finished in 29809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Graph (trivial) has 91 edges and 127 vertex of which 6 / 127 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 123 transition count 856
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 110 transition count 856
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 110 transition count 843
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 97 transition count 843
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 66 place count 84 transition count 347
Ensure Unique test removed 4 places
Iterating global reduction 2 with 17 rules applied. Total rules applied 83 place count 80 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 80 transition count 346
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 80 transition count 344
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 78 transition count 344
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 97 place count 69 transition count 103
Iterating global reduction 3 with 9 rules applied. Total rules applied 106 place count 69 transition count 103
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 65 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 65 transition count 95
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
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 164 place count 40 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 38 transition count 62
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 37 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 37 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 36 transition count 60
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 36 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 35 transition count 59
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 184 place count 30 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 194 place count 30 transition count 66
Applied a total of 194 rules in 35 ms. Remains 30 /127 variables (removed 97) and now considering 66/873 (removed 807) transitions.
[2025-06-08 03:20:45] [INFO ] Flow matrix only has 51 transitions (discarded 15 similar events)
// Phase 1: matrix 51 rows 30 cols
[2025-06-08 03:20:45] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:20:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-08 03:20:45] [INFO ] Flow matrix only has 51 transitions (discarded 15 similar events)
[2025-06-08 03:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:20:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-08 03:20:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:20:45] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-08 03:20:45] [INFO ] Flow matrix only has 51 transitions (discarded 15 similar events)
[2025-06-08 03:20:45] [INFO ] Invariant cache hit.
[2025-06-08 03:20:45] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 50/80 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 51 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 50/80 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 63/113 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 114 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2819ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2819ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/127 places, 66/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2945 ms. Remains : 30/127 places, 66/873 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-05
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-05 finished in 2990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((p1 U p2)))))'
Support contains 8 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 628
Ensure Unique test removed 4 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 30 place count 110 transition count 628
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 103 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 103 transition count 235
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 98 transition count 227
Ensure Unique test removed 1 places
Iterating global reduction 0 with 6 rules applied. Total rules applied 55 place count 97 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 56 place count 96 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 96 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 58 place count 95 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 59 place count 95 transition count 193
Applied a total of 59 rules in 11 ms. Remains 95 /127 variables (removed 32) and now considering 193/873 (removed 680) transitions.
// Phase 1: matrix 193 rows 95 cols
[2025-06-08 03:20:48] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:20:48] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-08 03:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:20:48] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-06-08 03:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:20:49] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:20:50] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/288 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 108 constraints, problems are : Problem set: 0 solved, 192 unsolved in 6832 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:20:56] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 193/288 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 192/301 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:20:59] [INFO ] Deduced a trap along path composed of 7 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:00] [INFO ] Deduced a trap along path composed of 11 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:05] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 0/288 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 304 constraints, problems are : Problem set: 0 solved, 192 unsolved in 29090 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 35999ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 36000ms
Starting structural reductions in LTL mode, iteration 1 : 95/127 places, 193/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36147 ms. Remains : 95/127 places, 193/873 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-07
Product exploration explored 100000 steps with 12 reset in 143 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-07 finished in 36378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U ((p1&&X(p0))||X(G(p0))))&&X(F(((!p2&&X(F(!p2)))||G(F(!p2)))))))'
Support contains 9 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 115 transition count 629
Ensure Unique test removed 4 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 28 place count 111 transition count 629
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 105 transition count 237
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 105 transition count 237
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 103 transition count 234
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 103 transition count 234
Applied a total of 44 rules in 10 ms. Remains 103 /127 variables (removed 24) and now considering 234/873 (removed 639) transitions.
// Phase 1: matrix 234 rows 103 cols
[2025-06-08 03:21:24] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:21:25] [INFO ] Implicit Places using invariants in 52 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/127 places, 234/873 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 102/127 places, 234/873 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p2), p2, (NOT p0), (NOT p0), p2, true]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-08
Entered a terminal (fully accepting) state of product in 16 steps with 5 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-08 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(G(p1))))))'
Support contains 11 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 628
Ensure Unique test removed 4 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 30 place count 110 transition count 628
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 106 transition count 463
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 106 transition count 463
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 103 transition count 459
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 102 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 46 place count 101 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 101 transition count 351
Applied a total of 47 rules in 10 ms. Remains 101 /127 variables (removed 26) and now considering 351/873 (removed 522) transitions.
// Phase 1: matrix 351 rows 101 cols
[2025-06-08 03:21:25] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:21:25] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-08 03:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:21:25] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 350 sub problems to find dead transitions.
[2025-06-08 03:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:28] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:28] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 351/452 variables, 101/114 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 114 constraints, problems are : Problem set: 0 solved, 350 unsolved in 16949 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:44] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 351/452 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 350/465 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:54] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:54] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:55] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:55] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:55] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:55] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:55] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:55] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:21:55] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 9/474 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 474 constraints, problems are : Problem set: 0 solved, 350 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47631ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 47635ms
Starting structural reductions in LTL mode, iteration 1 : 101/127 places, 351/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47825 ms. Remains : 101/127 places, 351/873 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 236 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1806259 steps, run timeout after 3001 ms. (steps per millisecond=601 ) properties seen :0 out of 1
Probabilistic random walk after 1806259 steps, saw 604991 distinct states, run finished after 3006 ms. (steps per millisecond=600 ) properties seen :0
[2025-06-08 03:22:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/101 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 351/452 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/101 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 351/452 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:17] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 351/351 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 351/351 (removed 0) transitions.
[2025-06-08 03:22:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:22:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-08 03:22:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:22:18] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 350 sub problems to find dead transitions.
[2025-06-08 03:22:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:21] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:21] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 351/452 variables, 101/114 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (OVERLAPS) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 114 constraints, problems are : Problem set: 0 solved, 350 unsolved in 16854 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:36] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (OVERLAPS) 351/452 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 350/465 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:47] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:47] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:47] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:48] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:48] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:48] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:48] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:48] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:22:48] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 9/474 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 474 constraints, problems are : Problem set: 0 solved, 350 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47531ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 47533ms
Finished structural reductions in LTL mode , in 1 iterations and 47716 ms. Remains : 101/101 places, 351/351 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1651258 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :0 out of 1
Probabilistic random walk after 1651258 steps, saw 565024 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
[2025-06-08 03:23:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/101 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 351/452 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/101 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 351/452 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:09] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/452 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 263 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 351/351 transitions.
Graph (trivial) has 75 edges and 101 vertex of which 4 / 101 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 99 transition count 349
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 11 place count 99 transition count 359
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 99 transition count 359
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 28 place count 90 transition count 201
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 37 place count 90 transition count 201
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 68 place count 90 transition count 201
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 81 place count 77 transition count 173
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 94 place count 77 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 77 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 75 transition count 169
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 75 transition count 169
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 75 transition count 181
Deduced a syphon composed of 35 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 117 place count 75 transition count 169
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 71 transition count 165
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 71 transition count 165
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 125 rules in 29 ms. Remains 71 /101 variables (removed 30) and now considering 165/351 (removed 186) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:23:11] [INFO ] Redundant transitions in 2 ms returned []
Running 164 sub problems to find dead transitions.
[2025-06-08 03:23:11] [INFO ] Flow matrix only has 160 transitions (discarded 5 similar events)
// Phase 1: matrix 160 rows 71 cols
[2025-06-08 03:23:11] [INFO ] Computed 11 invariants in 1 ms
[2025-06-08 03:23:11] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 11/22 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 159/230 variables, 71/93 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 36/129 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/129 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 1/231 variables, 1/130 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/130 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/130 constraints. Problems are: Problem set: 44 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 130 constraints, problems are : Problem set: 44 solved, 120 unsolved in 6354 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 71/71 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 32/71 variables, 11/11 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 11/22 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/22 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 159/230 variables, 71/93 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 36/129 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 120/249 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/249 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 1/231 variables, 1/250 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 0/250 constraints. Problems are: Problem set: 44 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/231 variables, 0/250 constraints. Problems are: Problem set: 44 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 250 constraints, problems are : Problem set: 44 solved, 120 unsolved in 14661 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 71/71 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 120/164 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21140ms problems are : Problem set: 44 solved, 120 unsolved
Search for dead transitions found 44 dead transitions in 21141ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 71/101 places, 121/351 transitions.
Graph (complete) has 235 edges and 71 vertex of which 40 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.3 ms
Discarding 31 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 40 /71 variables (removed 31) and now considering 134/121 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/101 places, 134/351 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21194 ms. Remains : 40/101 places, 134/351 transitions.
Built C files in :
/tmp/ltsmin12315522518098492826
[2025-06-08 03:23:32] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12315522518098492826
Running compilation step : cd /tmp/ltsmin12315522518098492826;'/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 925 ms.
Running link step : cd /tmp/ltsmin12315522518098492826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin12315522518098492826;'/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/stateBased8167836053444164944.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 351/351 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 199
Applied a total of 6 rules in 8 ms. Remains 98 /101 variables (removed 3) and now considering 199/351 (removed 152) transitions.
// Phase 1: matrix 199 rows 98 cols
[2025-06-08 03:23:47] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:23:47] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-08 03:23:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:23:47] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-08 03:23:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:49] [INFO ] Deduced a trap composed of 20 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-08 03:23:49] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/297 variables, 98/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 111 constraints, problems are : Problem set: 0 solved, 198 unsolved in 7177 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:55] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/297 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 198/310 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:58] [INFO ] Deduced a trap composed of 13 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-08 03:23:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:58] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:58] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:58] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:58] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:58] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:59] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:23:59] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 10/320 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:24:03] [INFO ] Deduced a trap along path composed of 3 places in 78 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:24:03] [INFO ] Deduced a trap along path composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:24:10] [INFO ] Deduced a trap along path composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/297 variables, and 323 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 37272ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 37274ms
Starting structural reductions in LTL mode, iteration 1 : 98/101 places, 199/351 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37452 ms. Remains : 98/101 places, 199/351 transitions.
Built C files in :
/tmp/ltsmin1826221092474657906
[2025-06-08 03:24:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1826221092474657906
Running compilation step : cd /tmp/ltsmin1826221092474657906;'/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 384 ms.
Running link step : cd /tmp/ltsmin1826221092474657906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1826221092474657906;'/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/stateBased13599907339772847859.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 03:24:40] [INFO ] Flatten gal took : 10 ms
[2025-06-08 03:24:40] [INFO ] Flatten gal took : 9 ms
[2025-06-08 03:24:40] [INFO ] Time to serialize gal into /tmp/LTL6641434726230979178.gal : 4 ms
[2025-06-08 03:24:40] [INFO ] Time to serialize properties into /tmp/LTL5888044378803236169.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6641434726230979178.gal' '-t' 'CGAL' '-hoa' '/tmp/aut727954031490132546.hoa' '-atoms' '/tmp/LTL5888044378803236169.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL5888044378803236169.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut727954031490132546.hoa
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t13, t16, t46, t49, t54, t58, t61, t62, t67, t69, t73, t79, t80, t84, t85, t94, t95,...674
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1264 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.6759,330028,1,0,606,1.24288e+06,427,288,5602,1.73341e+06,930
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-09 finished in 210005 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||(G(p2)&&p1)))))'
Support contains 13 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Graph (trivial) has 85 edges and 127 vertex of which 4 / 127 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 124 transition count 856
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 110 transition count 856
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 110 transition count 844
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 98 transition count 844
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 89 transition count 629
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 89 transition count 629
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 71 place count 89 transition count 626
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 86 transition count 626
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 84 transition count 356
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 84 transition count 356
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 83 transition count 354
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 83 transition count 354
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 135 place count 57 transition count 328
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 55 transition count 311
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 55 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 141 place count 55 transition count 309
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 53 transition count 320
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 146 place count 53 transition count 319
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 150 place count 53 transition count 319
Applied a total of 150 rules in 70 ms. Remains 53 /127 variables (removed 74) and now considering 319/873 (removed 554) transitions.
[2025-06-08 03:24:55] [INFO ] Flow matrix only has 304 transitions (discarded 15 similar events)
// Phase 1: matrix 304 rows 53 cols
[2025-06-08 03:24:55] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:24:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-08 03:24:55] [INFO ] Flow matrix only has 304 transitions (discarded 15 similar events)
[2025-06-08 03:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:24:55] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-08 03:24:55] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:24:55] [INFO ] Redundant transitions in 6 ms returned []
Running 317 sub problems to find dead transitions.
[2025-06-08 03:24:55] [INFO ] Flow matrix only has 304 transitions (discarded 15 similar events)
[2025-06-08 03:24:55] [INFO ] Invariant cache hit.
[2025-06-08 03:24:55] [INFO ] State equation strengthened by 119 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 303/356 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 118/187 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/357 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/357 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 188 constraints, problems are : Problem set: 0 solved, 317 unsolved in 22135 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 53/53 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 317/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 303/356 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 118/187 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 69/256 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 1/357 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 257 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 53/53 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 317/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52670ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 52671ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/127 places, 319/873 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53003 ms. Remains : 53/127 places, 319/873 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-10 finished in 53167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (X(!p1)||G(p2)))))'
Support contains 14 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 114 transition count 628
Ensure Unique test removed 4 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 30 place count 110 transition count 628
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 106 transition count 463
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 106 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 104 transition count 461
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 43 place count 103 transition count 461
Applied a total of 43 rules in 15 ms. Remains 103 /127 variables (removed 24) and now considering 461/873 (removed 412) transitions.
// Phase 1: matrix 461 rows 103 cols
[2025-06-08 03:25:48] [INFO ] Computed 11 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:25:48] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-08 03:25:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:25:48] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-08 03:25:48] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:25:52] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:25:52] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/564 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/564 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 116 constraints, problems are : Problem set: 0 solved, 460 unsolved in 25991 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 460/136 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:16] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (OVERLAPS) 461/564 variables, 103/117 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 136/253 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:21] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:22] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:22] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:22] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:22] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:22] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:44] [INFO ] Deduced a trap along path composed of 3 places in 92 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:44] [INFO ] Deduced a trap along path composed of 11 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 261 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 460/136 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 56725ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 56728ms
Starting structural reductions in LTL mode, iteration 1 : 103/127 places, 461/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56938 ms. Remains : 103/127 places, 461/873 transitions.
Stuttering acceptance computed with spot in 359 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Product exploration explored 100000 steps with 33333 reset in 90 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 12 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-12 finished in 57509 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) U X(X((F(p1) U G(p2))))))))'
Support contains 18 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 119 transition count 674
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 119 transition count 674
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 116 transition count 671
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 116 transition count 671
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 114 transition count 654
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 114 transition count 654
Applied a total of 26 rules in 10 ms. Remains 114 /127 variables (removed 13) and now considering 654/873 (removed 219) transitions.
// Phase 1: matrix 654 rows 114 cols
[2025-06-08 03:26:45] [INFO ] Computed 16 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:26:46] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-06-08 03:26:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:26:46] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 653 sub problems to find dead transitions.
[2025-06-08 03:26:46] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:52] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:26:52] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 5 (OVERLAPS) 654/768 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:02] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:02] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:02] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:02] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:02] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/768 variables, and 137 constraints, problems are : Problem set: 0 solved, 653 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 653/120 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 5 (OVERLAPS) 654/768 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/768 variables, 120/257 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:25] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:26] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:26] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:26] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:26] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:26] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/768 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:45] [INFO ] Deduced a trap along path composed of 4 places in 188 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:45] [INFO ] Deduced a trap along path composed of 11 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 265 constraints, problems are : Problem set: 0 solved, 653 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 653/120 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 61058ms problems are : Problem set: 0 solved, 653 unsolved
Search for dead transitions found 0 dead transitions in 61061ms
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 654/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61683 ms. Remains : 114/127 places, 654/873 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 265 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-13 finished in 62287 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((X(X(X(!p0))) U ((p1 U p2)&&(p3 U X(p4))))))'
Support contains 16 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 115 transition count 629
Ensure Unique test removed 4 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 28 place count 111 transition count 629
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 108 transition count 626
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 108 transition count 626
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 106 transition count 624
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 39 place count 105 transition count 624
Applied a total of 39 rules in 19 ms. Remains 105 /127 variables (removed 22) and now considering 624/873 (removed 249) transitions.
// Phase 1: matrix 624 rows 105 cols
[2025-06-08 03:27:48] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:27:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-08 03:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:27:48] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 623 sub problems to find dead transitions.
[2025-06-08 03:27:48] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:53] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:53] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:27:53] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 624/729 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/729 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 1.0)
(t9 1.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 1.0)
(t15 1.0)
(t16 1.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 1.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 1.0)
(t37 1.0)
(t38 1.0)
(t39 1.0)
(t40 1.0)
(t41 4.0)
(t42 1.0)
(t43 1.0)
(t44 0.0)
(t45 2.0)
(t46 3.0)
(t47 2.0)
(t48 1.0)
(t49 2.0)
(t50 0.0)
(t51 1.0)
(t52 2.0)
(t53 3.0)
(t54 1.0)
(t55 1.0)
(t56 0.0)
(t57 0.0)
(t58 1.0)
(t59 1.0)
(t60 1.0)
(t61 1.0)
(t62 0.0)
(t63 0.0)
(t64 1.0)
(t65 1.0)
(t66 1.0)
(t67 1.0)
(t68 1.0)
(t69 0.0)
(t70 0.0)
(t71 1.0)
(t72 1.0)
(t73 1.0)
(t74 0.0)
(t75 1.0)
(t76 0.0)
(t77 1.0)
(t78 1.0)
(t79 0.0)
(t80 1.0)
(t81 0.0)
(t82 1.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 0.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 0.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 0.0)
(t288 0.0)
(t289 0.0)
(t290 0.0)
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 0.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 0.0)
(t308 0.0)
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 0.0)
(t315 0.0)
(t316 0.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 0.0)
(t342 0.0)
(t343 0.0)
(t344 0.0)
(t345 0.0)
(t346 0.0)
(t347 0.0)
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 0.0)
(t353 0.0)
(t354 0.0)
(t355 0.0)
(t356 0.0)
(t357 0.0)
(t358 0.0)
(t359 0.0)
(t360 0.0)
(t361 0.0)
(t362 0.0)
(t363 0.0)
(t364 0.0)
(t365 0.0)
(t366 0.0)
(t367 0.0)
(t368 0.0)
(t369 0.0)
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 0.0)
(t377 0.0)
(t378 0.0)
(t379 0.0)
(t380 0.0)
(t381 0.0)
(t382 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 729/729 variables, and 119 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 623/123 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 624/729 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/729 variables, 123/242 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:26] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:26] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:26] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:26] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:27] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:27] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:27] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:27] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:27] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:27] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:27] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:28] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 12/254 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:49] [INFO ] Deduced a trap along path composed of 3 places in 107 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:49] [INFO ] Deduced a trap along path composed of 11 places in 48 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 729/729 variables, and 256 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 623/123 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 61028ms problems are : Problem set: 0 solved, 623 unsolved
Search for dead transitions found 0 dead transitions in 61030ms
Starting structural reductions in LTL mode, iteration 1 : 105/127 places, 624/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61260 ms. Remains : 105/127 places, 624/873 transitions.
Stuttering acceptance computed with spot in 724 ms :[(OR (NOT p2) (NOT p4)), (OR (NOT p2) (NOT p4) p0), (NOT p2), (NOT p4), (NOT p4), p0, p0, true, (AND p0 (NOT p2)), (AND p0 (NOT p4)), (AND p0 (NOT p4)), (AND p0 (NOT p2)), (AND (NOT p4) p0), (AND p0 (NOT p4)), (NOT p2), (NOT p4), (NOT p4)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-14
Product exploration explored 100000 steps with 16586 reset in 101 ms.
Stack based approach found an accepted trace after 40500 steps with 6769 reset with depth 11 and stack size 11 in 45 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-14 finished in 62192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X((p0&&G(p1)))))&&(!p2 U (p3||G(!p2)))))'
Support contains 16 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 873/873 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 120 transition count 675
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 120 transition count 675
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 116 transition count 403
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 116 transition count 403
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 114 transition count 385
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 114 transition count 385
Applied a total of 26 rules in 11 ms. Remains 114 /127 variables (removed 13) and now considering 385/873 (removed 488) transitions.
// Phase 1: matrix 385 rows 114 cols
[2025-06-08 03:28:50] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:28:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-08 03:28:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:28:50] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2025-06-08 03:28:50] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:53] [INFO ] Deduced a trap composed of 20 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-08 03:28:53] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (OVERLAPS) 385/499 variables, 114/132 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:58] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:58] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:59] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:28:59] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 384 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 136 constraints, problems are : Problem set: 0 solved, 384 unsolved in 23827 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 384/136 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:29:16] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (OVERLAPS) 385/499 variables, 114/137 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 136/273 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:29:25] [INFO ] Deduced a trap along path composed of 3 places in 79 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:29:26] [INFO ] Deduced a trap along path composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 275 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 384/136 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54362ms problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 54364ms
Starting structural reductions in LTL mode, iteration 1 : 114/127 places, 385/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54594 ms. Remains : 114/127 places, 385/873 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), true, (OR (NOT p0) (NOT p1)), (AND (NOT p3) p2), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ErlangenMainframeV0-PT-0505-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ErlangenMainframeV0-PT-0505-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ErlangenMainframeV0-PT-0505-LTLFireability-15 finished in 54864 ms.
All properties solved by simple procedures.
Total runtime 798526 ms.

BK_STOP 1749353385311

--------------------
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="ErlangenMainframeV0-PT-0505"
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 ErlangenMainframeV0-PT-0505, 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 r254-tall-174931339600276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-0505.tgz
mv ErlangenMainframeV0-PT-0505 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;