Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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-16-LTLFireability-00
FORMULA_NAME FireWire-PT-16-LTLFireability-01
FORMULA_NAME FireWire-PT-16-LTLFireability-02
FORMULA_NAME FireWire-PT-16-LTLFireability-03
FORMULA_NAME FireWire-PT-16-LTLFireability-04
FORMULA_NAME FireWire-PT-16-LTLFireability-05
FORMULA_NAME FireWire-PT-16-LTLFireability-06
FORMULA_NAME FireWire-PT-16-LTLFireability-07
FORMULA_NAME FireWire-PT-16-LTLFireability-08
FORMULA_NAME FireWire-PT-16-LTLFireability-09
FORMULA_NAME FireWire-PT-16-LTLFireability-10
FORMULA_NAME FireWire-PT-16-LTLFireability-11
FORMULA_NAME FireWire-PT-16-LTLFireability-12
FORMULA_NAME FireWire-PT-16-LTLFireability-13
FORMULA_NAME FireWire-PT-16-LTLFireability-14
FORMULA_NAME FireWire-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748887789087

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 18:09:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 18:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:09:52] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2025-06-02 18:09:52] [INFO ] Transformed 254 places.
[2025-06-02 18:09:52] [INFO ] Transformed 368 transitions.
[2025-06-02 18:09:52] [INFO ] Found NUPN structural information;
[2025-06-02 18:09:52] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-16-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 49 place count 205 transition count 322
Iterating global reduction 1 with 46 rules applied. Total rules applied 95 place count 205 transition count 322
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 108 place count 192 transition count 307
Iterating global reduction 1 with 13 rules applied. Total rules applied 121 place count 192 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 192 transition count 306
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 190 transition count 304
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 190 transition count 304
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 189 transition count 303
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 189 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 188 transition count 302
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 188 transition count 302
Applied a total of 130 rules in 163 ms. Remains 188 /254 variables (removed 66) and now considering 302/368 (removed 66) transitions.
// Phase 1: matrix 302 rows 188 cols
[2025-06-02 18:09:52] [INFO ] Computed 4 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:09:53] [INFO ] Implicit Places using invariants in 537 ms returned []
[2025-06-02 18:09:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:09:53] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2025-06-02 18:09:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:00] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:01] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:01] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:01] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:01] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:01] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:02] [INFO ] Deduced a trap composed of 93 places in 228 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:02] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:03] [INFO ] Deduced a trap composed of 94 places in 220 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:03] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:03] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:04] [INFO ] Deduced a trap composed of 59 places in 254 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:04] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:04] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:05] [INFO ] Deduced a trap composed of 85 places in 237 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:05] [INFO ] Deduced a trap composed of 62 places in 242 ms of which 54 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD277 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:06] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 11 ms to minimize.
Problem TDEAD283 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 17/21 constraints. Problems are: Problem set: 11 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:07] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/22 constraints. Problems are: Problem set: 11 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 302/490 variables, 188/210 constraints. Problems are: Problem set: 11 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:18] [INFO ] Deduced a trap composed of 60 places in 205 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:18] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 29 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 2/212 constraints. Problems are: Problem set: 11 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 212 constraints, problems are : Problem set: 11 solved, 290 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 290 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 20/24 constraints. Problems are: Problem set: 11 solved, 290 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:28] [INFO ] Deduced a trap composed of 99 places in 271 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:28] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 2/26 constraints. Problems are: Problem set: 11 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/26 constraints. Problems are: Problem set: 11 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 302/490 variables, 188/214 constraints. Problems are: Problem set: 11 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 290/504 constraints. Problems are: Problem set: 11 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 504 constraints, problems are : Problem set: 11 solved, 290 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 290/301 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 11 solved, 290 unsolved
Search for dead transitions found 11 dead transitions in 60368ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/254 places, 291/368 transitions.
Applied a total of 0 rules in 6 ms. Remains 188 /188 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61716 ms. Remains : 188/254 places, 291/368 transitions.
Support contains 54 out of 188 places after structural reductions.
[2025-06-02 18:10:54] [INFO ] Flatten gal took : 110 ms
[2025-06-02 18:10:54] [INFO ] Flatten gal took : 51 ms
[2025-06-02 18:10:54] [INFO ] Input system was already deterministic with 291 transitions.
Support contains 52 out of 188 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3158 ms. (12 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 127 ms. (31 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 100 ms. (39 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4001 steps (11 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (9 resets) in 86 ms. (45 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (9 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 64 ms. (61 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (10 resets) in 37 ms. (105 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (9 resets) in 47 ms. (83 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (9 resets) in 43 ms. (90 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (10 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (10 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (9 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (11 resets) in 26 ms. (148 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4000 steps (9 resets) in 66 ms. (59 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 65 ms. (60 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (10 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (11 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (10 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (9 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (11 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (9 resets) in 22 ms. (173 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
// Phase 1: matrix 291 rows 188 cols
[2025-06-02 18:10:56] [INFO ] Computed 4 invariants in 9 ms
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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 130/172 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 275/447 variables, 172/176 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 12/459 variables, 6/182 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 12/471 variables, 5/187 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 7/478 variables, 4/191 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/478 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 1/479 variables, 1/192 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/479 variables, 0/192 constraints. Problems are: Problem set: 2 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 192 constraints, problems are : Problem set: 2 solved, 25 unsolved in 2901 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 25 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 25 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 134/172 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:10:59] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 36 ms to minimize.
Problem AtomicPropp6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:00] [INFO ] Deduced a trap composed of 75 places in 264 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:00] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:00] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:00] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 31 ms to minimize.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 5/9 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 275/447 variables, 172/181 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/201 constraints. Problems are: Problem set: 7 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:01] [INFO ] Deduced a trap composed of 57 places in 204 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:02] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 2/203 constraints. Problems are: Problem set: 7 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:02] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:03] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 2/205 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/205 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 12/459 variables, 6/211 constraints. Problems are: Problem set: 7 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/479 variables, and 211 constraints, problems are : Problem set: 7 solved, 20 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 178/188 constraints, PredecessorRefiner: 20/27 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7951ms problems are : Problem set: 7 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 291/291 transitions.
Graph (trivial) has 112 edges and 188 vertex of which 15 / 188 are part of one of the 3 SCC in 5 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 176 transition count 251
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 53 place count 152 transition count 247
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 58 place count 150 transition count 244
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 61 place count 147 transition count 244
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 61 place count 147 transition count 231
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 87 place count 134 transition count 231
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 90 place count 131 transition count 226
Iterating global reduction 4 with 3 rules applied. Total rules applied 93 place count 131 transition count 226
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 125 place count 115 transition count 210
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 147 place count 104 transition count 250
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 149 place count 104 transition count 248
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 158 place count 104 transition count 239
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 169 place count 95 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 95 transition count 235
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 175 place count 95 transition count 235
Applied a total of 175 rules in 159 ms. Remains 95 /188 variables (removed 93) and now considering 235/291 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 95/188 places, 235/291 transitions.
RANDOM walk for 40000 steps (3004 resets) in 688 ms. (58 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (130 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (86 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (116 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (123 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (126 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (118 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (121 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (119 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (110 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (118 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (119 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (118 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (120 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (125 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (123 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (120 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (121 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (121 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (117 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 94186 steps, run visited all 20 properties in 488 ms. (steps per millisecond=193 )
Probabilistic random walk after 94186 steps, saw 25412 distinct states, run finished after 495 ms. (steps per millisecond=190 ) properties seen :20
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA FireWire-PT-16-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 21 stabilizing places and 23 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(!p1))) U X(X((p2||F(p3))))))'
Support contains 7 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 177 transition count 278
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 177 transition count 278
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 173 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 173 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 173 transition count 273
Applied a total of 31 rules in 18 ms. Remains 173 /188 variables (removed 15) and now considering 273/291 (removed 18) transitions.
// Phase 1: matrix 273 rows 173 cols
[2025-06-02 18:11:06] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:11:06] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-02 18:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:11:06] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2025-06-02 18:11:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:11] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:12] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:12] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:12] [INFO ] Deduced a trap composed of 77 places in 167 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:12] [INFO ] Deduced a trap composed of 56 places in 215 ms of which 33 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/9 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 273/446 variables, 173/182 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:21] [INFO ] Deduced a trap composed of 60 places in 234 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:21] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 2/184 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 0/184 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/446 variables, and 184 constraints, problems are : Problem set: 15 solved, 257 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:40] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/12 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:42] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 273/446 variables, 173/186 constraints. Problems are: Problem set: 15 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 257/443 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:51] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:11:52] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 36 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 2/445 constraints. Problems are: Problem set: 15 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 445 constraints, problems are : Problem set: 15 solved, 257 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 257/272 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 15 solved, 257 unsolved
Search for dead transitions found 15 dead transitions in 60138ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/188 places, 258/291 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60773 ms. Remains : 173/188 places, 258/291 transitions.
Stuttering acceptance computed with spot in 752 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-00
Product exploration explored 100000 steps with 33347 reset in 583 ms.
Stack based approach found an accepted trace after 162 steps with 57 reset with depth 7 and stack size 7 in 10 ms.
FORMULA FireWire-PT-16-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-16-LTLFireability-00 finished in 62252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(p1)))))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 177 transition count 269
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 177 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 174 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 174 transition count 265
Applied a total of 29 rules in 11 ms. Remains 174 /188 variables (removed 14) and now considering 265/291 (removed 26) transitions.
// Phase 1: matrix 265 rows 174 cols
[2025-06-02 18:12:08] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:12:08] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-06-02 18:12:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:12:08] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-02 18:12:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:14] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:15] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:15] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:15] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 38 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:16] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 29 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:16] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 37 ms to minimize.
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/184 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:23] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:24] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 29 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 2/186 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:37] [INFO ] Deduced a trap composed of 92 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:38] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:38] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 189 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:41] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/16 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:12:44] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 265/439 variables, 174/191 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 249/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:06] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:06] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 442 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60105ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 60107ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/188 places, 250/291 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60734 ms. Remains : 174/188 places, 250/291 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : FireWire-PT-16-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-01 finished in 61056 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||G((p1 U p2))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 178 transition count 270
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 178 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 174 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 174 transition count 265
Applied a total of 29 rules in 9 ms. Remains 174 /188 variables (removed 14) and now considering 265/291 (removed 26) transitions.
// Phase 1: matrix 265 rows 174 cols
[2025-06-02 18:13:09] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:13:09] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-06-02 18:13:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:13:10] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-02 18:13:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:15] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:16] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:16] [INFO ] Deduced a trap composed of 59 places in 195 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:16] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:16] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:17] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 37 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/184 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:25] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 1/185 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/185 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 185 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:43] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/12 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 265/439 variables, 174/186 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 249/435 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:51] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:13:51] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 2/437 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/437 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 437 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 60090ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/188 places, 250/291 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60705 ms. Remains : 174/188 places, 250/291 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 157 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA FireWire-PT-16-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-16-LTLFireability-02 finished in 61059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Graph (trivial) has 152 edges and 188 vertex of which 18 / 188 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 172 transition count 242
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 140 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 138 transition count 238
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 71 place count 138 transition count 224
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 99 place count 124 transition count 224
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 107 place count 116 transition count 205
Iterating global reduction 3 with 8 rules applied. Total rules applied 115 place count 116 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 115 place count 116 transition count 202
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 113 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 112 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 112 transition count 201
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 155 place count 96 transition count 185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 95 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 95 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 95 transition count 174
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 192 place count 78 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 213 place count 78 transition count 211
Applied a total of 213 rules in 53 ms. Remains 78 /188 variables (removed 110) and now considering 211/291 (removed 80) transitions.
[2025-06-02 18:14:10] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
// Phase 1: matrix 202 rows 78 cols
[2025-06-02 18:14:10] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:14:10] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 18:14:10] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
[2025-06-02 18:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:14:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-06-02 18:14:10] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:14:10] [INFO ] Redundant transitions in 15 ms returned []
Running 207 sub problems to find dead transitions.
[2025-06-02 18:14:10] [INFO ] Flow matrix only has 202 transitions (discarded 9 similar events)
[2025-06-02 18:14:10] [INFO ] Invariant cache hit.
[2025-06-02 18:14:10] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:13] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:13] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 9 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:13] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:13] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 8 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:13] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 4 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 5/9 constraints. Problems are: Problem set: 32 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:15] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:15] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/11 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 201/279 variables, 78/89 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 30/119 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/280 variables, and 119 constraints, problems are : Problem set: 32 solved, 175 unsolved in 12364 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 4/5 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 3/8 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/11 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 201/279 variables, 78/89 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 30/119 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 175/294 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/294 constraints. Problems are: Problem set: 32 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/294 constraints. Problems are: Problem set: 32 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/280 variables, and 294 constraints, problems are : Problem set: 32 solved, 175 unsolved in 20443 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 175/207 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32912ms problems are : Problem set: 32 solved, 175 unsolved
Search for dead transitions found 32 dead transitions in 32916ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/188 places, 179/291 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:14:43] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 33404 ms. Remains : 78/188 places, 179/291 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-03 finished in 33547 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(((p0 U p1) U X(p2)))||F(p3))))'
Support contains 5 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 177 transition count 269
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 177 transition count 269
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 173 transition count 265
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 173 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 173 transition count 264
Applied a total of 31 rules in 8 ms. Remains 173 /188 variables (removed 15) and now considering 264/291 (removed 27) transitions.
// Phase 1: matrix 264 rows 173 cols
[2025-06-02 18:14:44] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:14:44] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 18:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:14:44] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2025-06-02 18:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:49] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:49] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:50] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:50] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:50] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 12 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:51] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 32 ms to minimize.
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:53] [INFO ] Deduced a trap composed of 56 places in 190 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:53] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/12 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:14:56] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 264/437 variables, 173/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:05] [INFO ] Deduced a trap composed of 59 places in 196 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:06] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 188 constraints, problems are : Problem set: 15 solved, 248 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:17] [INFO ] Deduced a trap composed of 83 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:17] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/17 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:20] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:20] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:20] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 3/20 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 264/437 variables, 173/193 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 248/441 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:27] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 1/442 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:40] [INFO ] Deduced a trap along path composed of 11 places in 98 ms of which 13 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 443 constraints, problems are : Problem set: 15 solved, 248 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 248/263 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60103ms problems are : Problem set: 15 solved, 248 unsolved
Search for dead transitions found 15 dead transitions in 60105ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/188 places, 249/291 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60533 ms. Remains : 173/188 places, 249/291 transitions.
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-16-LTLFireability-04 finished in 61192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1) U (p2||X(G(!p2))))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 177 transition count 269
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 177 transition count 269
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 173 transition count 265
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 173 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 173 transition count 264
Applied a total of 31 rules in 10 ms. Remains 173 /188 variables (removed 15) and now considering 264/291 (removed 27) transitions.
// Phase 1: matrix 264 rows 173 cols
[2025-06-02 18:15:45] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:15:45] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-02 18:15:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:15:45] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2025-06-02 18:15:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:50] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:51] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:51] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:51] [INFO ] Deduced a trap composed of 49 places in 139 ms of which 12 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:53] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 27 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:15:53] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 29 ms to minimize.
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 264/437 variables, 173/183 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:00] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:00] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 32 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 2/185 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:04] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 1/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 186 constraints, problems are : Problem set: 15 solved, 248 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:19] [INFO ] Deduced a trap composed of 56 places in 180 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:19] [INFO ] Deduced a trap composed of 82 places in 199 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/15 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 264/437 variables, 173/188 constraints. Problems are: Problem set: 15 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 248/436 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:26] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:27] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 2/438 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:34] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 1/439 constraints. Problems are: Problem set: 15 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 439 constraints, problems are : Problem set: 15 solved, 248 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 248/263 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 15 solved, 248 unsolved
Search for dead transitions found 15 dead transitions in 60072ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 173/188 places, 249/291 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60777 ms. Remains : 173/188 places, 249/291 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), p2, (AND p2 (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-05 finished in 61114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Graph (trivial) has 153 edges and 188 vertex of which 18 / 188 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 172 transition count 242
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 140 transition count 238
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 138 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 137 transition count 237
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 73 place count 137 transition count 223
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 101 place count 123 transition count 223
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 109 place count 115 transition count 204
Iterating global reduction 4 with 8 rules applied. Total rules applied 117 place count 115 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 117 place count 115 transition count 201
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 123 place count 112 transition count 201
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 111 transition count 200
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 111 transition count 200
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 159 place count 94 transition count 183
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 93 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 93 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 93 transition count 172
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 196 place count 76 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 217 place count 76 transition count 210
Applied a total of 217 rules in 64 ms. Remains 76 /188 variables (removed 112) and now considering 210/291 (removed 81) transitions.
[2025-06-02 18:16:46] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
// Phase 1: matrix 201 rows 76 cols
[2025-06-02 18:16:46] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:16:46] [INFO ] Implicit Places using invariants in 169 ms returned []
[2025-06-02 18:16:46] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2025-06-02 18:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:16:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-02 18:16:46] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:16:46] [INFO ] Redundant transitions in 4 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-02 18:16:46] [INFO ] Flow matrix only has 201 transitions (discarded 9 similar events)
[2025-06-02 18:16:46] [INFO ] Invariant cache hit.
[2025-06-02 18:16:46] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:49] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:49] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 12 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:49] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:49] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 12 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:50] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 8 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 5/9 constraints. Problems are: Problem set: 32 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:51] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:16:51] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/11 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 200/276 variables, 76/87 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 32/119 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/276 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 119 constraints, problems are : Problem set: 32 solved, 174 unsolved in 12710 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/4 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 1/76 variables, 3/7 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 4/11 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 200/276 variables, 76/87 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 32/119 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 174/293 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/293 constraints. Problems are: Problem set: 32 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/293 constraints. Problems are: Problem set: 32 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 293 constraints, problems are : Problem set: 32 solved, 174 unsolved in 21795 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 76/76 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 174/206 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34588ms problems are : Problem set: 32 solved, 174 unsolved
Search for dead transitions found 32 dead transitions in 34590ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 76/188 places, 178/291 transitions.
Applied a total of 0 rules in 7 ms. Remains 76 /76 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:17:21] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 35165 ms. Remains : 76/188 places, 178/291 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-07 finished in 35236 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&&G(F(p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Graph (trivial) has 150 edges and 188 vertex of which 18 / 188 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 172 transition count 243
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 141 transition count 239
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 139 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 138 transition count 238
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 71 place count 138 transition count 224
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 99 place count 124 transition count 224
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 107 place count 116 transition count 205
Iterating global reduction 4 with 8 rules applied. Total rules applied 115 place count 116 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 115 place count 116 transition count 202
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 121 place count 113 transition count 202
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 112 transition count 201
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 112 transition count 201
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 157 place count 95 transition count 184
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 94 transition count 174
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 94 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 94 transition count 173
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 192 place count 78 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 210 place count 78 transition count 209
Applied a total of 210 rules in 60 ms. Remains 78 /188 variables (removed 110) and now considering 209/291 (removed 82) transitions.
[2025-06-02 18:17:21] [INFO ] Flow matrix only has 203 transitions (discarded 6 similar events)
// Phase 1: matrix 203 rows 78 cols
[2025-06-02 18:17:21] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:17:21] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-02 18:17:21] [INFO ] Flow matrix only has 203 transitions (discarded 6 similar events)
[2025-06-02 18:17:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:17:21] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-02 18:17:22] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:17:22] [INFO ] Redundant transitions in 2 ms returned []
Running 205 sub problems to find dead transitions.
[2025-06-02 18:17:22] [INFO ] Flow matrix only has 203 transitions (discarded 6 similar events)
[2025-06-02 18:17:22] [INFO ] Invariant cache hit.
[2025-06-02 18:17:22] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:24] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:24] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 18 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:25] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:25] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:25] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 16 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 5/9 constraints. Problems are: Problem set: 32 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:17:26] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/10 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 202/280 variables, 78/88 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 31/119 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/119 constraints. Problems are: Problem set: 32 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/281 variables, and 119 constraints, problems are : Problem set: 32 solved, 173 unsolved in 15861 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 3/4 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 3/7 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/10 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 202/280 variables, 78/88 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 31/119 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 173/292 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/292 constraints. Problems are: Problem set: 32 solved, 173 unsolved
At refinement iteration 10 (OVERLAPS) 0/280 variables, 0/292 constraints. Problems are: Problem set: 32 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/281 variables, and 292 constraints, problems are : Problem set: 32 solved, 173 unsolved in 18964 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 173/205 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34893ms problems are : Problem set: 32 solved, 173 unsolved
Search for dead transitions found 32 dead transitions in 34894ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/188 places, 177/291 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:17:56] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 35422 ms. Remains : 78/188 places, 177/291 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-08 finished in 35657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Graph (trivial) has 149 edges and 188 vertex of which 15 / 188 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 175 transition count 245
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 142 transition count 241
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 140 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 139 transition count 240
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 75 place count 139 transition count 226
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 103 place count 125 transition count 226
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 110 place count 118 transition count 208
Iterating global reduction 4 with 7 rules applied. Total rules applied 117 place count 118 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 117 place count 118 transition count 206
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 121 place count 116 transition count 206
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 115 transition count 205
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 115 transition count 205
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 159 place count 97 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 96 transition count 177
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 96 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 96 transition count 176
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 196 place count 79 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 199 place count 79 transition count 232
Applied a total of 199 rules in 59 ms. Remains 79 /188 variables (removed 109) and now considering 232/291 (removed 59) transitions.
[2025-06-02 18:17:57] [INFO ] Flow matrix only has 224 transitions (discarded 8 similar events)
// Phase 1: matrix 224 rows 79 cols
[2025-06-02 18:17:57] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:17:57] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 18:17:57] [INFO ] Flow matrix only has 224 transitions (discarded 8 similar events)
[2025-06-02 18:17:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:17:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 18:17:57] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:17:57] [INFO ] Redundant transitions in 2 ms returned []
Running 228 sub problems to find dead transitions.
[2025-06-02 18:17:57] [INFO ] Flow matrix only has 224 transitions (discarded 8 similar events)
[2025-06-02 18:17:57] [INFO ] Invariant cache hit.
[2025-06-02 18:17:57] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:00] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:00] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:01] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:01] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 19 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:01] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 12 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/9 constraints. Problems are: Problem set: 32 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:03] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/10 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 223/302 variables, 79/89 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 16/105 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/105 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 9 (OVERLAPS) 0/302 variables, 0/105 constraints. Problems are: Problem set: 32 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/303 variables, and 105 constraints, problems are : Problem set: 32 solved, 196 unsolved in 15248 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 5/6 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/9 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/10 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 223/302 variables, 79/89 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 16/105 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 196/301 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/301 constraints. Problems are: Problem set: 32 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 0/301 constraints. Problems are: Problem set: 32 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/303 variables, and 301 constraints, problems are : Problem set: 32 solved, 196 unsolved in 27272 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 196/228 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42605ms problems are : Problem set: 32 solved, 196 unsolved
Search for dead transitions found 32 dead transitions in 42607ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/188 places, 200/291 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:18:40] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 43159 ms. Remains : 79/188 places, 200/291 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 67 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 135 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4856 resets) in 576 ms. (69 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (1663 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
[2025-06-02 18:18:40] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
// Phase 1: matrix 192 rows 79 cols
[2025-06-02 18:18:40] [INFO ] Computed 4 invariants in 1 ms
[2025-06-02 18:18:41] [INFO ] State equation strengthened by 9 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 157/177 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/244 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/248 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/258 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/270 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/270 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/270 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/271 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 20/271 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/79 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 558 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 200/200 transitions.
Applied a total of 0 rules in 10 ms. Remains 79 /79 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2025-06-02 18:18:41] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2025-06-02 18:18:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:42] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-02 18:18:42] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2025-06-02 18:18:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-02 18:18:42] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:18:42] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-02 18:18:42] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2025-06-02 18:18:42] [INFO ] Invariant cache hit.
[2025-06-02 18:18:42] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:45] [INFO ] Deduced a trap composed of 29 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 18:18:45] [INFO ] Deduced a trap composed of 19 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 18:18:45] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:45] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:45] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 8 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/9 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 191/270 variables, 79/88 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 9/97 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/271 variables, and 97 constraints, problems are : Problem set: 2 solved, 194 unsolved in 9450 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 3/4 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 191/270 variables, 79/88 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 9/97 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 194/291 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/291 constraints. Problems are: Problem set: 2 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/291 constraints. Problems are: Problem set: 2 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/271 variables, and 291 constraints, problems are : Problem set: 2 solved, 194 unsolved in 23816 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 194/196 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33329ms problems are : Problem set: 2 solved, 194 unsolved
Search for dead transitions found 2 dead transitions in 33330ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/79 places, 198/200 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:19:15] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 33826 ms. Remains : 79/79 places, 198/200 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 181 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4859 resets) in 66 ms. (597 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (1649 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2025-06-02 18:19:15] [INFO ] Flow matrix only has 190 transitions (discarded 8 similar events)
// Phase 1: matrix 190 rows 79 cols
[2025-06-02 18:19:16] [INFO ] Computed 4 invariants in 2 ms
[2025-06-02 18:19:16] [INFO ] State equation strengthened by 9 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 155/175 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/242 variables, 43/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/246 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/256 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/256 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/268 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/268 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/268 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/269 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 20/269 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/79 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 554 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 130 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Built C files in :
/tmp/ltsmin6394526320438567847
[2025-06-02 18:19:17] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2025-06-02 18:19:17] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:19:17] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2025-06-02 18:19:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:19:17] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2025-06-02 18:19:17] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:19:17] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6394526320438567847
Running compilation step : cd /tmp/ltsmin6394526320438567847;'/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 1218 ms.
Running link step : cd /tmp/ltsmin6394526320438567847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin6394526320438567847;'/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/stateBased350478570308512009.hoa' '--buchi-type=spotba'
LTSmin run took 685 ms.
FORMULA FireWire-PT-16-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLFireability-10 finished in 82249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((!p1 U p2)))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 178 transition count 279
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 178 transition count 279
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 175 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 175 transition count 276
Applied a total of 26 rules in 7 ms. Remains 175 /188 variables (removed 13) and now considering 276/291 (removed 15) transitions.
// Phase 1: matrix 276 rows 175 cols
[2025-06-02 18:19:19] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:19] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-02 18:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:20] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2025-06-02 18:19:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 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 18:19:25] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:25] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:26] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 12 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:27] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 24 ms to minimize.
Problem TDEAD258 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 4/8 constraints. Problems are: Problem set: 15 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:27] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:28] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/10 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 276/451 variables, 175/185 constraints. Problems are: Problem set: 15 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:36] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:37] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 2/187 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/187 constraints. Problems are: Problem set: 15 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 451/451 variables, and 187 constraints, problems are : Problem set: 15 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 276/451 variables, 175/187 constraints. Problems are: Problem set: 15 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 260/447 constraints. Problems are: Problem set: 15 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:58] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:59] [INFO ] Deduced a trap composed of 77 places in 214 ms of which 37 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 2/449 constraints. Problems are: Problem set: 15 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:07] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 1/450 constraints. Problems are: Problem set: 15 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 451/451 variables, and 450 constraints, problems are : Problem set: 15 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 260/275 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60073ms problems are : Problem set: 15 solved, 260 unsolved
Search for dead transitions found 15 dead transitions in 60076ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/188 places, 261/291 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60683 ms. Remains : 175/188 places, 261/291 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-12
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-12 finished in 60901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 177 transition count 269
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 177 transition count 269
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 174 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 174 transition count 265
Applied a total of 29 rules in 8 ms. Remains 174 /188 variables (removed 14) and now considering 265/291 (removed 26) transitions.
// Phase 1: matrix 265 rows 174 cols
[2025-06-02 18:20:20] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:20:20] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-02 18:20:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:20:20] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-02 18:20:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:26] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:26] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:27] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:27] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:27] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:27] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:27] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:28] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 35 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:30] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 265/439 variables, 174/187 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:38] [INFO ] Deduced a trap composed of 82 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 18:20:39] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 2/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 189 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 265/439 variables, 174/189 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 249/438 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:20:59] [INFO ] Deduced a trap composed of 77 places in 225 ms of which 38 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 1/439 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:11] [INFO ] Deduced a trap along path composed of 12 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 1/440 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 440 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60076ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 60078ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/188 places, 250/291 transitions.
Applied a total of 0 rules in 2 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60672 ms. Remains : 174/188 places, 250/291 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-13 finished in 60818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(p1))||p0))))'
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 291/291 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 176 transition count 268
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 176 transition count 268
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 172 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 172 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 172 transition count 263
Applied a total of 33 rules in 10 ms. Remains 172 /188 variables (removed 16) and now considering 263/291 (removed 28) transitions.
// Phase 1: matrix 263 rows 172 cols
[2025-06-02 18:21:21] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:21] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-02 18:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:21] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-02 18:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:27] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:27] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:27] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:27] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:28] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 12 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:29] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 27 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:29] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 33 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:30] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:30] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:31] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/186 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:38] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:39] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 188 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:21:54] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/189 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 247/436 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:06] [INFO ] Deduced a trap along path composed of 11 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 1/437 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:22:19] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 438 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60070ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 60071ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/188 places, 248/291 transitions.
Applied a total of 0 rules in 1 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60672 ms. Remains : 172/188 places, 248/291 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-16-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLFireability-15 finished in 60855 ms.
All properties solved by simple procedures.
Total runtime 750331 ms.

BK_STOP 1748888542079

--------------------
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-16"
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-16, 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-174860102400364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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