Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.8M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749083678881

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 00:34:39] [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-05 00:34:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 00:34:40] [INFO ] Load time of PNML (sax parser for PT used): 432 ms
[2025-06-05 00:34:40] [INFO ] Transformed 6690 places.
[2025-06-05 00:34:40] [INFO ] Transformed 11934 transitions.
[2025-06-05 00:34:40] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4305 places in 30 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1082 places :
Symmetric choice reduction at 1 with 1082 rule applications. Total rules 1201 place count 1286 transition count 8161
Iterating global reduction 1 with 1082 rules applied. Total rules applied 2283 place count 1286 transition count 8161
Ensure Unique test removed 327 transitions
Reduce isomorphic transitions removed 327 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 2610 place count 1286 transition count 7834
Discarding 914 places :
Symmetric choice reduction at 2 with 914 rule applications. Total rules 3524 place count 372 transition count 6920
Iterating global reduction 2 with 914 rules applied. Total rules applied 4438 place count 372 transition count 6920
Ensure Unique test removed 5548 transitions
Reduce isomorphic transitions removed 5548 transitions.
Iterating post reduction 2 with 5548 rules applied. Total rules applied 9986 place count 372 transition count 1372
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 10032 place count 326 transition count 1326
Iterating global reduction 3 with 46 rules applied. Total rules applied 10078 place count 326 transition count 1326
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 10240 place count 326 transition count 1164
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 10248 place count 318 transition count 1156
Iterating global reduction 4 with 8 rules applied. Total rules applied 10256 place count 318 transition count 1156
Applied a total of 10256 rules in 373 ms. Remains 318 /2385 variables (removed 2067) and now considering 1156/11934 (removed 10778) transitions.
// Phase 1: matrix 1156 rows 318 cols
[2025-06-05 00:34:41] [INFO ] Computed 3 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:34:42] [INFO ] Implicit Places using invariants in 495 ms returned []
[2025-06-05 00:34:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:34:42] [INFO ] State equation strengthened by 871 read => feed constraints.
[2025-06-05 00:34:44] [INFO ] Implicit Places using invariants and state equation in 2405 ms returned []
Implicit Place search using SMT with State Equation took 3504 ms to find 0 implicit places.
Running 1155 sub problems to find dead transitions.
[2025-06-05 00:34:44] [INFO ] Invariant cache hit.
[2025-06-05 00:34:44] [INFO ] State equation strengthened by 871 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1155 unsolved
At refinement iteration 2 (OVERLAPS) 1/318 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/1474 variables, and 3 constraints, problems are : Problem set: 0 solved, 1155 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/318 constraints, ReadFeed: 0/871 constraints, PredecessorRefiner: 1155/1155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1155 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/317 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1155 unsolved
At refinement iteration 2 (OVERLAPS) 1/318 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1155 unsolved
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
At refinement iteration 4 (OVERLAPS) 1156/1474 variables, 318/321 constraints. Problems are: Problem set: 24 solved, 1131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1474 variables, 871/1192 constraints. Problems are: Problem set: 24 solved, 1131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1474/1474 variables, and 2323 constraints, problems are : Problem set: 24 solved, 1131 unsolved in 31102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 318/318 constraints, ReadFeed: 871/871 constraints, PredecessorRefiner: 1131/1155 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63997ms problems are : Problem set: 24 solved, 1131 unsolved
Search for dead transitions found 24 dead transitions in 64037ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 318/2385 places, 1132/11934 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 294 transition count 1120
Applied a total of 36 rules in 8 ms. Remains 294 /318 variables (removed 24) and now considering 1120/1132 (removed 12) transitions.
// Phase 1: matrix 1120 rows 294 cols
[2025-06-05 00:35:48] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:35:48] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-05 00:35:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:35:49] [INFO ] State equation strengthened by 867 read => feed constraints.
[2025-06-05 00:35:51] [INFO ] Implicit Places using invariants and state equation in 2354 ms returned []
Implicit Place search using SMT with State Equation took 2514 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 294/2385 places, 1120/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70464 ms. Remains : 294/2385 places, 1120/11934 transitions.
Support contains 33 out of 294 places after structural reductions.
[2025-06-05 00:35:51] [INFO ] Flatten gal took : 96 ms
[2025-06-05 00:35:51] [INFO ] Flatten gal took : 57 ms
[2025-06-05 00:35:51] [INFO ] Input system was already deterministic with 1120 transitions.
RANDOM walk for 40000 steps (6778 resets) in 2896 ms. (13 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (459 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (821 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
[2025-06-05 00:35:52] [INFO ] Invariant cache hit.
[2025-06-05 00:35:52] [INFO ] State equation strengthened by 867 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 379/456 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 126/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 8 (OVERLAPS) 958/1414 variables, 217/422 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1414 variables, 741/1163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1414 variables, 0/1163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1414 variables, 0/1163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 1163 constraints, problems are : Problem set: 1 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 294/294 constraints, ReadFeed: 867/867 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/74 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 278/352 variables, 74/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 25/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1059/1411 variables, 217/318 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1411 variables, 842/1160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1411 variables, 1/1161 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:35:53] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1411 variables, 1/1162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1411 variables, 0/1162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/1414 variables, 3/1165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1414 variables, 0/1165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1414 variables, 0/1165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 1165 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 294/294 constraints, ReadFeed: 867/867 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2872ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 375 ms.
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Graph (complete) has 1629 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 293 transition count 1111
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 38 place count 265 transition count 426
Iterating global reduction 1 with 28 rules applied. Total rules applied 66 place count 265 transition count 426
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 265 transition count 422
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 94 place count 241 transition count 398
Iterating global reduction 2 with 24 rules applied. Total rules applied 118 place count 241 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 121 place count 241 transition count 395
Discarding 84 places :
Symmetric choice reduction at 3 with 84 rule applications. Total rules 205 place count 157 transition count 311
Iterating global reduction 3 with 84 rules applied. Total rules applied 289 place count 157 transition count 311
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 369 place count 157 transition count 231
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 372 place count 154 transition count 192
Iterating global reduction 4 with 3 rules applied. Total rules applied 375 place count 154 transition count 192
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 377 place count 152 transition count 190
Iterating global reduction 4 with 2 rules applied. Total rules applied 379 place count 152 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 380 place count 152 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 384 place count 148 transition count 185
Iterating global reduction 5 with 4 rules applied. Total rules applied 388 place count 148 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 392 place count 148 transition count 181
Applied a total of 392 rules in 54 ms. Remains 148 /294 variables (removed 146) and now considering 181/1120 (removed 939) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 148/294 places, 181/1120 transitions.
RANDOM walk for 40000 steps (8455 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1531 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2227930 steps, run timeout after 3001 ms. (steps per millisecond=742 ) properties seen :0 out of 1
Probabilistic random walk after 2227930 steps, saw 979986 distinct states, run finished after 3006 ms. (steps per millisecond=741 ) properties seen :0
// Phase 1: matrix 181 rows 148 cols
[2025-06-05 00:35:59] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 00:35:59] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 187/322 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 48/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/329 variables, 7/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 148/148 constraints, ReadFeed: 49/49 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 187/322 variables, 139/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 48/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/329 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/329 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 148/148 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 181/181 transitions.
Applied a total of 0 rules in 11 ms. Remains 148 /148 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 148/148 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 181/181 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2025-06-05 00:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:35:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-05 00:35:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:35:59] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-05 00:36:00] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:36:00] [INFO ] Redundant transitions in 5 ms returned []
Running 180 sub problems to find dead transitions.
[2025-06-05 00:36:00] [INFO ] Invariant cache hit.
[2025-06-05 00:36:00] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:01] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:01] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:02] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 3 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:02] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 3 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:02] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 5/8 constraints. Problems are: Problem set: 22 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:02] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/9 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 181/329 variables, 148/157 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 49/206 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/206 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/206 constraints. Problems are: Problem set: 22 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 206 constraints, problems are : Problem set: 22 solved, 158 unsolved in 12856 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 148/148 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 19/148 variables, 3/3 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 6/9 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 181/329 variables, 148/157 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 49/206 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 158/364 constraints. Problems are: Problem set: 22 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:24] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 1/365 constraints. Problems are: Problem set: 22 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:36:36] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/366 constraints. Problems are: Problem set: 22 solved, 158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 329/329 variables, and 366 constraints, problems are : Problem set: 22 solved, 158 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 148/148 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 158/180 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42970ms problems are : Problem set: 22 solved, 158 unsolved
Search for dead transitions found 22 dead transitions in 42970ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 148/148 places, 159/181 transitions.
Graph (complete) has 405 edges and 148 vertex of which 130 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 127 transition count 152
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 10 rules in 8 ms. Remains 127 /148 variables (removed 21) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 127 cols
[2025-06-05 00:36:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:36:43] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 00:36:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:36:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-05 00:36:43] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 127/148 places, 151/181 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 44101 ms. Remains : 127/148 places, 151/181 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 77 stabilizing places and 531 stable transitions
Graph (complete) has 1706 edges and 294 vertex of which 293 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(X(p1))) U p1) U ((p3||X(X(p0)))&&p2)))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 269 transition count 529
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 269 transition count 529
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 57 place count 269 transition count 522
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 247 transition count 500
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 247 transition count 500
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 107 place count 247 transition count 494
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 179 place count 175 transition count 422
Iterating global reduction 2 with 72 rules applied. Total rules applied 251 place count 175 transition count 422
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 355 place count 175 transition count 318
Applied a total of 355 rules in 12 ms. Remains 175 /294 variables (removed 119) and now considering 318/1120 (removed 802) transitions.
// Phase 1: matrix 318 rows 175 cols
[2025-06-05 00:36:44] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:36:44] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-05 00:36:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:36:44] [INFO ] State equation strengthened by 165 read => feed constraints.
[2025-06-05 00:36:47] [INFO ] Implicit Places using invariants and state equation in 2696 ms returned []
Implicit Place search using SMT with State Equation took 2788 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2025-06-05 00:36:47] [INFO ] Invariant cache hit.
[2025-06-05 00:36:47] [INFO ] State equation strengthened by 165 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/493 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 165/342 constraints. Problems are: Problem set: 0 solved, 317 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 0/493 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 342 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 317/317 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/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/493 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/493 variables, 165/342 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/493 variables, 317/659 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:37:36] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:37:38] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 3 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:37:38] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 3 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:37:45] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 5 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:37:46] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 5 ms to minimize.
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:37:46] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 665 constraints, problems are : Problem set: 22 solved, 295 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 165/165 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60242ms problems are : Problem set: 22 solved, 295 unsolved
Search for dead transitions found 22 dead transitions in 60244ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/294 places, 296/1120 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 157 transition count 290
Applied a total of 24 rules in 2 ms. Remains 157 /175 variables (removed 18) and now considering 290/296 (removed 6) transitions.
// Phase 1: matrix 290 rows 157 cols
[2025-06-05 00:37:47] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:37:47] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-05 00:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:37:47] [INFO ] State equation strengthened by 161 read => feed constraints.
[2025-06-05 00:37:49] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 157/294 places, 290/1120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65068 ms. Remains : 157/294 places, 290/1120 transitions.
Stuttering acceptance computed with spot in 751 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-00 finished in 65897 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)&&((!p1 U p0)||F(p2)))))'
Support contains 4 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 268 transition count 491
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 268 transition count 491
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 59 place count 268 transition count 484
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 245 transition count 461
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 245 transition count 461
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 245 transition count 456
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 186 place count 169 transition count 380
Iterating global reduction 2 with 76 rules applied. Total rules applied 262 place count 169 transition count 380
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 358 place count 169 transition count 284
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 359 place count 168 transition count 271
Iterating global reduction 3 with 1 rules applied. Total rules applied 360 place count 168 transition count 271
Applied a total of 360 rules in 25 ms. Remains 168 /294 variables (removed 126) and now considering 271/1120 (removed 849) transitions.
// Phase 1: matrix 271 rows 168 cols
[2025-06-05 00:37:50] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:37:50] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-05 00:37:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:37:50] [INFO ] State equation strengthened by 123 read => feed constraints.
[2025-06-05 00:37:51] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-05 00:37:51] [INFO ] Invariant cache hit.
[2025-06-05 00:37:51] [INFO ] State equation strengthened by 123 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/439 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 123/293 constraints. Problems are: Problem set: 0 solved, 270 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/439 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 293 constraints, problems are : Problem set: 0 solved, 270 unsolved in 24191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/439 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 123/293 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 270/563 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:38:32] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:38:33] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 3 ms to minimize.
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:38:33] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 4 ms to minimize.
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:38:39] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 3 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:38:40] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:38:40] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 6/569 constraints. Problems are: Problem set: 22 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 569 constraints, problems are : Problem set: 22 solved, 248 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54432ms problems are : Problem set: 22 solved, 248 unsolved
Search for dead transitions found 22 dead transitions in 54434ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 168/294 places, 249/1120 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 150 transition count 243
Applied a total of 24 rules in 2 ms. Remains 150 /168 variables (removed 18) and now considering 243/249 (removed 6) transitions.
// Phase 1: matrix 243 rows 150 cols
[2025-06-05 00:38:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:38:46] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-05 00:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:38:46] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-05 00:38:46] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/294 places, 243/1120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56680 ms. Remains : 150/294 places, 243/1120 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-01 finished in 56875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((X(!p1)&&(!p2 U (p3||G(!p2)))))))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 268 transition count 538
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 268 transition count 538
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 268 transition count 532
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 246 transition count 510
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 246 transition count 510
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 108 place count 246 transition count 504
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 180 place count 174 transition count 432
Iterating global reduction 2 with 72 rules applied. Total rules applied 252 place count 174 transition count 432
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 368 place count 174 transition count 316
Applied a total of 368 rules in 15 ms. Remains 174 /294 variables (removed 120) and now considering 316/1120 (removed 804) transitions.
// Phase 1: matrix 316 rows 174 cols
[2025-06-05 00:38:47] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:38:47] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-05 00:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:38:47] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-05 00:38:49] [INFO ] Implicit Places using invariants and state equation in 2853 ms returned []
Implicit Place search using SMT with State Equation took 2954 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2025-06-05 00:38:49] [INFO ] Invariant cache hit.
[2025-06-05 00:38:49] [INFO ] State equation strengthened by 164 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 340 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 315/655 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:45] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:39:46] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 3 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 657 constraints, problems are : Problem set: 12 solved, 303 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60286ms problems are : Problem set: 12 solved, 303 unsolved
Search for dead transitions found 12 dead transitions in 60292ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/294 places, 304/1120 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 166 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 162 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 162 transition count 300
Applied a total of 16 rules in 5 ms. Remains 162 /174 variables (removed 12) and now considering 300/304 (removed 4) transitions.
// Phase 1: matrix 300 rows 162 cols
[2025-06-05 00:39:50] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:39:50] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-05 00:39:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:39:50] [INFO ] State equation strengthened by 160 read => feed constraints.
[2025-06-05 00:39:52] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/294 places, 300/1120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65075 ms. Remains : 162/294 places, 300/1120 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR p1 (AND p2 (NOT p3))), true, (OR p1 (AND p2 (NOT p3))), (AND (NOT p3) p2), p1, (AND p2 (NOT p3))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1241 steps with 433 reset in 36 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-02 finished in 65392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((F(!p2)&&p1)))))'
Support contains 4 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 268 transition count 501
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 268 transition count 501
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 268 transition count 497
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 79 place count 245 transition count 474
Iterating global reduction 1 with 23 rules applied. Total rules applied 102 place count 245 transition count 474
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 107 place count 245 transition count 469
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 183 place count 169 transition count 393
Iterating global reduction 2 with 76 rules applied. Total rules applied 259 place count 169 transition count 393
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 367 place count 169 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 368 place count 168 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 369 place count 168 transition count 272
Applied a total of 369 rules in 14 ms. Remains 168 /294 variables (removed 126) and now considering 272/1120 (removed 848) transitions.
// Phase 1: matrix 272 rows 168 cols
[2025-06-05 00:39:52] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:39:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-05 00:39:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:39:52] [INFO ] State equation strengthened by 124 read => feed constraints.
[2025-06-05 00:39:53] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-05 00:39:53] [INFO ] Invariant cache hit.
[2025-06-05 00:39:53] [INFO ] State equation strengthened by 124 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/440 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 124/294 constraints. Problems are: Problem set: 0 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 294 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 1/168 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/440 variables, 168/170 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 124/294 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 271/565 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:40] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:42] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 3 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:43] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 3 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:50] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 3 ms to minimize.
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:50] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 4 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:40:51] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 6/571 constraints. Problems are: Problem set: 22 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 571 constraints, problems are : Problem set: 22 solved, 249 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 168/168 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 22 solved, 249 unsolved
Search for dead transitions found 22 dead transitions in 60201ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 168/294 places, 250/1120 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 150 transition count 244
Applied a total of 24 rules in 2 ms. Remains 150 /168 variables (removed 18) and now considering 244/250 (removed 6) transitions.
// Phase 1: matrix 244 rows 150 cols
[2025-06-05 00:40:53] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:40:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 00:40:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:40:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-05 00:40:54] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/294 places, 244/1120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62492 ms. Remains : 150/294 places, 244/1120 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, p2]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-04 finished in 62669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X(((F(p0)&&!p1) U X(p2)))) U p3))'
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 268 transition count 528
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 268 transition count 528
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 60 place count 268 transition count 520
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 246 transition count 498
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 246 transition count 498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 110 place count 246 transition count 492
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 182 place count 174 transition count 420
Iterating global reduction 2 with 72 rules applied. Total rules applied 254 place count 174 transition count 420
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 358 place count 174 transition count 316
Applied a total of 358 rules in 19 ms. Remains 174 /294 variables (removed 120) and now considering 316/1120 (removed 804) transitions.
// Phase 1: matrix 316 rows 174 cols
[2025-06-05 00:40:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:40:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 00:40:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:40:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-05 00:40:56] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2025-06-05 00:40:56] [INFO ] Invariant cache hit.
[2025-06-05 00:40:56] [INFO ] State equation strengthened by 164 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 340 constraints, problems are : Problem set: 0 solved, 315 unsolved in 29207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 315/655 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:51] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 3 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:51] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 3 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:41:52] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 4 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 658 constraints, problems are : Problem set: 12 solved, 303 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59448ms problems are : Problem set: 12 solved, 303 unsolved
Search for dead transitions found 12 dead transitions in 59450ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/294 places, 304/1120 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 166 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 162 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 162 transition count 300
Applied a total of 16 rules in 4 ms. Remains 162 /174 variables (removed 12) and now considering 300/304 (removed 4) transitions.
// Phase 1: matrix 300 rows 162 cols
[2025-06-05 00:41:56] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:41:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-05 00:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:41:56] [INFO ] State equation strengthened by 160 read => feed constraints.
[2025-06-05 00:41:59] [INFO ] Implicit Places using invariants and state equation in 3042 ms returned []
Implicit Place search using SMT with State Equation took 3125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/294 places, 300/1120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64459 ms. Remains : 162/294 places, 300/1120 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p3), (OR (NOT p3) p2), p2, p2, (AND p0 p2), true, (AND p0 p2), p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-05
Stuttering criterion allowed to conclude after 55 steps with 11 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-05 finished in 64773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U p1))'
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 267 transition count 490
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 267 transition count 490
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 62 place count 267 transition count 482
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 85 place count 244 transition count 459
Iterating global reduction 1 with 23 rules applied. Total rules applied 108 place count 244 transition count 459
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 113 place count 244 transition count 454
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 189 place count 168 transition count 378
Iterating global reduction 2 with 76 rules applied. Total rules applied 265 place count 168 transition count 378
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 361 place count 168 transition count 282
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 362 place count 167 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 363 place count 167 transition count 269
Applied a total of 363 rules in 42 ms. Remains 167 /294 variables (removed 127) and now considering 269/1120 (removed 851) transitions.
// Phase 1: matrix 269 rows 167 cols
[2025-06-05 00:41:59] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:41:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-05 00:41:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:42:00] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-05 00:42:02] [INFO ] Implicit Places using invariants and state equation in 2330 ms returned []
Implicit Place search using SMT with State Equation took 2420 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:42:02] [INFO ] Redundant transitions in 16 ms returned []
Running 268 sub problems to find dead transitions.
[2025-06-05 00:42:02] [INFO ] Invariant cache hit.
[2025-06-05 00:42:02] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 291 constraints, problems are : Problem set: 0 solved, 268 unsolved in 20312 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/436 variables, 167/169 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 122/291 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 268/559 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:44] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 3 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:42:48] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 3 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 561 constraints, problems are : Problem set: 12 solved, 256 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 122/122 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50526ms problems are : Problem set: 12 solved, 256 unsolved
Search for dead transitions found 12 dead transitions in 50528ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 167/294 places, 257/1120 transitions.
Graph (complete) has 598 edges and 167 vertex of which 159 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 155 transition count 253
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 155 transition count 253
Applied a total of 9 rules in 14 ms. Remains 155 /167 variables (removed 12) and now considering 253/257 (removed 4) transitions.
// Phase 1: matrix 253 rows 155 cols
[2025-06-05 00:42:52] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:42:52] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 00:42:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:42:53] [INFO ] State equation strengthened by 118 read => feed constraints.
[2025-06-05 00:42:54] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 155/294 places, 253/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54803 ms. Remains : 155/294 places, 253/1120 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-07
Stuttering criterion allowed to conclude after 160 steps with 26 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-07 finished in 54918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 266 transition count 472
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 266 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 266 transition count 468
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 84 place count 242 transition count 444
Iterating global reduction 1 with 24 rules applied. Total rules applied 108 place count 242 transition count 444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 112 place count 242 transition count 440
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 192 place count 162 transition count 360
Iterating global reduction 2 with 80 rules applied. Total rules applied 272 place count 162 transition count 360
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 368 place count 162 transition count 264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 370 place count 160 transition count 238
Iterating global reduction 3 with 2 rules applied. Total rules applied 372 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 373 place count 159 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 374 place count 159 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 375 place count 159 transition count 236
Applied a total of 375 rules in 35 ms. Remains 159 /294 variables (removed 135) and now considering 236/1120 (removed 884) transitions.
// Phase 1: matrix 236 rows 159 cols
[2025-06-05 00:42:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:42:54] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-05 00:42:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:42:54] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-05 00:42:55] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 964 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:42:55] [INFO ] Redundant transitions in 3 ms returned []
Running 235 sub problems to find dead transitions.
[2025-06-05 00:42:55] [INFO ] Invariant cache hit.
[2025-06-05 00:42:55] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 0/395 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 256 constraints, problems are : Problem set: 0 solved, 235 unsolved in 17780 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (OVERLAPS) 236/395 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/395 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 235/491 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:23] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:24] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 3 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:24] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 5 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:27] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 4 ms to minimize.
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:28] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:43:28] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 6/497 constraints. Problems are: Problem set: 22 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 497 constraints, problems are : Problem set: 22 solved, 213 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47953ms problems are : Problem set: 22 solved, 213 unsolved
Search for dead transitions found 22 dead transitions in 47954ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 159/294 places, 214/1120 transitions.
Graph (complete) has 521 edges and 159 vertex of which 141 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 141 transition count 208
Applied a total of 7 rules in 7 ms. Remains 141 /159 variables (removed 18) and now considering 208/214 (removed 6) transitions.
// Phase 1: matrix 208 rows 141 cols
[2025-06-05 00:43:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:43:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-05 00:43:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:43:43] [INFO ] State equation strengthened by 91 read => feed constraints.
[2025-06-05 00:43:44] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 141/294 places, 208/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49596 ms. Remains : 141/294 places, 208/1120 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-08
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-08 finished in 49703 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(p1)||G(p2)||p0)))'
Support contains 6 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 269 transition count 529
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 269 transition count 529
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 269 transition count 521
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 248 transition count 500
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 248 transition count 500
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 103 place count 248 transition count 497
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 175 place count 176 transition count 425
Iterating global reduction 2 with 72 rules applied. Total rules applied 247 place count 176 transition count 425
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 363 place count 176 transition count 309
Applied a total of 363 rules in 17 ms. Remains 176 /294 variables (removed 118) and now considering 309/1120 (removed 811) transitions.
// Phase 1: matrix 309 rows 176 cols
[2025-06-05 00:43:44] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:43:44] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-06-05 00:43:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:43:44] [INFO ] State equation strengthened by 155 read => feed constraints.
[2025-06-05 00:43:45] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2025-06-05 00:43:45] [INFO ] Invariant cache hit.
[2025-06-05 00:43:45] [INFO ] State equation strengthened by 155 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/485 variables, 176/178 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 155/333 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/485 variables, and 333 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (OVERLAPS) 1/176 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/485 variables, 176/178 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 155/333 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 308/641 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 641 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 176/176 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in LTL mode, iteration 1 : 176/294 places, 309/1120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61184 ms. Remains : 176/294 places, 309/1120 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 452 ms.
Product exploration explored 100000 steps with 50000 reset in 460 ms.
Computed a total of 25 stabilizing places and 115 stable transitions
Graph (complete) has 677 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 25 stabilizing places and 115 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-09 finished in 62294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||F(p1)) U (F(!p0)&&(X(p2) U ((!p3&&X(p2))||X(G(p2))))))))'
Support contains 6 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 269 transition count 529
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 269 transition count 529
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 269 transition count 521
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 248 transition count 500
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 248 transition count 500
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 105 place count 248 transition count 495
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 177 place count 176 transition count 423
Iterating global reduction 2 with 72 rules applied. Total rules applied 249 place count 176 transition count 423
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 2 with 108 rules applied. Total rules applied 357 place count 176 transition count 315
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 358 place count 175 transition count 302
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 175 transition count 302
Applied a total of 359 rules in 18 ms. Remains 175 /294 variables (removed 119) and now considering 302/1120 (removed 818) transitions.
// Phase 1: matrix 302 rows 175 cols
[2025-06-05 00:44:46] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:44:46] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-05 00:44:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:44:46] [INFO ] State equation strengthened by 148 read => feed constraints.
[2025-06-05 00:44:48] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2025-06-05 00:44:48] [INFO ] Invariant cache hit.
[2025-06-05 00:44:48] [INFO ] State equation strengthened by 148 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/477 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 148/325 constraints. Problems are: Problem set: 0 solved, 301 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 325 constraints, problems are : Problem set: 0 solved, 301 unsolved in 25917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/477 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 148/325 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 301/626 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:35] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 3 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:35] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 3 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:35] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 4 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:43] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 4 ms to minimize.
Problem TDEAD265 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:44] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:45:44] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 632 constraints, problems are : Problem set: 22 solved, 279 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56159ms problems are : Problem set: 22 solved, 279 unsolved
Search for dead transitions found 22 dead transitions in 56160ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/294 places, 280/1120 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 157 transition count 274
Applied a total of 24 rules in 2 ms. Remains 157 /175 variables (removed 18) and now considering 274/280 (removed 6) transitions.
// Phase 1: matrix 274 rows 157 cols
[2025-06-05 00:45:44] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:45:44] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-05 00:45:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:45:44] [INFO ] State equation strengthened by 144 read => feed constraints.
[2025-06-05 00:45:45] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 157/294 places, 274/1120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58580 ms. Remains : 157/294 places, 274/1120 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p2) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2)), false, p0, (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-10 finished in 58953 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(G(p0))) U p1))'
Support contains 4 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 267 transition count 463
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 267 transition count 463
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 60 place count 267 transition count 457
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 83 place count 244 transition count 434
Iterating global reduction 1 with 23 rules applied. Total rules applied 106 place count 244 transition count 434
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 244 transition count 431
Discarding 80 places :
Symmetric choice reduction at 2 with 80 rule applications. Total rules 189 place count 164 transition count 351
Iterating global reduction 2 with 80 rules applied. Total rules applied 269 place count 164 transition count 351
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 357 place count 164 transition count 263
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 358 place count 163 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 163 transition count 250
Applied a total of 359 rules in 12 ms. Remains 163 /294 variables (removed 131) and now considering 250/1120 (removed 870) transitions.
// Phase 1: matrix 250 rows 163 cols
[2025-06-05 00:45:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:45:45] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-05 00:45:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:45:45] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-05 00:45:46] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2025-06-05 00:45:46] [INFO ] Invariant cache hit.
[2025-06-05 00:45:46] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/413 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 106/271 constraints. Problems are: Problem set: 0 solved, 249 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/413 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 271 constraints, problems are : Problem set: 0 solved, 249 unsolved in 18403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/413 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 106/271 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 249/520 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:19] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 3 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:20] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 3 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:20] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 5 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:25] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 5 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:25] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:46:25] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 6/526 constraints. Problems are: Problem set: 22 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/413 variables, and 526 constraints, problems are : Problem set: 22 solved, 227 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48595ms problems are : Problem set: 22 solved, 227 unsolved
Search for dead transitions found 22 dead transitions in 48596ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 163/294 places, 228/1120 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 145 transition count 222
Applied a total of 24 rules in 3 ms. Remains 145 /163 variables (removed 18) and now considering 222/228 (removed 6) transitions.
// Phase 1: matrix 222 rows 145 cols
[2025-06-05 00:46:35] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:46:35] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 00:46:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:46:35] [INFO ] State equation strengthened by 102 read => feed constraints.
[2025-06-05 00:46:36] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 145/294 places, 222/1120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50424 ms. Remains : 145/294 places, 222/1120 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-13 finished in 50588 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)))'
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 266 transition count 435
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 266 transition count 435
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 266 transition count 432
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 84 place count 241 transition count 407
Iterating global reduction 1 with 25 rules applied. Total rules applied 109 place count 241 transition count 407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 241 transition count 404
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 196 place count 157 transition count 320
Iterating global reduction 2 with 84 rules applied. Total rules applied 280 place count 157 transition count 320
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 360 place count 157 transition count 240
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 362 place count 155 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 155 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 365 place count 154 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 366 place count 154 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 367 place count 154 transition count 212
Applied a total of 367 rules in 23 ms. Remains 154 /294 variables (removed 140) and now considering 212/1120 (removed 908) transitions.
// Phase 1: matrix 212 rows 154 cols
[2025-06-05 00:46:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:46:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-05 00:46:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:46:36] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-05 00:46:37] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-05 00:46:37] [INFO ] Invariant cache hit.
[2025-06-05 00:46:37] [INFO ] State equation strengthened by 75 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/366 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 75/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/366 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 231 constraints, problems are : Problem set: 0 solved, 211 unsolved in 13398 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/366 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 75/231 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 211/442 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:05] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 3 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:05] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 3 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:10] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 3 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:10] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 4 ms to minimize.
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:10] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:47:10] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 6/448 constraints. Problems are: Problem set: 22 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 448 constraints, problems are : Problem set: 22 solved, 189 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43545ms problems are : Problem set: 22 solved, 189 unsolved
Search for dead transitions found 22 dead transitions in 43546ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 154/294 places, 190/1120 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 136 transition count 184
Applied a total of 24 rules in 2 ms. Remains 136 /154 variables (removed 18) and now considering 184/190 (removed 6) transitions.
// Phase 1: matrix 184 rows 136 cols
[2025-06-05 00:47:20] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:47:21] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-05 00:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:47:21] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-06-05 00:47:21] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 136/294 places, 184/1120 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45299 ms. Remains : 136/294 places, 184/1120 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-14 finished in 45405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(F(G(p1)) U p2)))))'
Support contains 3 out of 294 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 294/294 places, 1120/1120 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 268 transition count 528
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 268 transition count 528
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 60 place count 268 transition count 520
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 82 place count 246 transition count 498
Iterating global reduction 1 with 22 rules applied. Total rules applied 104 place count 246 transition count 498
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 110 place count 246 transition count 492
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 182 place count 174 transition count 420
Iterating global reduction 2 with 72 rules applied. Total rules applied 254 place count 174 transition count 420
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 358 place count 174 transition count 316
Applied a total of 358 rules in 29 ms. Remains 174 /294 variables (removed 120) and now considering 316/1120 (removed 804) transitions.
// Phase 1: matrix 316 rows 174 cols
[2025-06-05 00:47:21] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:47:21] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-05 00:47:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:47:21] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-05 00:47:23] [INFO ] Implicit Places using invariants and state equation in 1790 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:47:23] [INFO ] Redundant transitions in 8 ms returned []
Running 315 sub problems to find dead transitions.
[2025-06-05 00:47:23] [INFO ] Invariant cache hit.
[2025-06-05 00:47:23] [INFO ] State equation strengthened by 164 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 340 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 316/490 variables, 174/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 164/340 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 315/655 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:20] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 3 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:48:23] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 3 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 657 constraints, problems are : Problem set: 6 solved, 309 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/174 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60287ms problems are : Problem set: 6 solved, 309 unsolved
Search for dead transitions found 6 dead transitions in 60288ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 174/294 places, 310/1120 transitions.
Graph (complete) has 671 edges and 174 vertex of which 171 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 169 transition count 308
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 169 transition count 308
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 167 transition count 306
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 167 transition count 306
Applied a total of 9 rules in 14 ms. Remains 167 /174 variables (removed 7) and now considering 306/310 (removed 4) transitions.
// Phase 1: matrix 306 rows 167 cols
[2025-06-05 00:48:23] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:48:24] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-05 00:48:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:48:24] [INFO ] State equation strengthened by 162 read => feed constraints.
[2025-06-05 00:48:26] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 167/294 places, 306/1120 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64443 ms. Remains : 167/294 places, 306/1120 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m080-LTLFireability-15
Product exploration explored 100000 steps with 17973 reset in 312 ms.
Product exploration explored 100000 steps with 18030 reset in 764 ms.
Computed a total of 13 stabilizing places and 76 stable transitions
Graph (complete) has 655 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 76 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 2652 steps (470 resets) in 33 ms. (78 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 3 out of 167 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 306/306 transitions.
Applied a total of 0 rules in 13 ms. Remains 167 /167 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2025-06-05 00:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:48:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-05 00:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:48:28] [INFO ] State equation strengthened by 162 read => feed constraints.
[2025-06-05 00:48:30] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:48:30] [INFO ] Redundant transitions in 7 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-05 00:48:30] [INFO ] Invariant cache hit.
[2025-06-05 00:48:30] [INFO ] State equation strengthened by 162 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
At refinement iteration 3 (OVERLAPS) 306/473 variables, 167/168 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 162/330 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/330 constraints. Problems are: Problem set: 7 solved, 298 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/330 constraints. Problems are: Problem set: 7 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/473 variables, and 330 constraints, problems are : Problem set: 7 solved, 298 unsolved in 28559 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 305/466 variables, 161/162 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 161/323 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 37/360 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/360 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 7/473 variables, 6/366 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 1/367 constraints. Problems are: Problem set: 7 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 261/628 constraints. Problems are: Problem set: 7 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/473 variables, and 628 constraints, problems are : Problem set: 7 solved, 298 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 167/167 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 298/305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58801ms problems are : Problem set: 7 solved, 298 unsolved
Search for dead transitions found 7 dead transitions in 58801ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 167/167 places, 299/306 transitions.
Graph (complete) has 637 edges and 167 vertex of which 161 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 161 transition count 297
Applied a total of 3 rules in 10 ms. Remains 161 /167 variables (removed 6) and now considering 297/299 (removed 2) transitions.
// Phase 1: matrix 297 rows 161 cols
[2025-06-05 00:49:28] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:49:28] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-05 00:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:49:29] [INFO ] State equation strengthened by 161 read => feed constraints.
[2025-06-05 00:49:30] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1627 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 161/167 places, 297/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62670 ms. Remains : 161/167 places, 297/306 transitions.
Computed a total of 13 stabilizing places and 78 stable transitions
Graph (complete) has 629 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 2609 steps (469 resets) in 44 ms. (57 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 57 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 18016 reset in 361 ms.
Product exploration explored 100000 steps with 18169 reset in 279 ms.
Built C files in :
/tmp/ltsmin8970528775340164590
[2025-06-05 00:49:31] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2025-06-05 00:49:31] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:49:31] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2025-06-05 00:49:31] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:49:31] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2025-06-05 00:49:31] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:49:31] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8970528775340164590
Running compilation step : cd /tmp/ltsmin8970528775340164590;'/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 738 ms.
Running link step : cd /tmp/ltsmin8970528775340164590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin8970528775340164590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13982476890024679573.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 160 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 159 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 159 transition count 279
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 8 place count 155 transition count 275
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 155 transition count 275
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 20 place count 155 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 154 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 154 transition count 254
Applied a total of 22 rules in 23 ms. Remains 154 /161 variables (removed 7) and now considering 254/297 (removed 43) transitions.
// Phase 1: matrix 254 rows 154 cols
[2025-06-05 00:49:47] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:49:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-05 00:49:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:49:47] [INFO ] State equation strengthened by 123 read => feed constraints.
[2025-06-05 00:49:48] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:49:48] [INFO ] Redundant transitions in 4 ms returned []
Running 253 sub problems to find dead transitions.
[2025-06-05 00:49:48] [INFO ] Invariant cache hit.
[2025-06-05 00:49:48] [INFO ] State equation strengthened by 123 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 3 (OVERLAPS) 254/408 variables, 154/155 constraints. Problems are: Problem set: 3 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 123/278 constraints. Problems are: Problem set: 3 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/408 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 278 constraints, problems are : Problem set: 3 solved, 250 unsolved in 24157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 253/404 variables, 151/152 constraints. Problems are: Problem set: 3 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 122/274 constraints. Problems are: Problem set: 3 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 35/309 constraints. Problems are: Problem set: 3 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:50:21] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/310 constraints. Problems are: Problem set: 3 solved, 250 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/408 variables, and 310 constraints, problems are : Problem set: 3 solved, 250 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 151/154 constraints, ReadFeed: 122/123 constraints, PredecessorRefiner: 35/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54324ms problems are : Problem set: 3 solved, 250 unsolved
Search for dead transitions found 3 dead transitions in 54326ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 154/161 places, 251/297 transitions.
Graph (complete) has 568 edges and 154 vertex of which 151 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 151 transition count 249
Applied a total of 3 rules in 9 ms. Remains 151 /154 variables (removed 3) and now considering 249/251 (removed 2) transitions.
// Phase 1: matrix 249 rows 151 cols
[2025-06-05 00:50:43] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:50:43] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-05 00:50:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:50:43] [INFO ] State equation strengthened by 122 read => feed constraints.
[2025-06-05 00:50:44] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1614 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/161 places, 249/297 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57740 ms. Remains : 151/161 places, 249/297 transitions.
Built C files in :
/tmp/ltsmin3215298376435342623
[2025-06-05 00:50:44] [INFO ] Computing symmetric may disable matrix : 249 transitions.
[2025-06-05 00:50:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:50:44] [INFO ] Computing symmetric may enable matrix : 249 transitions.
[2025-06-05 00:50:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:50:44] [INFO ] Computing Do-Not-Accords matrix : 249 transitions.
[2025-06-05 00:50:44] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:50:44] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3215298376435342623
Running compilation step : cd /tmp/ltsmin3215298376435342623;'/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 522 ms.
Running link step : cd /tmp/ltsmin3215298376435342623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3215298376435342623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5694595450509628833.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 00:50:59] [INFO ] Flatten gal took : 10 ms
[2025-06-05 00:50:59] [INFO ] Flatten gal took : 10 ms
[2025-06-05 00:50:59] [INFO ] Time to serialize gal into /tmp/LTL10746131630401148912.gal : 3 ms
[2025-06-05 00:50:59] [INFO ] Time to serialize properties into /tmp/LTL1339900016331581436.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/LTL10746131630401148912.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17010030088020293090.hoa' '-atoms' '/tmp/LTL1339900016331581436.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1339900016331581436.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17010030088020293090.hoa
Detected timeout of ITS tools.
[2025-06-05 00:51:15] [INFO ] Flatten gal took : 12 ms
[2025-06-05 00:51:15] [INFO ] Flatten gal took : 11 ms
[2025-06-05 00:51:15] [INFO ] Time to serialize gal into /tmp/LTL17387042574962825423.gal : 2 ms
[2025-06-05 00:51:15] [INFO ] Time to serialize properties into /tmp/LTL4270890776444224572.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17387042574962825423.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4270890776444224572.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((s1<1)||(l3930<1))"))||((F(G("((s1>=1)&&(l3940>=1))")))U("((s1>=1)&&(l3911>=1))"))))))
Formula 0 simplified : G(F!"((s1<1)||(l3930<1))" & FG!"((s1>=1)&&(l3911>=1))")
Detected timeout of ITS tools.
[2025-06-05 00:51:30] [INFO ] Flatten gal took : 12 ms
[2025-06-05 00:51:30] [INFO ] Applying decomposition
[2025-06-05 00:51:30] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph424493932193902425.txt' '-o' '/tmp/graph424493932193902425.bin' '-w' '/tmp/graph424493932193902425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph424493932193902425.bin' '-l' '-1' '-v' '-w' '/tmp/graph424493932193902425.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:51:30] [INFO ] Decomposing Gal with order
[2025-06-05 00:51:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:51:30] [INFO ] Removed a total of 301 redundant transitions.
[2025-06-05 00:51:30] [INFO ] Flatten gal took : 136 ms
[2025-06-05 00:51:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 17 ms.
[2025-06-05 00:51:30] [INFO ] Time to serialize gal into /tmp/LTL52753099878668381.gal : 4 ms
[2025-06-05 00:51:30] [INFO ] Time to serialize properties into /tmp/LTL17582837299416742439.ltl : 0 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/LTL52753099878668381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17582837299416742439.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i0.u0.s1<1)||(u6.l3930<1))"))||((F(G("((i0.u0.s1>=1)&&(u6.l3940>=1))")))U("((i0.u0.s1>=1)&&(u6.l3911>=1))"))))))
Formula 0 simplified : G(F!"((i0.u0.s1<1)||(u6.l3930<1))" & FG!"((i0.u0.s1>=1)&&(u6.l3911>=1))")
Detected timeout of ITS tools.
Treatment of property RingSingleMessageInMbox-PT-d1m080-LTLFireability-15 finished in 263828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(F(G(p1)) U p2)))))'
[2025-06-05 00:51:45] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4712954139227842391
[2025-06-05 00:51:45] [INFO ] Computing symmetric may disable matrix : 1120 transitions.
[2025-06-05 00:51:45] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:51:45] [INFO ] Applying decomposition
[2025-06-05 00:51:45] [INFO ] Computing symmetric may enable matrix : 1120 transitions.
[2025-06-05 00:51:45] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:51:45] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14394131715216586505.txt' '-o' '/tmp/graph14394131715216586505.bin' '-w' '/tmp/graph14394131715216586505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14394131715216586505.bin' '-l' '-1' '-v' '-w' '/tmp/graph14394131715216586505.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:51:45] [INFO ] Decomposing Gal with order
[2025-06-05 00:51:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:51:46] [INFO ] Computing Do-Not-Accords matrix : 1120 transitions.
[2025-06-05 00:51:46] [INFO ] Removed a total of 924 redundant transitions.
[2025-06-05 00:51:46] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:51:46] [INFO ] Flatten gal took : 183 ms
[2025-06-05 00:51:46] [INFO ] Built C files in 491ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4712954139227842391
Running compilation step : cd /tmp/ltsmin4712954139227842391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-05 00:51:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 767 labels/synchronizations in 38 ms.
[2025-06-05 00:51:46] [INFO ] Time to serialize gal into /tmp/LTLFireability7253538176883202364.gal : 6 ms
[2025-06-05 00:51:46] [INFO ] Time to serialize properties into /tmp/LTLFireability4220925633764147019.ltl : 0 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/LTLFireability7253538176883202364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4220925633764147019.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G(!("((u0.s1>=1)&&(u0.l3930>=1))")))||((F(G("((u0.s1>=1)&&(u0.l3940>=1))")))U("((u0.s1>=1)&&(u7.l3911>=1))"))))))
Formula 0 simplified : G(F"((u0.s1>=1)&&(u0.l3930>=1))" & FG!"((u0.s1>=1)&&(u7.l3911>=1))")
Compilation finished in 4058 ms.
Running link step : cd /tmp/ltsmin4712954139227842391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin4712954139227842391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([](!(LTLAPp0==true))||(<>([]((LTLAPp1==true))) U (LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-05 01:17:31] [INFO ] Flatten gal took : 547 ms
[2025-06-05 01:17:31] [INFO ] Time to serialize gal into /tmp/LTLFireability5411275114103181499.gal : 63 ms
[2025-06-05 01:17:31] [INFO ] Time to serialize properties into /tmp/LTLFireability2411642108643003405.ltl : 17 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/LTLFireability5411275114103181499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2411642108643003405.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F((G(!("((s1>=1)&&(l3930>=1))")))||((F(G("((s1>=1)&&(l3940>=1))")))U("((s1>=1)&&(l3911>=1))"))))))
Formula 0 simplified : G(F"((s1>=1)&&(l3930>=1))" & FG!"((s1>=1)&&(l3911>=1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m080"
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 RingSingleMessageInMbox-PT-d1m080, 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 r184-tall-174889264200444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m080.tgz
mv RingSingleMessageInMbox-PT-d1m080 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 ;