About the Execution of ITS-Tools for FireWire-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1140413.00 | 0.00 | 0.00 | FFFFFFFFTTFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102100244.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-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102100244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.2K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K 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 103K 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 84K 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-01-LTLFireability-00
FORMULA_NAME FireWire-PT-01-LTLFireability-01
FORMULA_NAME FireWire-PT-01-LTLFireability-02
FORMULA_NAME FireWire-PT-01-LTLFireability-03
FORMULA_NAME FireWire-PT-01-LTLFireability-04
FORMULA_NAME FireWire-PT-01-LTLFireability-05
FORMULA_NAME FireWire-PT-01-LTLFireability-06
FORMULA_NAME FireWire-PT-01-LTLFireability-07
FORMULA_NAME FireWire-PT-01-LTLFireability-08
FORMULA_NAME FireWire-PT-01-LTLFireability-09
FORMULA_NAME FireWire-PT-01-LTLFireability-10
FORMULA_NAME FireWire-PT-01-LTLFireability-11
FORMULA_NAME FireWire-PT-01-LTLFireability-12
FORMULA_NAME FireWire-PT-01-LTLFireability-13
FORMULA_NAME FireWire-PT-01-LTLFireability-14
FORMULA_NAME FireWire-PT-01-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748839857850
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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 04:51:00] [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 04:51:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 04:51:00] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-06-02 04:51:00] [INFO ] Transformed 107 places.
[2025-06-02 04:51:00] [INFO ] Transformed 346 transitions.
[2025-06-02 04:51:00] [INFO ] Found NUPN structural information;
[2025-06-02 04:51:01] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 430 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-01-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 293/293 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 285
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 103 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 103 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 103 transition count 277
Applied a total of 14 rules in 97 ms. Remains 103 /107 variables (removed 4) and now considering 277/293 (removed 16) transitions.
[2025-06-02 04:51:01] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
// Phase 1: matrix 251 rows 103 cols
[2025-06-02 04:51:01] [INFO ] Computed 8 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:51:02] [INFO ] Implicit Places using invariants in 615 ms returned []
[2025-06-02 04:51:02] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
[2025-06-02 04:51:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:51:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 04:51:02] [INFO ] Implicit Places using invariants and state equation in 555 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1255 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 277/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1395 ms. Remains : 102/107 places, 277/293 transitions.
Support contains 31 out of 102 places after structural reductions.
[2025-06-02 04:51:03] [INFO ] Flatten gal took : 108 ms
[2025-06-02 04:51:03] [INFO ] Flatten gal took : 61 ms
[2025-06-02 04:51:03] [INFO ] Input system was already deterministic with 277 transitions.
RANDOM walk for 40000 steps (2202 resets) in 3355 ms. (11 steps per ms) remains 13/27 properties
BEST_FIRST walk for 40003 steps (22 resets) in 491 ms. (81 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (588 resets) in 422 ms. (94 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (582 resets) in 204 ms. (195 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40002 steps (569 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (34 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1065 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (17 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1531 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1087 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (537 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
[2025-06-02 04:51:05] [INFO ] Flow matrix only has 251 transitions (discarded 26 similar events)
// Phase 1: matrix 251 rows 102 cols
[2025-06-02 04:51:05] [INFO ] Computed 7 invariants in 14 ms
[2025-06-02 04:51:05] [INFO ] State equation strengthened by 38 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 59/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 25/98 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:06] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 38 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 247/345 variables, 98/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 36/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:06] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 4/349 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 3/352 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/352 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/353 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/353 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 149 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 59/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 25/98 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:08] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:08] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 247/345 variables, 98/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 10/155 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:08] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 4/349 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 3/352 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/352 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1/353 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 162 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6419ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 2054 ms.
Support contains 14 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 277/277 transitions.
Drop transitions (Empty/Sink Transition effects.) 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 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 101 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 101 transition count 272
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 7 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 99 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 99 transition count 270
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 96 transition count 277
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 96 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 96 transition count 268
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 96 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 31 place count 94 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 94 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 93 transition count 265
Applied a total of 34 rules in 122 ms. Remains 93 /102 variables (removed 9) and now considering 265/277 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 93/102 places, 265/277 transitions.
RANDOM walk for 40000 steps (2538 resets) in 913 ms. (43 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (669 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (676 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (634 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (21 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1469 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2314 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1477 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
[2025-06-02 04:51:14] [INFO ] Flow matrix only has 236 transitions (discarded 29 similar events)
// Phase 1: matrix 236 rows 93 cols
[2025-06-02 04:51:14] [INFO ] Computed 7 invariants in 4 ms
[2025-06-02 04:51:14] [INFO ] State equation strengthened by 38 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 54/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 210/277 variables, 67/70 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 48/325 variables, 23/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/329 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/329 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 138 constraints, problems are : Problem set: 0 solved, 8 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.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) 54/67 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 210/277 variables, 67/70 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 48/325 variables, 23/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 8/142 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 04:51:16] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 4/329 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/147 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 04:51:17] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/329 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 148 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3285ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 265/265 transitions.
Applied a total of 0 rules in 16 ms. Remains 93 /93 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 93/93 places, 265/265 transitions.
RANDOM walk for 40000 steps (2583 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (644 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (630 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (639 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (17 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1492 resets) in 234 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (12 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2292 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1482 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 15845 steps, run visited all 8 properties in 190 ms. (steps per millisecond=83 )
Probabilistic random walk after 15845 steps, saw 6257 distinct states, run finished after 198 ms. (steps per millisecond=80 ) properties seen :8
FORMULA FireWire-PT-01-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 7 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' '!(X(X(X(X(X(X((!p0 U (G(!p0)||(!p0&&G(p1)))))))))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 275
Applied a total of 2 rules in 10 ms. Remains 101 /102 variables (removed 1) and now considering 275/277 (removed 2) transitions.
[2025-06-02 04:51:19] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 101 cols
[2025-06-02 04:51:19] [INFO ] Computed 7 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:51:19] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-02 04:51:19] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2025-06-02 04:51:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:51:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 04:51:19] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-02 04:51:19] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2025-06-02 04:51:19] [INFO ] Invariant cache hit.
[2025-06-02 04:51:19] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:24] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:24] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:24] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:25] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:25] [INFO ] Deduced a trap composed of 36 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 04:51:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:51:25] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 248/349 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 153 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 248/349 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 274/426 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 427 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in LTL mode, iteration 1 : 101/102 places, 275/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60930 ms. Remains : 101/102 places, 275/277 transitions.
Stuttering acceptance computed with spot in 818 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1), p0, p0, p0, p0, p0, p0]
Running random walk in product with property : FireWire-PT-01-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 257 ms.
Product exploration explored 100000 steps with 0 reset in 247 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 507 ms :[true, p0, (NOT p1), (AND p0 (NOT p1)), p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (2207 resets) in 655 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (18 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (570 resets) in 316 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (22 resets) in 367 ms. (108 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (518 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1489392 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :5 out of 6
Probabilistic random walk after 1489392 steps, saw 272741 distinct states, run finished after 3005 ms. (steps per millisecond=495 ) properties seen :5
[2025-06-02 04:52:25] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2025-06-02 04:52:25] [INFO ] Invariant cache hit.
[2025-06-02 04:52:25] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 53/350 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/101 constraints, ReadFeed: 0/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 284 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[true, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 376 ms :[true, p0, p0, p0, p0, p0, p0, p0]
Support contains 2 out of 101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2025-06-02 04:52:27] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2025-06-02 04:52:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:52:27] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 04:52:27] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2025-06-02 04:52:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:52:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 04:52:27] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-02 04:52:27] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2025-06-02 04:52:27] [INFO ] Invariant cache hit.
[2025-06-02 04:52:27] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:52:31] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:52:31] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:52:31] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:52:32] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:52:32] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:52:32] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:52:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 248/349 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 274 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 1.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 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 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.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 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.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 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 153 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 248/349 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 274/426 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 427 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 60233ms
Finished structural reductions in LTL mode , in 1 iterations and 60806 ms. Remains : 101/101 places, 275/275 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[true, p0, p0, p0, p0, p0, p0, p0]
RANDOM walk for 40000 steps (2212 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (25 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 256 steps, run visited all 1 properties in 5 ms. (steps per millisecond=51 )
Probabilistic random walk after 256 steps, saw 195 distinct states, run finished after 5 ms. (steps per millisecond=51 ) properties seen :1
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[true, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 360 ms :[true, p0, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 355 ms :[true, p0, p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 363 ms.
Product exploration explored 100000 steps with 1 reset in 183 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 357 ms :[true, p0, p0, p0, p0, p0, p0, p0]
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 101 transition count 275
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 101 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 99 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 99 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 98 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 98 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 98 transition count 282
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 98 transition count 276
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 59 ms. Remains 98 /101 variables (removed 3) and now considering 276/275 (removed -1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:53:31] [INFO ] Redundant transitions in 29 ms returned []
Running 275 sub problems to find dead transitions.
[2025-06-02 04:53:31] [INFO ] Flow matrix only has 243 transitions (discarded 33 similar events)
// Phase 1: matrix 243 rows 98 cols
[2025-06-02 04:53:31] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 04:53:31] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:34] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:34] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:35] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:35] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:35] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:35] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:35] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:35] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:53:36] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 10/17 constraints. Problems are: Problem set: 6 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 6 solved, 269 unsolved
Problem TDEAD248 is UNSAT
At refinement iteration 4 (OVERLAPS) 242/340 variables, 98/115 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 39/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/341 variables, 1/155 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/155 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/155 constraints. Problems are: Problem set: 7 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 155 constraints, problems are : Problem set: 7 solved, 268 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 4/97 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 10/17 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/17 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 242/339 variables, 97/114 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 39/153 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 268/421 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/421 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/422 constraints. Problems are: Problem set: 7 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/341 variables, and 422 constraints, problems are : Problem set: 7 solved, 268 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 268/275 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60243ms problems are : Problem set: 7 solved, 268 unsolved
Search for dead transitions found 7 dead transitions in 60245ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/101 places, 269/275 transitions.
Graph (complete) has 522 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 94 /98 variables (removed 4) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/101 places, 269/275 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60374 ms. Remains : 94/101 places, 269/275 transitions.
Built C files in :
/tmp/ltsmin3919903168441946803
[2025-06-02 04:54:31] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3919903168441946803
Running compilation step : cd /tmp/ltsmin3919903168441946803;'/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 1067 ms.
Running link step : cd /tmp/ltsmin3919903168441946803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin3919903168441946803;'/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/stateBased11902520721354314108.hoa' '--buchi-type=spotba'
LTSmin run took 1023 ms.
FORMULA FireWire-PT-01-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-01-LTLFireability-02 finished in 194409 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((F(G(p0)) U p1))||(X(p2) U p1))))'
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 99 transition count 270
Applied a total of 6 rules in 4 ms. Remains 99 /102 variables (removed 3) and now considering 270/277 (removed 7) transitions.
[2025-06-02 04:54:33] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2025-06-02 04:54:33] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:54:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 04:54:33] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 04:54:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:54:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:54:33] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 04:54:33] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 04:54:33] [INFO ] Invariant cache hit.
[2025-06-02 04:54:33] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:54:38] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:54:38] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:54:38] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:54:38] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:54:39] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:54:39] [INFO ] Deduced a trap composed of 36 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 04:54:39] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 27043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57125ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 57126ms
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 270/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57432 ms. Remains : 99/102 places, 270/277 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-03 finished in 57757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1||X(p2)))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 99 transition count 270
Applied a total of 6 rules in 5 ms. Remains 99 /102 variables (removed 3) and now considering 270/277 (removed 7) transitions.
[2025-06-02 04:55:31] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 04:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:55:31] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 04:55:31] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 04:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:55:31] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:55:31] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 04:55:31] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 04:55:31] [INFO ] Invariant cache hit.
[2025-06-02 04:55:31] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:35] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:35] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:36] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:36] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:36] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:36] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:55:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 26651 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56775ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 56776ms
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 270/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57283 ms. Remains : 99/102 places, 270/277 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 383 ms.
Product exploration explored 100000 steps with 0 reset in 186 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2220 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33690 steps (470 resets) in 26 ms. (1247 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (NOT p0) (NOT p2))))), (X (X p0)), (X (X (AND p0 p2)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2025-06-02 04:56:30] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 04:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:56:30] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 04:56:30] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 04:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:56:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:56:30] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 04:56:30] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 04:56:30] [INFO ] Invariant cache hit.
[2025-06-02 04:56:30] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:56:34] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:56:34] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:56:34] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:56:34] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:56:35] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:56:35] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:56:35] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 26698 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56831ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 56833ms
Finished structural reductions in LTL mode , in 1 iterations and 57323 ms. Remains : 99/99 places, 270/270 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2218 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (568 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16742 steps, run visited all 1 properties in 58 ms. (steps per millisecond=288 )
Probabilistic random walk after 16742 steps, saw 6629 distinct states, run finished after 58 ms. (steps per millisecond=288 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 270/270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 99 transition count 270
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 98 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 98 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 98 transition count 282
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 98 transition count 276
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 13 rules in 23 ms. Remains 98 /99 variables (removed 1) and now considering 276/270 (removed -6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:57:29] [INFO ] Redundant transitions in 12 ms returned []
Running 275 sub problems to find dead transitions.
[2025-06-02 04:57:29] [INFO ] Flow matrix only has 243 transitions (discarded 33 similar events)
// Phase 1: matrix 243 rows 98 cols
[2025-06-02 04:57:29] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 04:57:29] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:33] [INFO ] Deduced a trap composed of 35 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 04:57:33] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 4 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:33] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:33] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:33] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:33] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:33] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:34] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:57:34] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 10/17 constraints. Problems are: Problem set: 6 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 6 solved, 269 unsolved
Problem TDEAD248 is UNSAT
At refinement iteration 4 (OVERLAPS) 242/340 variables, 98/115 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 39/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/341 variables, 1/155 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/155 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/155 constraints. Problems are: Problem set: 7 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 155 constraints, problems are : Problem set: 7 solved, 268 unsolved in 28029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 4/97 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 10/17 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/17 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 242/339 variables, 97/114 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 39/153 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 268/421 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/421 constraints. Problems are: Problem set: 7 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/422 constraints. Problems are: Problem set: 7 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/341 variables, and 422 constraints, problems are : Problem set: 7 solved, 268 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 268/275 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58156ms problems are : Problem set: 7 solved, 268 unsolved
Search for dead transitions found 7 dead transitions in 58157ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/99 places, 269/270 transitions.
Graph (complete) has 522 edges and 98 vertex of which 94 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 94 /98 variables (removed 4) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/99 places, 269/270 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58213 ms. Remains : 94/99 places, 269/270 transitions.
Built C files in :
/tmp/ltsmin6709686739232573803
[2025-06-02 04:58:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6709686739232573803
Running compilation step : cd /tmp/ltsmin6709686739232573803;'/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 992 ms.
Running link step : cd /tmp/ltsmin6709686739232573803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin6709686739232573803;'/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/stateBased5367238556022460548.hoa' '--buchi-type=spotba'
LTSmin run took 412 ms.
FORMULA FireWire-PT-01-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-01-LTLFireability-04 finished in 177877 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((F(p1)&&F(p2)&&p0))&&X(X(X(F(p3))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 100 transition count 272
Applied a total of 4 rules in 5 ms. Remains 100 /102 variables (removed 2) and now considering 272/277 (removed 5) transitions.
[2025-06-02 04:58:29] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 100 cols
[2025-06-02 04:58:29] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:58:29] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 04:58:29] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 04:58:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:58:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:58:29] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-02 04:58:29] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 04:58:29] [INFO ] Invariant cache hit.
[2025-06-02 04:58:29] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:58:33] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:58:33] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:58:33] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:58:34] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:58:34] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:58:34] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:58:34] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:58:35] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/346 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 152 constraints, problems are : Problem set: 0 solved, 271 unsolved in 28439 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 271/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/346 variables, and 423 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58569ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 58570ms
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 272/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59091 ms. Remains : 100/102 places, 272/277 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-05 finished in 59456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U p1) U G((p2||X(p3))))&&F(p4)))'
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 272
Applied a total of 4 rules in 5 ms. Remains 100 /102 variables (removed 2) and now considering 272/277 (removed 5) transitions.
[2025-06-02 04:59:28] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 100 cols
[2025-06-02 04:59:28] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:59:28] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 04:59:28] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 04:59:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:59:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 04:59:29] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-02 04:59:29] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 04:59:29] [INFO ] Invariant cache hit.
[2025-06-02 04:59:29] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:59:31] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:59:32] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:59:32] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:59:32] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:59:32] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:59:32] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:59:32] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 151 constraints, problems are : Problem set: 0 solved, 271 unsolved in 28934 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 271/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/346 variables, and 422 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59066ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 59068ms
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 272/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59430 ms. Remains : 100/102 places, 272/277 transitions.
Stuttering acceptance computed with spot in 695 ms :[(OR (NOT p4) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p4), (AND (NOT p0) (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) p1 (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-06 finished in 60167 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 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 100 transition count 274
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 4 place count 99 transition count 274
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 97 transition count 269
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 96 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 93 transition count 268
Applied a total of 22 rules in 44 ms. Remains 93 /102 variables (removed 9) and now considering 268/277 (removed 9) transitions.
[2025-06-02 05:00:28] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2025-06-02 05:00:28] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:00:29] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-02 05:00:29] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:00:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:00:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:00:29] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:00:29] [INFO ] Redundant transitions in 7 ms returned []
Running 265 sub problems to find dead transitions.
[2025-06-02 05:00:29] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:00:29] [INFO ] Invariant cache hit.
[2025-06-02 05:00:29] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:00:31] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:00:31] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:00:31] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:00:31] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:00:32] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:00:32] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:00:32] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/143 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/327 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:00:47] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 145 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/328 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/102 places, 268/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60694 ms. Remains : 93/102 places, 268/277 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-07 finished in 60752 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(X(F(p1)))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 99 transition count 270
Applied a total of 6 rules in 3 ms. Remains 99 /102 variables (removed 3) and now considering 270/277 (removed 7) transitions.
[2025-06-02 05:01:29] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2025-06-02 05:01:29] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:01:29] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-02 05:01:29] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 05:01:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:01:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:01:29] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 05:01:29] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 05:01:29] [INFO ] Invariant cache hit.
[2025-06-02 05:01:29] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:33] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:34] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:34] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:34] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:34] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:34] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:01:35] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 27719 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57798ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 57800ms
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 270/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58123 ms. Remains : 99/102 places, 270/277 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 310 ms.
Product exploration explored 100000 steps with 33333 reset in 398 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-01-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-01-LTLFireability-08 finished in 59123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 272
Applied a total of 4 rules in 3 ms. Remains 100 /102 variables (removed 2) and now considering 272/277 (removed 5) transitions.
[2025-06-02 05:02:28] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
// Phase 1: matrix 246 rows 100 cols
[2025-06-02 05:02:28] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:02:28] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-02 05:02:28] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 05:02:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:02:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:02:29] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-02 05:02:29] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 05:02:29] [INFO ] Invariant cache hit.
[2025-06-02 05:02:29] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:32] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:33] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:02:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 151 constraints, problems are : Problem set: 0 solved, 271 unsolved in 21869 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 271/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/346 variables, and 422 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51964ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 51965ms
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 272/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52380 ms. Remains : 100/102 places, 272/277 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 457 steps (31 resets) in 6 ms. (65 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 272/272 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2025-06-02 05:03:22] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 05:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:03:22] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-02 05:03:22] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 05:03:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:03:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:03:22] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-02 05:03:22] [INFO ] Flow matrix only has 246 transitions (discarded 26 similar events)
[2025-06-02 05:03:22] [INFO ] Invariant cache hit.
[2025-06-02 05:03:22] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:03:25] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:03:25] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:03:25] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:03:26] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:03:26] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:03:26] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:03:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/346 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/346 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 151 constraints, problems are : Problem set: 0 solved, 271 unsolved in 26571 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 245/345 variables, 100/114 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 36/150 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 271/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 1/346 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/346 variables, and 422 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56645ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 56646ms
Finished structural reductions in LTL mode , in 1 iterations and 57060 ms. Remains : 100/100 places, 272/272 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 449 steps (26 resets) in 5 ms. (74 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 184 ms.
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 272/272 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 100 transition count 272
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 99 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 99 transition count 271
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 99 transition count 284
Deduced a syphon composed of 4 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 278
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 13 rules in 28 ms. Remains 99 /100 variables (removed 1) and now considering 278/272 (removed -6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:04:21] [INFO ] Redundant transitions in 3 ms returned []
Running 277 sub problems to find dead transitions.
[2025-06-02 05:04:21] [INFO ] Flow matrix only has 245 transitions (discarded 33 similar events)
// Phase 1: matrix 245 rows 99 cols
[2025-06-02 05:04:21] [INFO ] Computed 7 invariants in 2 ms
[2025-06-02 05:04:21] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:25] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:25] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:25] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:25] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:25] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:25] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:04:26] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/16 constraints. Problems are: Problem set: 6 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 271 unsolved
Problem TDEAD250 is UNSAT
At refinement iteration 4 (OVERLAPS) 244/343 variables, 99/115 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 39/154 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/344 variables, 1/155 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/155 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/155 constraints. Problems are: Problem set: 7 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 155 constraints, problems are : Problem set: 7 solved, 270 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 4/98 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 9/16 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 244/342 variables, 98/114 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 39/153 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 270/423 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/423 constraints. Problems are: Problem set: 7 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/424 constraints. Problems are: Problem set: 7 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 424 constraints, problems are : Problem set: 7 solved, 270 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 270/277 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 7 solved, 270 unsolved
Search for dead transitions found 7 dead transitions in 60146ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 99/100 places, 271/272 transitions.
Graph (complete) has 525 edges and 99 vertex of which 95 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 95 /99 variables (removed 4) and now considering 271/271 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/100 places, 271/272 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60198 ms. Remains : 95/100 places, 271/272 transitions.
Built C files in :
/tmp/ltsmin14389003979901192893
[2025-06-02 05:05:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14389003979901192893
Running compilation step : cd /tmp/ltsmin14389003979901192893;'/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 770 ms.
Running link step : cd /tmp/ltsmin14389003979901192893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14389003979901192893;'/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/stateBased10017286557662971954.hoa' '--buchi-type=spotba'
LTSmin run took 212 ms.
FORMULA FireWire-PT-01-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-01-LTLFireability-09 finished in 173767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 100 transition count 274
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 4 place count 99 transition count 274
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 97 transition count 269
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 96 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 93 transition count 268
Applied a total of 22 rules in 21 ms. Remains 93 /102 variables (removed 9) and now considering 268/277 (removed 9) transitions.
[2025-06-02 05:05:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2025-06-02 05:05:22] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:05:22] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-02 05:05:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:05:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:05:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:05:22] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:05:22] [INFO ] Redundant transitions in 1 ms returned []
Running 265 sub problems to find dead transitions.
[2025-06-02 05:05:22] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:05:22] [INFO ] Invariant cache hit.
[2025-06-02 05:05:22] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:05:24] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:05:24] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:05:24] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:05:24] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:05:25] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:05:25] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:05:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/143 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/327 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:05:38] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 145 constraints, problems are : Problem set: 0 solved, 265 unsolved in 27807 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57882ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 57883ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/102 places, 268/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58210 ms. Remains : 93/102 places, 268/277 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-10 finished in 58307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Reduce places removed 1 places and 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 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 275
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 100 transition count 274
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 4 place count 99 transition count 274
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 97 transition count 269
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 96 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 93 transition count 268
Applied a total of 22 rules in 20 ms. Remains 93 /102 variables (removed 9) and now considering 268/277 (removed 9) transitions.
[2025-06-02 05:06:20] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:06:20] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 05:06:20] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:06:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:06:21] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:06:21] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2025-06-02 05:06:21] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:06:21] [INFO ] Invariant cache hit.
[2025-06-02 05:06:21] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:06:22] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:06:22] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:06:22] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:06:22] [INFO ] Deduced a trap composed of 15 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 05:06:22] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:06:22] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:06:23] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/143 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/327 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:06:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 145 constraints, problems are : Problem set: 0 solved, 265 unsolved in 19231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/328 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49304ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 49305ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/102 places, 268/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49660 ms. Remains : 93/102 places, 268/277 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-11
Product exploration explored 100000 steps with 1 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 :[(NOT p0)]
RANDOM walk for 2228 steps (145 resets) in 7 ms. (278 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 268/268 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2025-06-02 05:07:11] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:07:11] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-02 05:07:11] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:07:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:07:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:07:11] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:07:11] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2025-06-02 05:07:11] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2025-06-02 05:07:11] [INFO ] Invariant cache hit.
[2025-06-02 05:07:11] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:07:13] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:07:13] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:07:13] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:07:13] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:07:14] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:07:14] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:07:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/106 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/143 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 1/327 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:07:26] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 145 constraints, problems are : Problem set: 0 solved, 265 unsolved in 27323 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/328 variables, and 410 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57445ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 57447ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57931 ms. Remains : 93/93 places, 268/268 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 :[(NOT p0)]
RANDOM walk for 2037 steps (139 resets) in 6 ms. (291 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 66 ms.
Built C files in :
/tmp/ltsmin3033834261091140475
[2025-06-02 05:08:09] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2025-06-02 05:08:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:08:09] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2025-06-02 05:08:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:08:09] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2025-06-02 05:08:09] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 05:08:09] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3033834261091140475
Running compilation step : cd /tmp/ltsmin3033834261091140475;'/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 986 ms.
Running link step : cd /tmp/ltsmin3033834261091140475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3033834261091140475;'/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/stateBased16925791007896852336.hoa' '--buchi-type=spotba'
LTSmin run took 700 ms.
FORMULA FireWire-PT-01-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-01-LTLFireability-11 finished in 110339 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 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 99 transition count 270
Applied a total of 6 rules in 3 ms. Remains 99 /102 variables (removed 3) and now considering 270/277 (removed 7) transitions.
[2025-06-02 05:08:11] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2025-06-02 05:08:11] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:08:11] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 05:08:11] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 05:08:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:08:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:08:11] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 05:08:11] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 05:08:11] [INFO ] Invariant cache hit.
[2025-06-02 05:08:11] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:08:13] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:08:13] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:08:14] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:08:14] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:08:14] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:08:14] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:08:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 19158 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49232ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 49233ms
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 270/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49544 ms. Remains : 99/102 places, 270/277 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-13 finished in 49645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 277/277 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 99 transition count 270
Applied a total of 6 rules in 4 ms. Remains 99 /102 variables (removed 3) and now considering 270/277 (removed 7) transitions.
[2025-06-02 05:09:00] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 05:09:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:09:00] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 05:09:00] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 05:09:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:09:01] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-02 05:09:01] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-02 05:09:01] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2025-06-02 05:09:01] [INFO ] Invariant cache hit.
[2025-06-02 05:09:01] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:09:05] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:09:05] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:09:05] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:09:05] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:09:06] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:09:06] [INFO ] Deduced a trap composed of 36 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 05:09:06] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 150 constraints, problems are : Problem set: 0 solved, 269 unsolved in 26556 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/149 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 419 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56670ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 56673ms
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 270/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57128 ms. Remains : 99/102 places, 270/277 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-15 finished in 57340 ms.
All properties solved by simple procedures.
Total runtime 1137676 ms.
BK_STOP 1748840998263
--------------------
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-01"
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-01, 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-174860102100244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-01.tgz
mv FireWire-PT-01 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;