Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400380.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 FireWire-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 168K 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 FireWire-PT-18-LTLFireability-00
FORMULA_NAME FireWire-PT-18-LTLFireability-01
FORMULA_NAME FireWire-PT-18-LTLFireability-02
FORMULA_NAME FireWire-PT-18-LTLFireability-03
FORMULA_NAME FireWire-PT-18-LTLFireability-04
FORMULA_NAME FireWire-PT-18-LTLFireability-05
FORMULA_NAME FireWire-PT-18-LTLFireability-06
FORMULA_NAME FireWire-PT-18-LTLFireability-07
FORMULA_NAME FireWire-PT-18-LTLFireability-08
FORMULA_NAME FireWire-PT-18-LTLFireability-09
FORMULA_NAME FireWire-PT-18-LTLFireability-10
FORMULA_NAME FireWire-PT-18-LTLFireability-11
FORMULA_NAME FireWire-PT-18-LTLFireability-12
FORMULA_NAME FireWire-PT-18-LTLFireability-13
FORMULA_NAME FireWire-PT-18-LTLFireability-14
FORMULA_NAME FireWire-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748897200986

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 20:46:43] [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-02 20:46:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:46:44] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2025-06-02 20:46:44] [INFO ] Transformed 437 places.
[2025-06-02 20:46:44] [INFO ] Transformed 707 transitions.
[2025-06-02 20:46:44] [INFO ] Found NUPN structural information;
[2025-06-02 20:46:44] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 707
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 109 place count 328 transition count 608
Iterating global reduction 1 with 99 rules applied. Total rules applied 208 place count 328 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 209 place count 328 transition count 607
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 228 place count 309 transition count 560
Iterating global reduction 2 with 19 rules applied. Total rules applied 247 place count 309 transition count 560
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 252 place count 304 transition count 552
Iterating global reduction 2 with 5 rules applied. Total rules applied 257 place count 304 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 304 transition count 551
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 260 place count 302 transition count 545
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 302 transition count 545
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 263 place count 301 transition count 543
Iterating global reduction 3 with 1 rules applied. Total rules applied 264 place count 301 transition count 543
Applied a total of 264 rules in 233 ms. Remains 301 /437 variables (removed 136) and now considering 543/707 (removed 164) transitions.
// Phase 1: matrix 543 rows 301 cols
[2025-06-02 20:46:44] [INFO ] Computed 7 invariants in 46 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:46:45] [INFO ] Implicit Places using invariants in 760 ms returned []
[2025-06-02 20:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:46:46] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2025-06-02 20:46:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:02] [INFO ] Deduced a trap composed of 154 places in 405 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:03] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:03] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:03] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:04] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:04] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:04] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:05] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:05] [INFO ] Deduced a trap composed of 43 places in 363 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:08] [INFO ] Deduced a trap composed of 53 places in 315 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:13] [INFO ] Deduced a trap composed of 47 places in 337 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:14] [INFO ] Deduced a trap composed of 94 places in 374 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:17] [INFO ] Deduced a trap composed of 155 places in 345 ms of which 47 ms to minimize.
SMT process timed out in 30737ms, After SMT, problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 30765ms
Starting structural reductions in LTL mode, iteration 1 : 301/437 places, 543/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32543 ms. Remains : 301/437 places, 543/707 transitions.
Support contains 42 out of 301 places after structural reductions.
[2025-06-02 20:47:17] [INFO ] Flatten gal took : 147 ms
[2025-06-02 20:47:17] [INFO ] Flatten gal took : 81 ms
[2025-06-02 20:47:17] [INFO ] Input system was already deterministic with 543 transitions.
RANDOM walk for 40000 steps (30 resets) in 2214 ms. (18 steps per ms) remains 21/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (11 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (9 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
[2025-06-02 20:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 245/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 520/796 variables, 276/283 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:19] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:20] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:20] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/796 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 21/817 variables, 11/297 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/817 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 18/835 variables, 7/304 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 9/844 variables, 7/311 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/844 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/844 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 844/844 variables, and 311 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3919 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 245/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 520/796 variables, 276/286 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 19/305 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 21/817 variables, 11/316 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/817 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/844 variables, and 318 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 287/301 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8956ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 543/543 transitions.
Graph (trivial) has 173 edges and 301 vertex of which 9 / 301 are part of one of the 3 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 295 transition count 501
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 263 transition count 499
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 72 place count 262 transition count 495
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 258 transition count 495
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 76 place count 258 transition count 470
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 126 place count 233 transition count 470
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 127 place count 232 transition count 469
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 232 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 232 transition count 468
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 175 place count 209 transition count 445
Performed 23 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 221 place count 186 transition count 548
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 233 place count 186 transition count 536
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 248 place count 174 transition count 533
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 257 place count 174 transition count 524
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 260 place count 174 transition count 524
Applied a total of 260 rules in 154 ms. Remains 174 /301 variables (removed 127) and now considering 524/543 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 174/301 places, 524/543 transitions.
RANDOM walk for 40000 steps (1537 resets) in 652 ms. (61 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4002 steps (33 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (38 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (39 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (37 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (38 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (38 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (37 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (36 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (35 resets) in 13 ms. (285 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
[2025-06-02 20:47:28] [INFO ] Flow matrix only has 516 transitions (discarded 8 similar events)
// Phase 1: matrix 516 rows 174 cols
[2025-06-02 20:47:28] [INFO ] Computed 7 invariants in 8 ms
[2025-06-02 20:47:28] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 143/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 516/683 variables, 167/174 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 43/217 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:28] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/683 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/690 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/690 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 225 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2157 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 143/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:30] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 516/683 variables, 167/176 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 43/219 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 12/231 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 7/690 variables, 7/238 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/690 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 240 constraints, problems are : Problem set: 0 solved, 14 unsolved in 6276 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8468ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 13077 ms.
Support contains 23 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 524/524 transitions.
Graph (trivial) has 31 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 173 transition count 521
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 172 transition count 521
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 172 transition count 520
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 171 transition count 520
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 171 transition count 519
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 169 transition count 517
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 166 transition count 538
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 166 transition count 537
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 27 place count 166 transition count 527
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 31 place count 166 transition count 523
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 35 place count 162 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 40 place count 162 transition count 518
Applied a total of 40 rules in 90 ms. Remains 162 /174 variables (removed 12) and now considering 518/524 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 162/174 places, 518/524 transitions.
RANDOM walk for 40000 steps (1594 resets) in 418 ms. (95 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40002 steps (346 resets) in 167 ms. (238 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (352 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (351 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (113 resets) in 209 ms. (190 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (363 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (364 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (335 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (332 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (314 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (294 resets) in 104 ms. (380 steps per ms) remains 8/9 properties
[2025-06-02 20:47:50] [INFO ] Flow matrix only has 504 transitions (discarded 14 similar events)
// Phase 1: matrix 504 rows 162 cols
[2025-06-02 20:47:50] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 20:47:50] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 133/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 8/154 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 501/655 variables, 154/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 44/205 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:51] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:51] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 25 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 11/666 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:51] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 27 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/666 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 216 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 133/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 8/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:52] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:47:52] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 501/655 variables, 154/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 44/210 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 7/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 11/666 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 226 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4696 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6472ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 16274 ms.
Support contains 13 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 518/518 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 517
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 1 place count 162 transition count 514
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 159 transition count 514
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 156 transition count 407
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 156 transition count 407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 156 transition count 405
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 155 transition count 403
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 155 transition count 403
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 154 transition count 400
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 154 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 153 transition count 398
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 153 transition count 398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 152 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 152 transition count 395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 151 transition count 393
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 151 transition count 393
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 150 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 150 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 149 transition count 388
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 149 transition count 388
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 148 transition count 386
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 148 transition count 386
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 147 transition count 384
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 147 transition count 384
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 145 transition count 382
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 145 transition count 381
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 145 transition count 379
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 143 transition count 376
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 143 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 143 transition count 375
Applied a total of 47 rules in 80 ms. Remains 143 /162 variables (removed 19) and now considering 375/518 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 143/162 places, 375/518 transitions.
RANDOM walk for 40000 steps (1796 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (442 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (422 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (180 resets) in 127 ms. (312 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (425 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (440 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (379 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (362 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
[2025-06-02 20:48:13] [INFO ] Flow matrix only has 369 transitions (discarded 6 similar events)
// Phase 1: matrix 369 rows 143 cols
[2025-06-02 20:48:13] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 20:48:13] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 118/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 6/135 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 369/504 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 63/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:14] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:14] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 8/512 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/512 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 215 constraints, problems are : Problem set: 0 solved, 7 unsolved in 939 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 118/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:14] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 6/135 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 369/504 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 63/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 8/512 variables, 8/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/512 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 223 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2940 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3896ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2182 ms.
Support contains 11 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 375/375 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 143 transition count 374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 374
Applied a total of 2 rules in 12 ms. Remains 142 /143 variables (removed 1) and now considering 374/375 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 142/143 places, 374/375 transitions.
RANDOM walk for 40000 steps (1904 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (456 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (467 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (188 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (462 resets) in 76 ms. (519 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (391 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (400 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
[2025-06-02 20:48:19] [INFO ] Flow matrix only has 368 transitions (discarded 6 similar events)
// Phase 1: matrix 368 rows 142 cols
[2025-06-02 20:48:19] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 20:48:19] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 118/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/134 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 368/502 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 63/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:20] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:20] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 8/510 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/510 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 214 constraints, problems are : Problem set: 0 solved, 6 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 118/128 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6/134 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:20] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 368/502 variables, 134/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 63/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 8/510 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:22] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/510 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/510 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/510 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 222 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2758 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3615ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3923 ms.
Support contains 10 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 374/374 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 142 transition count 373
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 373
Applied a total of 2 rules in 8 ms. Remains 141 /142 variables (removed 1) and now considering 373/374 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 141/142 places, 373/374 transitions.
RANDOM walk for 40000 steps (1895 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (443 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (456 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (189 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (456 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (395 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (398 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 432880 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :2 out of 6
Probabilistic random walk after 432880 steps, saw 114299 distinct states, run finished after 3012 ms. (steps per millisecond=143 ) properties seen :2
[2025-06-02 20:48:30] [INFO ] Flow matrix only has 367 transitions (discarded 6 similar events)
// Phase 1: matrix 367 rows 141 cols
[2025-06-02 20:48:30] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 20:48:30] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 114/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:30] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/133 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:31] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:31] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:31] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 367/500 variables, 133/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 63/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/508 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/508 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:32] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 23 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/508 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/508 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1438 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 114/121 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/133 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:32] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 367/500 variables, 133/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 63/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:33] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 8/508 variables, 8/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/508 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 222 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2676 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4124ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1250 ms.
Support contains 7 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 373/373 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 140 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 139 transition count 372
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 139 transition count 370
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 137 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 135 transition count 368
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 135 transition count 368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 15 place count 135 transition count 365
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 135 transition count 365
Applied a total of 16 rules in 29 ms. Remains 135 /141 variables (removed 6) and now considering 365/373 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 135/141 places, 365/373 transitions.
RANDOM walk for 40000 steps (1944 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (473 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (189 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (487 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (386 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 453765 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 4
Probabilistic random walk after 453765 steps, saw 124503 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2025-06-02 20:48:39] [INFO ] Flow matrix only has 359 transitions (discarded 6 similar events)
// Phase 1: matrix 359 rows 135 cols
[2025-06-02 20:48:39] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 20:48:39] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 110/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:39] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 10/127 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:39] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:39] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:39] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:40] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 359/486 variables, 127/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 62/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/494 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/494 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 209 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 110/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 10/127 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:40] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 359/486 variables, 127/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 62/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/494 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/494 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/494 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 494/494 variables, and 214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1534 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2925ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2419 ms.
Support contains 7 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 365/365 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 135/135 places, 365/365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 365/365 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2025-06-02 20:48:44] [INFO ] Flow matrix only has 359 transitions (discarded 6 similar events)
[2025-06-02 20:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:48:44] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 20:48:44] [INFO ] Flow matrix only has 359 transitions (discarded 6 similar events)
[2025-06-02 20:48:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:48:44] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-06-02 20:48:45] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:48:45] [INFO ] Redundant transitions in 26 ms returned []
Running 361 sub problems to find dead transitions.
[2025-06-02 20:48:45] [INFO ] Flow matrix only has 359 transitions (discarded 6 similar events)
[2025-06-02 20:48:45] [INFO ] Invariant cache hit.
[2025-06-02 20:48:45] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:51] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:51] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:51] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:51] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:52] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:52] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:53] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:53] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:53] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:54] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:48:54] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 359/494 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 62/215 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/494 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 215 constraints, problems are : Problem set: 0 solved, 361 unsolved in 27242 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 359/494 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 62/215 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 361/576 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:49:39] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 577 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57420ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 57422ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57931 ms. Remains : 135/135 places, 365/365 transitions.
Computed a total of 83 stabilizing places and 130 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p1))&&p0)))'
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Graph (trivial) has 212 edges and 301 vertex of which 11 / 301 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 292 transition count 496
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 255 transition count 494
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 254 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 253 transition count 493
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 80 place count 253 transition count 465
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 136 place count 225 transition count 465
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 146 place count 215 transition count 412
Iterating global reduction 4 with 10 rules applied. Total rules applied 156 place count 215 transition count 412
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 161 place count 215 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 162 place count 214 transition count 407
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 165 place count 211 transition count 400
Iterating global reduction 6 with 3 rules applied. Total rules applied 168 place count 211 transition count 400
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 170 place count 209 transition count 395
Iterating global reduction 6 with 2 rules applied. Total rules applied 172 place count 209 transition count 395
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 174 place count 207 transition count 390
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 207 transition count 390
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 178 place count 205 transition count 385
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 205 transition count 385
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 182 place count 203 transition count 380
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 203 transition count 380
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 186 place count 201 transition count 375
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 201 transition count 375
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 190 place count 199 transition count 370
Iterating global reduction 6 with 2 rules applied. Total rules applied 192 place count 199 transition count 370
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 194 place count 197 transition count 366
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 197 transition count 366
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 198 place count 195 transition count 362
Iterating global reduction 6 with 2 rules applied. Total rules applied 200 place count 195 transition count 362
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 201 place count 194 transition count 360
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 194 transition count 360
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 252 place count 169 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 169 transition count 334
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 313 place count 139 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 315 place count 139 transition count 411
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 316 place count 138 transition count 410
Applied a total of 316 rules in 167 ms. Remains 138 /301 variables (removed 163) and now considering 410/543 (removed 133) transitions.
[2025-06-02 20:49:43] [INFO ] Flow matrix only has 391 transitions (discarded 19 similar events)
// Phase 1: matrix 391 rows 138 cols
[2025-06-02 20:49:43] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:49:43] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-02 20:49:43] [INFO ] Flow matrix only has 391 transitions (discarded 19 similar events)
[2025-06-02 20:49:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:49:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 20:49:44] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 819 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:49:44] [INFO ] Redundant transitions in 18 ms returned []
Running 407 sub problems to find dead transitions.
[2025-06-02 20:49:44] [INFO ] Flow matrix only has 391 transitions (discarded 19 similar events)
[2025-06-02 20:49:44] [INFO ] Invariant cache hit.
[2025-06-02 20:49:44] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:49:51] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:49:52] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:49:52] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:49:52] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:49:53] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:49:53] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (OVERLAPS) 390/528 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 25/176 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/529 variables, and 176 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 390/528 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 25/176 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 407/583 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:50:31] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:50:33] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/529 variables, and 585 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/301 places, 410/543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61373 ms. Remains : 138/301 places, 410/543 transitions.
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-00 finished in 61957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(F(p0))) U (p1||G(!p0)||G(p2)))))'
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 290 transition count 509
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 290 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 290 transition count 507
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 285 transition count 497
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 285 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 282 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 282 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 280 transition count 486
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 280 transition count 486
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 278 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 278 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 276 transition count 476
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 276 transition count 476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 274 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 274 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 272 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 272 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 270 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 270 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 268 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 268 transition count 458
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 266 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 266 transition count 455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 265 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 265 transition count 454
Applied a total of 74 rules in 61 ms. Remains 265 /301 variables (removed 36) and now considering 454/543 (removed 89) transitions.
// Phase 1: matrix 454 rows 265 cols
[2025-06-02 20:50:45] [INFO ] Computed 7 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:50:45] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-06-02 20:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:50:46] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2025-06-02 20:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:50:58] [INFO ] Deduced a trap composed of 147 places in 298 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:50:58] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:50:59] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:50:59] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:00] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:00] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:01] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 40 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:08] [INFO ] Deduced a trap composed of 148 places in 278 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:14] [INFO ] Deduced a trap composed of 79 places in 229 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:15] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 17 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/719 variables, and 17 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:21] [INFO ] Deduced a trap composed of 149 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:21] [INFO ] Deduced a trap composed of 149 places in 244 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:27] [INFO ] Deduced a trap composed of 150 places in 262 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:32] [INFO ] Deduced a trap composed of 156 places in 304 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:33] [INFO ] Deduced a trap composed of 149 places in 317 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:33] [INFO ] Deduced a trap composed of 156 places in 275 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:33] [INFO ] Deduced a trap composed of 150 places in 288 ms of which 44 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:38] [INFO ] Deduced a trap composed of 82 places in 331 ms of which 56 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/719 variables, and 25 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 0/453 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 265/301 places, 454/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61197 ms. Remains : 265/301 places, 454/543 transitions.
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p1) p0 (NOT p2)), (NOT p0), false, (AND p0 (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-01
Product exploration explored 100000 steps with 22244 reset in 538 ms.
Stack based approach found an accepted trace after 337 steps with 83 reset with depth 4 and stack size 4 in 3 ms.
FORMULA FireWire-PT-18-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-18-LTLFireability-01 finished in 62203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Graph (trivial) has 213 edges and 301 vertex of which 11 / 301 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 292 transition count 494
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 253 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 252 transition count 492
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 82 place count 252 transition count 463
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 140 place count 223 transition count 463
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 150 place count 213 transition count 410
Iterating global reduction 3 with 10 rules applied. Total rules applied 160 place count 213 transition count 410
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 165 place count 213 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 212 transition count 405
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 169 place count 209 transition count 398
Iterating global reduction 5 with 3 rules applied. Total rules applied 172 place count 209 transition count 398
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 174 place count 207 transition count 393
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 207 transition count 393
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 178 place count 205 transition count 388
Iterating global reduction 5 with 2 rules applied. Total rules applied 180 place count 205 transition count 388
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 182 place count 203 transition count 383
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 203 transition count 383
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 186 place count 201 transition count 378
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 201 transition count 378
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 190 place count 199 transition count 373
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 199 transition count 373
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 194 place count 197 transition count 368
Iterating global reduction 5 with 2 rules applied. Total rules applied 196 place count 197 transition count 368
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 198 place count 195 transition count 364
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 195 transition count 364
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 202 place count 193 transition count 360
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 193 transition count 360
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 205 place count 192 transition count 358
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 192 transition count 358
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 256 place count 167 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 257 place count 167 transition count 332
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 317 place count 137 transition count 411
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 319 place count 137 transition count 409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 320 place count 136 transition count 408
Applied a total of 320 rules in 139 ms. Remains 136 /301 variables (removed 165) and now considering 408/543 (removed 135) transitions.
[2025-06-02 20:51:47] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
// Phase 1: matrix 389 rows 136 cols
[2025-06-02 20:51:47] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:51:47] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-02 20:51:47] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
[2025-06-02 20:51:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:51:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 20:51:48] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:51:48] [INFO ] Redundant transitions in 7 ms returned []
Running 403 sub problems to find dead transitions.
[2025-06-02 20:51:48] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
[2025-06-02 20:51:48] [INFO ] Invariant cache hit.
[2025-06-02 20:51:48] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:55] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:56] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:56] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:56] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:51:57] [INFO ] Deduced a trap composed of 41 places in 216 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:52:01] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 388/524 variables, 136/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 25/174 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/525 variables, and 174 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 388/524 variables, 136/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 25/174 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 403/577 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:52:44] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:52:45] [INFO ] Deduced a trap composed of 93 places in 181 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/525 variables, and 579 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/301 places, 408/543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61217 ms. Remains : 136/301 places, 408/543 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-02 finished in 61372 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)||X((p1&&(p2||X((G(p3) U (p2&&G(p3)))))))))'
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 288 transition count 487
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 288 transition count 487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 288 transition count 485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 283 transition count 475
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 283 transition count 475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 280 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 278 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 278 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 276 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 274 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 274 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 272 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 272 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 270 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 270 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 268 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 268 transition count 440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 266 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 266 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 264 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 263 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 263 transition count 432
Applied a total of 78 rules in 41 ms. Remains 263 /301 variables (removed 38) and now considering 432/543 (removed 111) transitions.
// Phase 1: matrix 432 rows 263 cols
[2025-06-02 20:52:48] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:52:48] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-02 20:52:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:52:49] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2025-06-02 20:52:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:00] [INFO ] Deduced a trap composed of 146 places in 360 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:01] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:01] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:02] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:02] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:03] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:03] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:10] [INFO ] Deduced a trap composed of 155 places in 281 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:15] [INFO ] Deduced a trap composed of 78 places in 273 ms of which 34 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(timeout
s175 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/695 variables, and 16 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:24] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:24] [INFO ] Deduced a trap composed of 147 places in 210 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:24] [INFO ] Deduced a trap composed of 155 places in 306 ms of which 64 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:29] [INFO ] Deduced a trap composed of 81 places in 312 ms of which 56 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:35] [INFO ] Deduced a trap composed of 148 places in 290 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:36] [INFO ] Deduced a trap composed of 147 places in 300 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:36] [INFO ] Deduced a trap composed of 86 places in 286 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:37] [INFO ] Deduced a trap composed of 153 places in 304 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:38] [INFO ] Deduced a trap composed of 148 places in 262 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:38] [INFO ] Deduced a trap composed of 78 places in 277 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:38] [INFO ] Deduced a trap composed of 148 places in 297 ms of which 56 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:53:43] [INFO ] Deduced a trap composed of 155 places in 309 ms of which 64 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/695 variables, and 28 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 263/301 places, 432/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61043 ms. Remains : 263/301 places, 432/543 transitions.
Stuttering acceptance computed with spot in 466 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p3), (AND (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-03 finished in 61536 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)||X(p1)))'
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 290 transition count 491
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 290 transition count 491
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 290 transition count 489
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 286 transition count 482
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 286 transition count 482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 284 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 284 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 283 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 283 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 282 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 282 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 281 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 281 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 280 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 280 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 279 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 279 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 278 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 278 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 277 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 277 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 276 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 276 transition count 461
Applied a total of 52 rules in 46 ms. Remains 276 /301 variables (removed 25) and now considering 461/543 (removed 82) transitions.
// Phase 1: matrix 461 rows 276 cols
[2025-06-02 20:53:50] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:53:50] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-06-02 20:53:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:53:51] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-02 20:53:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:04] [INFO ] Deduced a trap composed of 146 places in 361 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:04] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:04] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:05] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:06] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:06] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:07] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:09] [INFO ] Deduced a trap composed of 49 places in 285 ms of which 50 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:13] [INFO ] Deduced a trap composed of 155 places in 310 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:14] [INFO ] Deduced a trap composed of 86 places in 333 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:14] [INFO ] Deduced a trap composed of 156 places in 320 ms of which 65 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/737 variables, and 18 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/276 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 461/737 variables, 276/294 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/737 variables, 460/754 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:43] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:46] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 737/737 variables, and 756 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 276/301 places, 461/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61291 ms. Remains : 276/301 places, 461/543 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-04
Product exploration explored 100000 steps with 2 reset in 145 ms.
Product exploration explored 100000 steps with 2 reset in 203 ms.
Computed a total of 68 stabilizing places and 99 stable transitions
Computed a total of 68 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (24 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (32 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 970941 steps, run timeout after 3001 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 970941 steps, saw 228480 distinct states, run finished after 3001 ms. (steps per millisecond=323 ) properties seen :0
[2025-06-02 20:54:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/252 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 437/689 variables, 252/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/713 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/729 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/729 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/737 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/737 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 737/737 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 118/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/252 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:55] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 437/689 variables, 252/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/713 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/729 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:56] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/729 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/729 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/737 variables, 6/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:54:56] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 14 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/737 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/737 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/737 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 737/737 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1726ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 448 ms.
Support contains 2 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 461/461 transitions.
Graph (trivial) has 200 edges and 276 vertex of which 11 / 276 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 268 transition count 411
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 78 place count 232 transition count 406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 230 transition count 406
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 80 place count 230 transition count 377
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 138 place count 201 transition count 377
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 200 transition count 375
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 200 transition count 375
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 199 transition count 372
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 199 transition count 372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 198 transition count 370
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 198 transition count 370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 197 transition count 367
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 197 transition count 367
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 196 transition count 365
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 196 transition count 365
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 195 transition count 362
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 195 transition count 362
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 194 transition count 360
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 194 transition count 360
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 193 transition count 357
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 193 transition count 357
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 192 transition count 355
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 192 transition count 355
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 191 transition count 353
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 191 transition count 353
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 190 transition count 351
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 190 transition count 351
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 206 place count 167 transition count 328
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 266 place count 137 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 137 transition count 405
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 282 place count 137 transition count 391
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 302 place count 123 transition count 385
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 306 place count 119 transition count 381
Iterating global reduction 4 with 4 rules applied. Total rules applied 310 place count 119 transition count 381
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 316 place count 119 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 334 place count 119 transition count 357
Applied a total of 334 rules in 112 ms. Remains 119 /276 variables (removed 157) and now considering 357/461 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 119/276 places, 357/461 transitions.
RANDOM walk for 40000 steps (2008 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (191 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 332687 steps, run visited all 1 properties in 967 ms. (steps per millisecond=344 )
Probabilistic random walk after 332687 steps, saw 98382 distinct states, run finished after 972 ms. (steps per millisecond=342 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLFireability-04 finished in 68511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Graph (trivial) has 214 edges and 301 vertex of which 11 / 301 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 292 transition count 494
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 253 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 252 transition count 492
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 82 place count 252 transition count 464
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 138 place count 224 transition count 464
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 148 place count 214 transition count 411
Iterating global reduction 3 with 10 rules applied. Total rules applied 158 place count 214 transition count 411
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 163 place count 214 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 213 transition count 406
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 167 place count 210 transition count 399
Iterating global reduction 5 with 3 rules applied. Total rules applied 170 place count 210 transition count 399
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 172 place count 208 transition count 394
Iterating global reduction 5 with 2 rules applied. Total rules applied 174 place count 208 transition count 394
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 176 place count 206 transition count 389
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 206 transition count 389
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 180 place count 204 transition count 384
Iterating global reduction 5 with 2 rules applied. Total rules applied 182 place count 204 transition count 384
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 184 place count 202 transition count 379
Iterating global reduction 5 with 2 rules applied. Total rules applied 186 place count 202 transition count 379
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 188 place count 200 transition count 374
Iterating global reduction 5 with 2 rules applied. Total rules applied 190 place count 200 transition count 374
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 192 place count 198 transition count 369
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 198 transition count 369
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 196 place count 196 transition count 365
Iterating global reduction 5 with 2 rules applied. Total rules applied 198 place count 196 transition count 365
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 200 place count 194 transition count 361
Iterating global reduction 5 with 2 rules applied. Total rules applied 202 place count 194 transition count 361
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 203 place count 193 transition count 359
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 193 transition count 359
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 254 place count 168 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 255 place count 168 transition count 333
Performed 31 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 317 place count 137 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 319 place count 137 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 320 place count 136 transition count 409
Applied a total of 320 rules in 89 ms. Remains 136 /301 variables (removed 165) and now considering 409/543 (removed 134) transitions.
[2025-06-02 20:54:58] [INFO ] Flow matrix only has 390 transitions (discarded 19 similar events)
// Phase 1: matrix 390 rows 136 cols
[2025-06-02 20:54:58] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:54:58] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-02 20:54:58] [INFO ] Flow matrix only has 390 transitions (discarded 19 similar events)
[2025-06-02 20:54:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:54:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 20:54:59] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:54:59] [INFO ] Redundant transitions in 6 ms returned []
Running 404 sub problems to find dead transitions.
[2025-06-02 20:54:59] [INFO ] Flow matrix only has 390 transitions (discarded 19 similar events)
[2025-06-02 20:54:59] [INFO ] Invariant cache hit.
[2025-06-02 20:54:59] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:06] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:06] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:07] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:07] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:55:08] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (OVERLAPS) 389/525 variables, 136/148 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 25/173 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/526 variables, and 173 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 1/136 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (OVERLAPS) 389/525 variables, 136/148 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 25/173 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 404/577 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/526 variables, and 577 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/301 places, 409/543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61027 ms. Remains : 136/301 places, 409/543 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-06 finished in 61089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&(G(p2)||X((p3||F(G(p4))))))))'
Support contains 7 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 291 transition count 492
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 291 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 291 transition count 490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 289 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 289 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 288 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 288 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 287 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 287 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 286 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 286 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 285 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 285 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 284 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 284 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 283 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 283 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 282 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 282 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 281 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 281 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 280 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 280 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 279 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 279 transition count 463
Applied a total of 46 rules in 57 ms. Remains 279 /301 variables (removed 22) and now considering 463/543 (removed 80) transitions.
// Phase 1: matrix 463 rows 279 cols
[2025-06-02 20:55:59] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:56:00] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-06-02 20:56:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:56:00] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2025-06-02 20:56:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:14] [INFO ] Deduced a trap composed of 147 places in 359 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:14] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:14] [INFO ] Deduced a trap composed of 89 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:15] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:15] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:16] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:16] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:16] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:17] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:20] [INFO ] Deduced a trap composed of 156 places in 293 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:22] [INFO ] Deduced a trap composed of 86 places in 279 ms of which 50 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:29] [INFO ] Deduced a trap composed of 149 places in 303 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 279/742 variables, and 19 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/279 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/279 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:34] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 463/742 variables, 279/299 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 462/761 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:54] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:56:58] [INFO ] Deduced a trap composed of 155 places in 365 ms of which 86 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 742/742 variables, and 763 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 279/301 places, 463/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61270 ms. Remains : 279/301 places, 463/543 transitions.
Stuttering acceptance computed with spot in 675 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (NOT p1), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p4))), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 220 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA FireWire-PT-18-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-18-LTLFireability-07 finished in 62215 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||F(p2))) U X((p0||X(p3)))))))'
Support contains 6 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 288 transition count 487
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 288 transition count 487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 288 transition count 485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 283 transition count 475
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 283 transition count 475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 280 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 278 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 278 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 276 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 274 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 274 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 272 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 272 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 270 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 270 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 268 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 268 transition count 440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 266 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 266 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 264 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 263 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 263 transition count 432
Applied a total of 78 rules in 54 ms. Remains 263 /301 variables (removed 38) and now considering 432/543 (removed 111) transitions.
// Phase 1: matrix 432 rows 263 cols
[2025-06-02 20:57:02] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:57:02] [INFO ] Implicit Places using invariants in 317 ms returned []
[2025-06-02 20:57:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:57:02] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2025-06-02 20:57:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:11] [INFO ] Deduced a trap composed of 146 places in 192 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:11] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:11] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:12] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:12] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:12] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:13] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:16] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:20] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 6 (OVERLAPS) 432/695 variables, 263/279 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 695/695 variables, and 279 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:36] [INFO ] Deduced a trap composed of 148 places in 266 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:36] [INFO ] Deduced a trap composed of 147 places in 275 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:37] [INFO ] Deduced a trap composed of 155 places in 306 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:42] [INFO ] Deduced a trap composed of 81 places in 216 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:48] [INFO ] Deduced a trap composed of 148 places in 284 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:48] [INFO ] Deduced a trap composed of 147 places in 281 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:49] [INFO ] Deduced a trap composed of 86 places in 285 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:49] [INFO ] Deduced a trap composed of 153 places in 306 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:50] [INFO ] Deduced a trap composed of 148 places in 274 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:50] [INFO ] Deduced a trap composed of 78 places in 273 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:51] [INFO ] Deduced a trap composed of 148 places in 294 ms of which 56 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:57:55] [INFO ] Deduced a trap composed of 155 places in 315 ms of which 65 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/695 variables, and 28 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 263/301 places, 432/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60986 ms. Remains : 263/301 places, 432/543 transitions.
Stuttering acceptance computed with spot in 576 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p3)), (NOT p3), true, (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-08
Product exploration explored 100000 steps with 20000 reset in 142 ms.
Product exploration explored 100000 steps with 20000 reset in 220 ms.
Computed a total of 56 stabilizing places and 72 stable transitions
Computed a total of 56 stabilizing places and 72 stable transitions
Detected a total of 56/263 stabilizing places and 72/432 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 11 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (19 resets) in 181 ms. (219 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (14 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
[2025-06-02 20:58:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/239 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/647 variables, 239/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/671 variables, 12/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/671 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/687 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/687 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/695 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/695 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/695 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/239 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/647 variables, 239/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:05] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:05] [INFO ] Deduced a trap composed of 59 places in 309 ms of which 56 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/671 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/687 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/687 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/695 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/695 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/695 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 695/695 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1531ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 432/432 transitions.
Graph (trivial) has 197 edges and 263 vertex of which 11 / 263 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 255 transition count 382
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 78 place count 219 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 217 transition count 377
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 80 place count 217 transition count 349
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 136 place count 189 transition count 349
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 180 place count 167 transition count 327
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 240 place count 137 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 137 transition count 403
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 257 place count 137 transition count 388
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 278 place count 122 transition count 382
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 282 place count 118 transition count 378
Iterating global reduction 4 with 4 rules applied. Total rules applied 286 place count 118 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 292 place count 118 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 310 place count 118 transition count 354
Applied a total of 310 rules in 57 ms. Remains 118 /263 variables (removed 145) and now considering 354/432 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 118/263 places, 354/432 transitions.
RANDOM walk for 21981 steps (1102 resets) in 74 ms. (293 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) p3), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3)), (F p0)]
Knowledge based reduction with 6 factoid took 229 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p0) (NOT p3))]
Support contains 2 out of 263 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 432/432 transitions.
Applied a total of 0 rules in 3 ms. Remains 263 /263 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2025-06-02 20:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:58:07] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-06-02 20:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:58:07] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2025-06-02 20:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:19] [INFO ] Deduced a trap composed of 146 places in 302 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:19] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:19] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:20] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:20] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:20] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:21] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:27] [INFO ] Deduced a trap composed of 155 places in 281 ms of which 45 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:32] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 263/695 variables, and 16 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:41] [INFO ] Deduced a trap composed of 148 places in 258 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:41] [INFO ] Deduced a trap composed of 147 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:41] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:46] [INFO ] Deduced a trap composed of 81 places in 309 ms of which 55 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:52] [INFO ] Deduced a trap composed of 148 places in 288 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:53] [INFO ] Deduced a trap composed of 147 places in 312 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:53] [INFO ] Deduced a trap composed of 86 places in 283 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:54] [INFO ] Deduced a trap composed of 153 places in 259 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:55] [INFO ] Deduced a trap composed of 148 places in 264 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:55] [INFO ] Deduced a trap composed of 78 places in 274 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:58:55] [INFO ] Deduced a trap composed of 148 places in 289 ms of which 55 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:00] [INFO ] Deduced a trap composed of 155 places in 317 ms of which 66 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 431 unsolved
(s248 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/695 variables, and 28 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in LTL mode , in 1 iterations and 60812 ms. Remains : 263/263 places, 432/432 transitions.
Computed a total of 56 stabilizing places and 72 stable transitions
Computed a total of 56 stabilizing places and 72 stable transitions
Knowledge obtained : [(AND (NOT p0) p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40000 steps (17 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2025-06-02 20:59:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/239 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/647 variables, 239/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/671 variables, 12/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/671 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/687 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/687 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/695 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/695 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/695 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/239 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/647 variables, 239/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:09] [INFO ] Deduced a trap composed of 39 places in 239 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:09] [INFO ] Deduced a trap composed of 59 places in 294 ms of which 54 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/671 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/687 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/687 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/695 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/695 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/695 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 695/695 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1824ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 432/432 transitions.
Graph (trivial) has 197 edges and 263 vertex of which 11 / 263 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 255 transition count 382
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 78 place count 219 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 217 transition count 377
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 80 place count 217 transition count 349
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 136 place count 189 transition count 349
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 180 place count 167 transition count 327
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 240 place count 137 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 137 transition count 403
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 257 place count 137 transition count 388
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 278 place count 122 transition count 382
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 282 place count 118 transition count 378
Iterating global reduction 4 with 4 rules applied. Total rules applied 286 place count 118 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 292 place count 118 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 310 place count 118 transition count 354
Applied a total of 310 rules in 55 ms. Remains 118 /263 variables (removed 145) and now considering 354/432 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 118/263 places, 354/432 transitions.
RANDOM walk for 22187 steps (1078 resets) in 82 ms. (267 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p3)]
False Knowledge obtained : [(F (NOT p3)), (F p0)]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 20000 reset in 237 ms.
Product exploration explored 100000 steps with 20000 reset in 330 ms.
Applying partial POR strategy [false, true, false, false, true, false]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), true, (AND (NOT p0) (NOT p3))]
Support contains 2 out of 263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 263/263 places, 432/432 transitions.
Graph (trivial) has 194 edges and 263 vertex of which 8 / 263 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 257 transition count 425
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 257 transition count 422
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 40 place count 257 transition count 445
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 57 place count 257 transition count 445
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 253 transition count 441
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 253 transition count 441
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 98 place count 253 transition count 454
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 109 place count 242 transition count 443
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 120 place count 242 transition count 443
Performed 33 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 153 place count 242 transition count 644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 242 transition count 642
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 161 place count 236 transition count 630
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 167 place count 236 transition count 630
Deduced a syphon composed of 98 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 236 transition count 628
Deduced a syphon composed of 98 places in 0 ms
Applied a total of 169 rules in 79 ms. Remains 236 /263 variables (removed 27) and now considering 628/432 (removed -196) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:59:12] [INFO ] Redundant transitions in 50 ms returned []
Running 624 sub problems to find dead transitions.
[2025-06-02 20:59:12] [INFO ] Flow matrix only has 610 transitions (discarded 18 similar events)
// Phase 1: matrix 610 rows 236 cols
[2025-06-02 20:59:12] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 20:59:12] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:22] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:22] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 6 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:22] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:22] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:22] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 6 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:22] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:22] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 19 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
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-02 20:59:22] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 16 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:23] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 20 ms to minimize.
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:23] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 18 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:24] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:24] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 18 ms to minimize.
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:24] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 21 ms to minimize.
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 14/21 constraints. Problems are: Problem set: 205 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:59:27] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 1/22 constraints. Problems are: Problem set: 205 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/22 constraints. Problems are: Problem set: 205 solved, 419 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD279 is UNSAT
At refinement iteration 5 (OVERLAPS) 609/845 variables, 236/258 constraints. Problems are: Problem set: 219 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/845 variables, 23/281 constraints. Problems are: Problem set: 219 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 845/846 variables, and 281 constraints, problems are : Problem set: 219 solved, 405 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 236/236 constraints, ReadFeed: 23/24 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 219 solved, 405 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 219 solved, 405 unsolved
At refinement iteration 1 (OVERLAPS) 91/228 variables, 7/7 constraints. Problems are: Problem set: 219 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 15/22 constraints. Problems are: Problem set: 219 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/22 constraints. Problems are: Problem set: 219 solved, 405 unsolved
At refinement iteration 4 (OVERLAPS) 607/835 variables, 228/250 constraints. Problems are: Problem set: 219 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 23/273 constraints. Problems are: Problem set: 219 solved, 405 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 405/678 constraints. Problems are: Problem set: 219 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/846 variables, and 678 constraints, problems are : Problem set: 219 solved, 405 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 228/236 constraints, ReadFeed: 23/24 constraints, PredecessorRefiner: 405/624 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 219 solved, 405 unsolved
Search for dead transitions found 219 dead transitions in 60297ms
Found 219 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 219 transitions
Dead transitions reduction (with SMT) removed 219 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 236/263 places, 409/432 transitions.
Graph (complete) has 723 edges and 236 vertex of which 138 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.2 ms
Discarding 98 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 138 /236 variables (removed 98) and now considering 409/409 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 138/263 places, 409/432 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60448 ms. Remains : 138/263 places, 409/432 transitions.
Built C files in :
/tmp/ltsmin17242350212113625668
[2025-06-02 21:00:12] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17242350212113625668
Running compilation step : cd /tmp/ltsmin17242350212113625668;'/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 1520 ms.
Running link step : cd /tmp/ltsmin17242350212113625668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17242350212113625668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12316254593547902076.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA FireWire-PT-18-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLFireability-08 finished in 192572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 289 transition count 507
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 289 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 289 transition count 506
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 284 transition count 496
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 284 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 281 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 281 transition count 490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 279 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 279 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 277 transition count 480
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 277 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 275 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 275 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 273 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 273 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 271 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 271 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 269 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 269 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 267 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 267 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 265 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 265 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 264 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 264 transition count 453
Applied a total of 75 rules in 60 ms. Remains 264 /301 variables (removed 37) and now considering 453/543 (removed 90) transitions.
// Phase 1: matrix 453 rows 264 cols
[2025-06-02 21:00:14] [INFO ] Computed 7 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:00:14] [INFO ] Implicit Places using invariants in 317 ms returned []
[2025-06-02 21:00:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:00:15] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2025-06-02 21:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:27] [INFO ] Deduced a trap composed of 146 places in 332 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:28] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:28] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:29] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:29] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:30] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:30] [INFO ] Deduced a trap composed of 50 places in 259 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 452 unsolved
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 30119ms
Starting structural reductions in LTL mode, iteration 1 : 264/301 places, 453/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31182 ms. Remains : 264/301 places, 453/543 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-09
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-09 finished in 31351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U p2))))))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Graph (trivial) has 209 edges and 301 vertex of which 8 / 301 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 294 transition count 496
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 255 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 254 transition count 494
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 82 place count 254 transition count 467
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 136 place count 227 transition count 467
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 145 place count 218 transition count 415
Iterating global reduction 3 with 9 rules applied. Total rules applied 154 place count 218 transition count 415
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 157 place count 218 transition count 412
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 215 transition count 405
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 215 transition count 405
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 165 place count 213 transition count 400
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 213 transition count 400
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 211 transition count 395
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 211 transition count 395
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 173 place count 209 transition count 390
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 209 transition count 390
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 177 place count 207 transition count 385
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 207 transition count 385
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 181 place count 205 transition count 380
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 205 transition count 380
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 203 transition count 375
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 203 transition count 375
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 189 place count 201 transition count 371
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 201 transition count 371
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 200 transition count 369
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 200 transition count 369
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 199 transition count 367
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 199 transition count 367
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 245 place count 174 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 246 place count 174 transition count 341
Performed 31 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 308 place count 143 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 310 place count 143 transition count 420
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 311 place count 143 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 312 place count 142 transition count 419
Applied a total of 312 rules in 111 ms. Remains 142 /301 variables (removed 159) and now considering 419/543 (removed 124) transitions.
[2025-06-02 21:00:45] [INFO ] Flow matrix only has 401 transitions (discarded 18 similar events)
// Phase 1: matrix 401 rows 142 cols
[2025-06-02 21:00:45] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:00:46] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-02 21:00:46] [INFO ] Flow matrix only has 401 transitions (discarded 18 similar events)
[2025-06-02 21:00:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:00:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-06-02 21:00:46] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:00:46] [INFO ] Redundant transitions in 5 ms returned []
Running 414 sub problems to find dead transitions.
[2025-06-02 21:00:46] [INFO ] Flow matrix only has 401 transitions (discarded 18 similar events)
[2025-06-02 21:00:46] [INFO ] Invariant cache hit.
[2025-06-02 21:00:46] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:53] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:53] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:54] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:54] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:54] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:55] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:00:55] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (OVERLAPS) 400/542 variables, 142/156 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 542/543 variables, and 179 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (OVERLAPS) 1/142 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (OVERLAPS) 400/542 variables, 142/156 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 414/593 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/543 variables, and 593 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 142/301 places, 419/543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60989 ms. Remains : 142/301 places, 419/543 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-10 finished in 61229 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)) U !p0)))'
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Graph (trivial) has 213 edges and 301 vertex of which 11 / 301 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 292 transition count 496
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 255 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 254 transition count 494
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 78 place count 254 transition count 465
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 136 place count 225 transition count 465
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 145 place count 216 transition count 432
Iterating global reduction 3 with 9 rules applied. Total rules applied 154 place count 216 transition count 432
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 216 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 215 transition count 428
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 162 place count 212 transition count 421
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 212 transition count 421
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 167 place count 210 transition count 416
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 210 transition count 416
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 171 place count 208 transition count 411
Iterating global reduction 5 with 2 rules applied. Total rules applied 173 place count 208 transition count 411
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 175 place count 206 transition count 406
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 206 transition count 406
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 179 place count 204 transition count 401
Iterating global reduction 5 with 2 rules applied. Total rules applied 181 place count 204 transition count 401
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 183 place count 202 transition count 396
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 202 transition count 396
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 187 place count 200 transition count 391
Iterating global reduction 5 with 2 rules applied. Total rules applied 189 place count 200 transition count 391
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 191 place count 198 transition count 387
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 198 transition count 387
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 195 place count 196 transition count 383
Iterating global reduction 5 with 2 rules applied. Total rules applied 197 place count 196 transition count 383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 195 transition count 381
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 195 transition count 381
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 249 place count 170 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 170 transition count 355
Performed 31 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 312 place count 139 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 316 place count 139 transition count 468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 317 place count 138 transition count 467
Applied a total of 317 rules in 107 ms. Remains 138 /301 variables (removed 163) and now considering 467/543 (removed 76) transitions.
[2025-06-02 21:01:47] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
// Phase 1: matrix 443 rows 138 cols
[2025-06-02 21:01:47] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:01:47] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-02 21:01:47] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2025-06-02 21:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:01:47] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 21:01:48] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:01:48] [INFO ] Redundant transitions in 7 ms returned []
Running 462 sub problems to find dead transitions.
[2025-06-02 21:01:48] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2025-06-02 21:01:48] [INFO ] Invariant cache hit.
[2025-06-02 21:01:48] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:01:56] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:01:57] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:01:57] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:01:58] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:01:58] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:01:58] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 442/580 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 26/177 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/581 variables, and 177 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 442/580 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 26/177 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 462/639 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 639 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/301 places, 467/543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61229 ms. Remains : 138/301 places, 467/543 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : FireWire-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 312 ms.
Product exploration explored 100000 steps with 0 reset in 405 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
RANDOM walk for 40000 steps (2108 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (477 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3787 steps, run visited all 1 properties in 21 ms. (steps per millisecond=180 )
Probabilistic random walk after 3787 steps, saw 1589 distinct states, run finished after 22 ms. (steps per millisecond=172 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 467/467 transitions.
Applied a total of 0 rules in 6 ms. Remains 138 /138 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2025-06-02 21:02:49] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2025-06-02 21:02:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:02:49] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-02 21:02:49] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2025-06-02 21:02:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:02:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-02 21:02:50] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:02:50] [INFO ] Redundant transitions in 5 ms returned []
Running 462 sub problems to find dead transitions.
[2025-06-02 21:02:50] [INFO ] Flow matrix only has 443 transitions (discarded 24 similar events)
[2025-06-02 21:02:50] [INFO ] Invariant cache hit.
[2025-06-02 21:02:50] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:02:58] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:02:59] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:02:59] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:02:59] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:00] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:03:00] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (OVERLAPS) 442/580 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 26/177 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/581 variables, and 177 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 442/580 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 26/177 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 462/639 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/581 variables, and 639 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60750 ms. Remains : 138/138 places, 467/467 transitions.
Computed a total of 21 stabilizing places and 36 stable transitions
Computed a total of 21 stabilizing places and 36 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
RANDOM walk for 40000 steps (2099 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (482 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3787 steps, run visited all 1 properties in 27 ms. (steps per millisecond=140 )
Probabilistic random walk after 3787 steps, saw 1589 distinct states, run finished after 27 ms. (steps per millisecond=140 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
Stuttering acceptance computed with spot in 45 ms :[p0]
Stuttering acceptance computed with spot in 45 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 1 reset in 457 ms.
Built C files in :
/tmp/ltsmin14943976795219640768
[2025-06-02 21:03:51] [INFO ] Computing symmetric may disable matrix : 467 transitions.
[2025-06-02 21:03:51] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:03:51] [INFO ] Computing symmetric may enable matrix : 467 transitions.
[2025-06-02 21:03:51] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:03:51] [INFO ] Computing Do-Not-Accords matrix : 467 transitions.
[2025-06-02 21:03:51] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:03:51] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14943976795219640768
Running compilation step : cd /tmp/ltsmin14943976795219640768;'/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 1723 ms.
Running link step : cd /tmp/ltsmin14943976795219640768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin14943976795219640768;'/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/stateBased881443113374003037.hoa' '--buchi-type=spotba'
LTSmin run took 1991 ms.
FORMULA FireWire-PT-18-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLFireability-12 finished in 128179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Graph (trivial) has 210 edges and 301 vertex of which 11 / 301 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 292 transition count 496
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 255 transition count 494
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 254 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 253 transition count 493
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 80 place count 253 transition count 464
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 138 place count 224 transition count 464
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 147 place count 215 transition count 412
Iterating global reduction 4 with 9 rules applied. Total rules applied 156 place count 215 transition count 412
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 161 place count 215 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 162 place count 214 transition count 407
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 164 place count 212 transition count 402
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 212 transition count 402
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 168 place count 210 transition count 397
Iterating global reduction 6 with 2 rules applied. Total rules applied 170 place count 210 transition count 397
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 172 place count 208 transition count 392
Iterating global reduction 6 with 2 rules applied. Total rules applied 174 place count 208 transition count 392
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 176 place count 206 transition count 387
Iterating global reduction 6 with 2 rules applied. Total rules applied 178 place count 206 transition count 387
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 180 place count 204 transition count 382
Iterating global reduction 6 with 2 rules applied. Total rules applied 182 place count 204 transition count 382
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 184 place count 202 transition count 377
Iterating global reduction 6 with 2 rules applied. Total rules applied 186 place count 202 transition count 377
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 188 place count 200 transition count 372
Iterating global reduction 6 with 2 rules applied. Total rules applied 190 place count 200 transition count 372
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 192 place count 198 transition count 368
Iterating global reduction 6 with 2 rules applied. Total rules applied 194 place count 198 transition count 368
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 196 place count 196 transition count 364
Iterating global reduction 6 with 2 rules applied. Total rules applied 198 place count 196 transition count 364
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 199 place count 195 transition count 362
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 195 transition count 362
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 250 place count 170 transition count 337
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 310 place count 140 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 315 place count 140 transition count 409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 316 place count 139 transition count 408
Applied a total of 316 rules in 62 ms. Remains 139 /301 variables (removed 162) and now considering 408/543 (removed 135) transitions.
[2025-06-02 21:03:55] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
// Phase 1: matrix 389 rows 139 cols
[2025-06-02 21:03:55] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:03:55] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-02 21:03:55] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
[2025-06-02 21:03:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:03:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 21:03:56] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:03:56] [INFO ] Redundant transitions in 5 ms returned []
Running 403 sub problems to find dead transitions.
[2025-06-02 21:03:56] [INFO ] Flow matrix only has 389 transitions (discarded 19 similar events)
[2025-06-02 21:03:56] [INFO ] Invariant cache hit.
[2025-06-02 21:03:56] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:03] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:03] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:04] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:04] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:04] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:05] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:04:05] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (OVERLAPS) 388/527 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 25/178 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/528 variables, and 178 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 388/527 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 25/178 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 403/581 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/528 variables, and 581 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 139/301 places, 408/543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61027 ms. Remains : 139/301 places, 408/543 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-13 finished in 61137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Graph (trivial) has 208 edges and 301 vertex of which 8 / 301 are part of one of the 2 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 294 transition count 497
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 256 transition count 495
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 255 transition count 494
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 254 transition count 494
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 82 place count 254 transition count 465
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 140 place count 225 transition count 465
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 148 place count 217 transition count 414
Iterating global reduction 4 with 8 rules applied. Total rules applied 156 place count 217 transition count 414
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 159 place count 217 transition count 411
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 162 place count 214 transition count 404
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 214 transition count 404
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 167 place count 212 transition count 399
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 212 transition count 399
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 171 place count 210 transition count 394
Iterating global reduction 5 with 2 rules applied. Total rules applied 173 place count 210 transition count 394
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 175 place count 208 transition count 389
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 208 transition count 389
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 179 place count 206 transition count 384
Iterating global reduction 5 with 2 rules applied. Total rules applied 181 place count 206 transition count 384
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 183 place count 204 transition count 379
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 204 transition count 379
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 187 place count 202 transition count 374
Iterating global reduction 5 with 2 rules applied. Total rules applied 189 place count 202 transition count 374
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 191 place count 200 transition count 370
Iterating global reduction 5 with 2 rules applied. Total rules applied 193 place count 200 transition count 370
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 195 place count 198 transition count 366
Iterating global reduction 5 with 2 rules applied. Total rules applied 197 place count 198 transition count 366
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 197 transition count 364
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 197 transition count 364
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 249 place count 172 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 250 place count 172 transition count 338
Performed 30 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 310 place count 142 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 312 place count 142 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 313 place count 141 transition count 411
Applied a total of 313 rules in 67 ms. Remains 141 /301 variables (removed 160) and now considering 411/543 (removed 132) transitions.
[2025-06-02 21:04:56] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
// Phase 1: matrix 396 rows 141 cols
[2025-06-02 21:04:56] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:04:56] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-06-02 21:04:56] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2025-06-02 21:04:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:04:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 21:04:57] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:04:57] [INFO ] Redundant transitions in 3 ms returned []
Running 406 sub problems to find dead transitions.
[2025-06-02 21:04:57] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2025-06-02 21:04:57] [INFO ] Invariant cache hit.
[2025-06-02 21:04:57] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:04] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:04] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:05] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:05] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:05] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:05:06] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 395/536 variables, 141/154 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 23/177 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 1/537 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/537 variables, and 178 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (OVERLAPS) 395/536 variables, 141/154 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 23/177 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 406/583 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/537 variables, and 583 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 23/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/301 places, 411/543 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60998 ms. Remains : 141/301 places, 411/543 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 3 reset in 149 ms.
Product exploration explored 100000 steps with 2 reset in 158 ms.
Computed a total of 21 stabilizing places and 37 stable transitions
Computed a total of 21 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 1018 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (17 resets) in 112 ms. (353 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40000 steps (20 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (12 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
[2025-06-02 21:05:59] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2025-06-02 21:05:59] [INFO ] Invariant cache hit.
[2025-06-02 21:05:59] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/528 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/536 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/537 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/537 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/528 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 8/536 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/537 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/537 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1253ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 46 ms.
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 411/411 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 409
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 141 transition count 408
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 140 transition count 408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 139 transition count 405
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 139 transition count 405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 139 transition count 404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 139 transition count 403
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 138 transition count 403
Free-agglomeration rule applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 22 place count 138 transition count 390
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 40 place count 125 transition count 385
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 123 transition count 383
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 123 transition count 383
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 47 place count 123 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 64 place count 123 transition count 363
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 123 transition count 363
Applied a total of 65 rules in 42 ms. Remains 123 /141 variables (removed 18) and now considering 363/411 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 123/141 places, 363/411 transitions.
RANDOM walk for 40000 steps (22 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3186 steps, run visited all 1 properties in 26 ms. (steps per millisecond=122 )
Probabilistic random walk after 3186 steps, saw 1441 distinct states, run finished after 27 ms. (steps per millisecond=118 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p2) p0))), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 1576 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 411/411 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2025-06-02 21:06:02] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2025-06-02 21:06:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:06:02] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-02 21:06:02] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2025-06-02 21:06:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:06:03] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 21:06:03] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:06:03] [INFO ] Redundant transitions in 5 ms returned []
Running 406 sub problems to find dead transitions.
[2025-06-02 21:06:03] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2025-06-02 21:06:03] [INFO ] Invariant cache hit.
[2025-06-02 21:06:03] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:11] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:11] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:12] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:12] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:12] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:06:13] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (OVERLAPS) 395/536 variables, 141/154 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 23/177 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 1/537 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 537/537 variables, and 178 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 1/141 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (OVERLAPS) 395/536 variables, 141/154 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 23/177 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 406/583 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/537 variables, and 583 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 23/24 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61202 ms. Remains : 141/141 places, 411/411 transitions.
Computed a total of 21 stabilizing places and 37 stable transitions
Computed a total of 21 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Knowledge based reduction with 9 factoid took 988 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (11 resets) in 116 ms. (341 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40000 steps (17 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
[2025-06-02 21:07:05] [INFO ] Flow matrix only has 396 transitions (discarded 15 similar events)
[2025-06-02 21:07:05] [INFO ] Invariant cache hit.
[2025-06-02 21:07:05] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/528 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/536 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/537 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/537 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/133 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 395/528 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 23/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 8/536 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/537 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/537 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 176 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1522ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 213 ms.
Support contains 5 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 411/411 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 409
Free-agglomeration rule applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 16 place count 141 transition count 395
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 127 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 125 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 125 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 125 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 59 place count 125 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 125 transition count 368
Applied a total of 60 rules in 34 ms. Remains 125 /141 variables (removed 16) and now considering 368/411 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 125/141 places, 368/411 transitions.
RANDOM walk for 40000 steps (16 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (27 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 3839 steps, run visited all 4 properties in 72 ms. (steps per millisecond=53 )
Probabilistic random walk after 3839 steps, saw 1687 distinct states, run finished after 72 ms. (steps per millisecond=53 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (F (NOT p1)), (F (NOT (OR (NOT p2) p0))), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 1205 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Built C files in :
/tmp/ltsmin7734319904174267063
[2025-06-02 21:07:09] [INFO ] Computing symmetric may disable matrix : 411 transitions.
[2025-06-02 21:07:09] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:07:09] [INFO ] Computing symmetric may enable matrix : 411 transitions.
[2025-06-02 21:07:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:07:09] [INFO ] Computing Do-Not-Accords matrix : 411 transitions.
[2025-06-02 21:07:09] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 21:07:09] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7734319904174267063
Running compilation step : cd /tmp/ltsmin7734319904174267063;'/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 1592 ms.
Running link step : cd /tmp/ltsmin7734319904174267063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7734319904174267063;'/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/stateBased9554503897257172564.hoa' '--buchi-type=spotba'
LTSmin run took 1569 ms.
FORMULA FireWire-PT-18-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLFireability-14 finished in 136116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 301/301 places, 543/543 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 288 transition count 487
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 288 transition count 487
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 288 transition count 485
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 283 transition count 475
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 283 transition count 475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 280 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 278 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 278 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 276 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 274 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 274 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 272 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 272 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 270 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 270 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 268 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 268 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 267 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 267 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 266 transition count 437
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 266 transition count 437
Applied a total of 72 rules in 30 ms. Remains 266 /301 variables (removed 35) and now considering 437/543 (removed 106) transitions.
// Phase 1: matrix 437 rows 266 cols
[2025-06-02 21:07:12] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:07:12] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-02 21:07:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:07:13] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2025-06-02 21:07:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:24] [INFO ] Deduced a trap composed of 146 places in 350 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:25] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:25] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:26] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:26] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:26] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:27] [INFO ] Deduced a trap composed of 39 places in 248 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:29] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 45 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:33] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:07:33] [INFO ] Deduced a trap composed of 81 places in 292 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/703 variables, and 17 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/266 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 437/703 variables, 266/283 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 436/719 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:08:12] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 39 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 720 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 266/301 places, 437/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60792 ms. Remains : 266/301 places, 437/543 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 59 stabilizing places and 77 stable transitions
Computed a total of 59 stabilizing places and 77 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLFireability-15 finished in 61281 ms.
All properties solved by simple procedures.
Total runtime 1290103 ms.

BK_STOP 1748898493866

--------------------
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="FireWire-PT-18"
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 FireWire-PT-18, 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 r086-smll-174860102400380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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