About the Execution of ITS-Tools for FireWire-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1104918.00 | 0.00 | 0.00 | TTFFFFFTTTTFTTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400354.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-15, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400354
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K 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 90K 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-15-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-15-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748884829709
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 17:20:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 17:20:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:20:32] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2025-06-02 17:20:32] [INFO ] Transformed 248 places.
[2025-06-02 17:20:32] [INFO ] Transformed 383 transitions.
[2025-06-02 17:20:32] [INFO ] Found NUPN structural information;
[2025-06-02 17:20:32] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 428 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 94 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 243 transition count 383
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 52 place count 196 transition count 336
Iterating global reduction 1 with 47 rules applied. Total rules applied 99 place count 196 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 196 transition count 335
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 192 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 192 transition count 330
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 190 transition count 328
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 190 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 190 transition count 327
Applied a total of 113 rules in 138 ms. Remains 190 /248 variables (removed 58) and now considering 327/383 (removed 56) transitions.
// Phase 1: matrix 327 rows 190 cols
[2025-06-02 17:20:33] [INFO ] Computed 4 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:33] [INFO ] Implicit Places using invariants in 530 ms returned []
[2025-06-02 17:20:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:20:34] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2025-06-02 17:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:42] [INFO ] Deduced a trap composed of 88 places in 352 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:42] [INFO ] Deduced a trap composed of 91 places in 198 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:43] [INFO ] Deduced a trap composed of 96 places in 199 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:43] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:44] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:44] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:45] [INFO ] Deduced a trap composed of 58 places in 289 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:45] [INFO ] Deduced a trap composed of 106 places in 223 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:45] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:45] [INFO ] Deduced a trap composed of 119 places in 220 ms of which 24 ms to minimize.
Problem TDEAD146 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:46] [INFO ] Deduced a trap composed of 46 places in 339 ms of which 41 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD303 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:47] [INFO ] Deduced a trap composed of 106 places in 181 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 12/16 constraints. Problems are: Problem set: 17 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:48] [INFO ] Deduced a trap composed of 108 places in 210 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:48] [INFO ] Deduced a trap composed of 109 places in 254 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:49] [INFO ] Deduced a trap composed of 108 places in 229 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:49] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:50] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:50] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:51] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:51] [INFO ] Deduced a trap composed of 90 places in 239 ms of which 24 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 8/24 constraints. Problems are: Problem set: 17 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:20:57] [INFO ] Deduced a trap composed of 73 places in 238 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/25 constraints. Problems are: Problem set: 17 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:00] [INFO ] Deduced a trap composed of 106 places in 239 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/26 constraints. Problems are: Problem set: 17 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 190/517 variables, and 26 constraints, problems are : Problem set: 17 solved, 309 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/190 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 4/4 constraints. Problems are: Problem set: 17 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 22/26 constraints. Problems are: Problem set: 17 solved, 309 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:08] [INFO ] Deduced a trap composed of 111 places in 266 ms of which 47 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/27 constraints. Problems are: Problem set: 17 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/27 constraints. Problems are: Problem set: 17 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 327/517 variables, 190/217 constraints. Problems are: Problem set: 17 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 309/526 constraints. Problems are: Problem set: 17 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 526 constraints, problems are : Problem set: 17 solved, 309 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 309/326 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60406ms problems are : Problem set: 17 solved, 309 unsolved
Search for dead transitions found 17 dead transitions in 60438ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 190/248 places, 310/383 transitions.
Applied a total of 0 rules in 6 ms. Remains 190 /190 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61803 ms. Remains : 190/248 places, 310/383 transitions.
Support contains 94 out of 190 places after structural reductions.
[2025-06-02 17:21:35] [INFO ] Flatten gal took : 74 ms
[2025-06-02 17:21:35] [INFO ] Flatten gal took : 36 ms
[2025-06-02 17:21:35] [INFO ] Input system was already deterministic with 310 transitions.
Support contains 91 out of 190 places (down from 94) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2868 ms. (13 steps per ms) remains 65/71 properties
BEST_FIRST walk for 4000 steps (10 resets) in 141 ms. (28 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4002 steps (9 resets) in 69 ms. (57 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (11 resets) in 76 ms. (51 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (14 resets) in 128 ms. (31 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (12 resets) in 37 ms. (105 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 61 ms. (64 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 61 ms. (64 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (13 resets) in 42 ms. (93 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 40 ms. (97 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 59 ms. (66 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (9 resets) in 71 ms. (55 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (9 resets) in 55 ms. (71 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 43 ms. (90 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (11 resets) in 44 ms. (88 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (13 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 54 ms. (72 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 43 ms. (90 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 66 ms. (59 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (12 resets) in 36 ms. (108 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 57 ms. (68 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (11 resets) in 38 ms. (102 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 47 ms. (83 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 44 ms. (88 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (11 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (9 resets) in 22 ms. (173 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 42 ms. (93 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (10 resets) in 32 ms. (121 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (12 resets) in 35 ms. (111 steps per ms) remains 61/63 properties
BEST_FIRST walk for 4001 steps (11 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (11 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (9 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (10 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (10 resets) in 54 ms. (72 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (13 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (11 resets) in 41 ms. (95 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (9 resets) in 35 ms. (111 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (12 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (10 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (12 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (13 resets) in 40 ms. (97 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (9 resets) in 30 ms. (129 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (10 resets) in 44 ms. (88 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (14 resets) in 74 ms. (53 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (11 resets) in 49 ms. (80 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (11 resets) in 43 ms. (90 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (12 resets) in 32 ms. (121 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (14 resets) in 31 ms. (125 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (10 resets) in 38 ms. (102 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (9 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (10 resets) in 42 ms. (93 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (14 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4000 steps (10 resets) in 49 ms. (80 steps per ms) remains 61/61 properties
// Phase 1: matrix 310 rows 190 cols
[2025-06-02 17:21:37] [INFO ] Computed 4 invariants in 7 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/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 101/182 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:38] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:38] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 25 ms to minimize.
Problem AtomicPropp3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:38] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 37 ms to minimize.
Problem AtomicPropp8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:38] [INFO ] Deduced a trap composed of 43 places in 200 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:38] [INFO ] Deduced a trap composed of 95 places in 207 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:39] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 21 ms to minimize.
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:39] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 18 ms to minimize.
Problem AtomicPropp68 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 7/11 constraints. Problems are: Problem set: 12 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/11 constraints. Problems are: Problem set: 12 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 304/486 variables, 182/193 constraints. Problems are: Problem set: 12 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/193 constraints. Problems are: Problem set: 12 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 10/496 variables, 5/198 constraints. Problems are: Problem set: 12 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/500 variables, and 198 constraints, problems are : Problem set: 12 solved, 49 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 187/190 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 49 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 49 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 117/182 variables, 4/4 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 7/11 constraints. Problems are: Problem set: 14 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:43] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:43] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 2/13 constraints. Problems are: Problem set: 14 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:43] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/14 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/14 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 304/486 variables, 182/196 constraints. Problems are: Problem set: 14 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 44/240 constraints. Problems are: Problem set: 14 solved, 47 unsolved
(s43 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/500 variables, and 240 constraints, problems are : Problem set: 14 solved, 47 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/190 constraints, PredecessorRefiner: 44/61 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10064ms problems are : Problem set: 14 solved, 47 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 310/310 transitions.
Graph (trivial) has 70 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 184 transition count 292
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 175 transition count 289
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 172 transition count 289
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 25 place count 172 transition count 283
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 37 place count 166 transition count 283
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 43 place count 160 transition count 277
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 160 transition count 277
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 158 transition count 273
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 158 transition count 273
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 73 place count 148 transition count 263
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 89 place count 140 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 140 transition count 305
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 140 transition count 301
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 98 place count 136 transition count 301
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 136 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 135 transition count 300
Applied a total of 103 rules in 177 ms. Remains 135 /190 variables (removed 55) and now considering 300/310 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 135/190 places, 300/310 transitions.
RANDOM walk for 40000 steps (2209 resets) in 1071 ms. (37 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (66 resets) in 27 ms. (142 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (77 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (69 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (61 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (68 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (66 resets) in 41 ms. (95 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (67 resets) in 35 ms. (111 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (68 resets) in 53 ms. (74 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (71 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (68 resets) in 48 ms. (81 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (71 resets) in 30 ms. (129 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (66 resets) in 39 ms. (100 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (70 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (55 resets) in 22 ms. (174 steps per ms) remains 44/47 properties
BEST_FIRST walk for 4004 steps (69 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (67 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (67 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (72 resets) in 31 ms. (125 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (72 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (69 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (71 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (64 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (67 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (50 resets) in 23 ms. (166 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4001 steps (71 resets) in 30 ms. (129 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (69 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (56 resets) in 33 ms. (117 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4002 steps (71 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (67 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (72 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (56 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (69 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (52 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (66 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (60 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (71 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (75 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (70 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (70 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (70 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (66 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (69 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (74 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
// Phase 1: matrix 300 rows 135 cols
[2025-06-02 17:21:48] [INFO ] Computed 4 invariants in 6 ms
[2025-06-02 17:21:48] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 74/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:49] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:49] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:49] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:49] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:49] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:49] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:50] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:50] [INFO ] Deduced a trap composed of 29 places in 197 ms of which 29 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 299/430 variables, 131/143 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 13/156 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 8 (OVERLAPS) 5/435 variables, 4/160 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/435 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 160 constraints, problems are : Problem set: 1 solved, 41 unsolved in 6421 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 135/135 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 41 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 74/129 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:21:55] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 28 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 294/423 variables, 129/142 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 13/155 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 40/195 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 11/434 variables, 5/200 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 1/201 constraints. Problems are: Problem set: 1 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:02] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 22 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 13 (OVERLAPS) 1/435 variables, 1/203 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 0/435 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 203 constraints, problems are : Problem set: 1 solved, 41 unsolved in 20643 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 135/135 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 41/42 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27111ms problems are : Problem set: 1 solved, 41 unsolved
Parikh walk visited 0 properties in 9716 ms.
Support contains 55 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 300/300 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 134 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 134 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 133 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 131 transition count 295
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 131 transition count 292
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 128 transition count 292
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 128 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 127 transition count 291
Applied a total of 18 rules in 61 ms. Remains 127 /135 variables (removed 8) and now considering 291/300 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 127/135 places, 291/300 transitions.
RANDOM walk for 40000 steps (2684 resets) in 324 ms. (123 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (88 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (94 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (90 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (71 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (95 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (94 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (96 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (98 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (102 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (95 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (91 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (94 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (62 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (94 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (93 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (93 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (92 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (93 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (97 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (93 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (80 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (97 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (94 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (65 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (91 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (95 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (95 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (63 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (91 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (69 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (91 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (80 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (94 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (99 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (95 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (90 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (96 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (99 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (93 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (96 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
Finished probabilistic random walk after 241030 steps, run visited all 40 properties in 1905 ms. (steps per millisecond=126 )
Probabilistic random walk after 241030 steps, saw 63176 distinct states, run finished after 1919 ms. (steps per millisecond=125 ) properties seen :40
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-15-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 17:22:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 17:22:27] [INFO ] Flatten gal took : 28 ms
FORMULA FireWire-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 17:22:27] [INFO ] Flatten gal took : 26 ms
[2025-06-02 17:22:27] [INFO ] Input system was already deterministic with 310 transitions.
Support contains 60 out of 190 places (down from 66) after GAL structural reductions.
Computed a total of 48 stabilizing places and 71 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 171 transition count 273
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 171 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 165 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 165 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 165 transition count 253
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 163 transition count 249
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 163 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 162 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 162 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 161 transition count 245
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 161 transition count 245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 160 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 160 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 159 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 159 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 158 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 158 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 157 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 157 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 156 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 156 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 155 transition count 233
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 155 transition count 233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 154 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 154 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 153 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 153 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 152 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 152 transition count 227
Applied a total of 77 rules in 42 ms. Remains 152 /190 variables (removed 38) and now considering 227/310 (removed 83) transitions.
// Phase 1: matrix 227 rows 152 cols
[2025-06-02 17:22:27] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:22:27] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 17:22:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:22:28] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2025-06-02 17:22:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:31] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:31] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:31] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:31] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:32] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:32] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:32] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 26 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:33] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:33] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:34] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:34] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 4/15 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:37] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:37] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:38] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 3/18 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:39] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 1/19 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 227/379 variables, 152/171 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:45] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 1/172 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/172 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/172 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 172 constraints, problems are : Problem set: 15 solved, 211 unsolved in 29692 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:22:59] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/21 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 227/379 variables, 152/173 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 211/384 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:23:11] [INFO ] Deduced a trap along path composed of 7 places in 60 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 1/385 constraints. Problems are: Problem set: 15 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 385 constraints, problems are : Problem set: 15 solved, 211 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 211/226 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59750ms problems are : Problem set: 15 solved, 211 unsolved
Search for dead transitions found 15 dead transitions in 59755ms
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 : 152/190 places, 212/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 150 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 150 transition count 210
Applied a total of 4 rules in 13 ms. Remains 150 /152 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 150 cols
[2025-06-02 17:23:27] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:28] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 17:23:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:28] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/190 places, 210/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60687 ms. Remains : 150/190 places, 210/310 transitions.
[2025-06-02 17:23:28] [INFO ] Flatten gal took : 24 ms
[2025-06-02 17:23:28] [INFO ] Flatten gal took : 29 ms
[2025-06-02 17:23:28] [INFO ] Input system was already deterministic with 210 transitions.
[2025-06-02 17:23:28] [INFO ] Flatten gal took : 20 ms
[2025-06-02 17:23:28] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:23:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4532840440155697558.gal : 10 ms
[2025-06-02 17:23:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12128828517292233613.ctl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4532840440155697558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12128828517292233613.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,484628,1.42443,37228,2,4814,5,104672,6,0,811,140351,0
Converting to forward existential form...Done !
original formula: (AG(AF(((EG((((p71==1)&&(p110==1))||((p37==1)&&(p187==1)))) * (p25==1)) * (p223==1)))) + AG(AX((p211==0))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !(!(E(TRUE U !(!(EG(!(((EG((((p71==1)&&(p110==1))||((p37==1)&&(p187==1)))) * (p25==1)) * (p223...200
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t37, t49, t53, t57, t60, t64, t72, t80, t84, t85, t100, t103, t105, t114, t116, t171...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,29.9308,702124,1,0,735,4.72405e+06,457,426,5785,3.53464e+06,828
FORMULA FireWire-PT-15-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 173 transition count 284
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 173 transition count 284
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 166 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 166 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 166 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 165 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 165 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 164 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 164 transition count 257
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 163 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 163 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 162 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 162 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 161 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 161 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 160 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 160 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 159 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 159 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 158 transition count 245
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 158 transition count 245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 157 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 157 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 156 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 156 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 155 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 155 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 154 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 154 transition count 238
Applied a total of 73 rules in 27 ms. Remains 154 /190 variables (removed 36) and now considering 238/310 (removed 72) transitions.
// Phase 1: matrix 238 rows 154 cols
[2025-06-02 17:23:58] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:58] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-02 17:23:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:23:59] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2025-06-02 17:23:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:03] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:03] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:03] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:03] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:03] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:03] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:04] [INFO ] Deduced a trap composed of 89 places in 167 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:04] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:05] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 22 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:06] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:06] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:07] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:07] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:07] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:07] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 6/19 constraints. Problems are: Problem set: 15 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:10] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:10] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:10] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:10] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/23 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 238/392 variables, 154/177 constraints. Problems are: Problem set: 15 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:18] [INFO ] Deduced a trap composed of 84 places in 222 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:19] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 2/179 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/179 constraints. Problems are: Problem set: 15 solved, 222 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/392 variables, and 179 constraints, problems are : Problem set: 15 solved, 222 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 21/25 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 238/392 variables, 154/179 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 222/401 constraints. Problems are: Problem set: 15 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:36] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/402 constraints. Problems are: Problem set: 15 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/402 constraints. Problems are: Problem set: 15 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:59] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 36 ms to minimize.
SMT process timed out in 60157ms, After SMT, problems are : Problem set: 15 solved, 222 unsolved
Search for dead transitions found 15 dead transitions in 60159ms
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 : 154/190 places, 223/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 152 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 152 transition count 221
Applied a total of 4 rules in 8 ms. Remains 152 /154 variables (removed 2) and now considering 221/223 (removed 2) transitions.
// Phase 1: matrix 221 rows 152 cols
[2025-06-02 17:24:59] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:24:59] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-06-02 17:24:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:24:59] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/190 places, 221/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61191 ms. Remains : 152/190 places, 221/310 transitions.
[2025-06-02 17:24:59] [INFO ] Flatten gal took : 20 ms
[2025-06-02 17:24:59] [INFO ] Flatten gal took : 20 ms
[2025-06-02 17:25:00] [INFO ] Input system was already deterministic with 221 transitions.
[2025-06-02 17:25:00] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:25:00] [INFO ] Flatten gal took : 50 ms
[2025-06-02 17:25:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16114233346768281822.gal : 6 ms
[2025-06-02 17:25:00] [INFO ] Time to serialize properties into /tmp/CTLFireability11259151319974959844.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16114233346768281822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11259151319974959844.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,509191,2.26688,48240,2,5605,5,131022,6,0,830,192363,0
Converting to forward existential form...Done !
original formula: EX(AG(EX((EF(((p106==1)&&(p196==1))) + AX(((p36==1)&&(p219==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX((E(TRUE U ((p106==1)&&(p196==1))) + !(EX(!(((p36==1)&&(p219==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t37, t42, t49, t53, t57, t60, t64, t72, t80, t84, t85, t100, t103, t105, t114, t116, t181...311
(forward)formula 0,0,23.9436,505456,1,0,495,3.40372e+06,464,263,5466,1.77386e+06,614
FORMULA FireWire-PT-15-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 172 transition count 274
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 172 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 166 transition count 255
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 166 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 166 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 165 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 165 transition count 252
Applied a total of 51 rules in 7 ms. Remains 165 /190 variables (removed 25) and now considering 252/310 (removed 58) transitions.
// Phase 1: matrix 252 rows 165 cols
[2025-06-02 17:25:24] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:25:24] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 17:25:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:25:24] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2025-06-02 17:25:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:29] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:29] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:30] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:30] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:30] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:30] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:30] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:31] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:31] [INFO ] Deduced a trap composed of 87 places in 194 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:31] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:32] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 30 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 11/15 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:33] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:34] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:34] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:34] [INFO ] Deduced a trap composed of 88 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 17:25:34] [INFO ] Deduced a trap composed of 79 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:34] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:35] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 7/22 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:38] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/23 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:41] [INFO ] Deduced a trap composed of 90 places in 168 ms of which 28 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 1/24 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:43] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 1/25 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:47] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 1/26 constraints. Problems are: Problem set: 26 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/26 constraints. Problems are: Problem set: 26 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 252/417 variables, 165/191 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 417/417 variables, and 191 constraints, problems are : Problem set: 26 solved, 225 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 22/26 constraints. Problems are: Problem set: 26 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/26 constraints. Problems are: Problem set: 26 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 252/417 variables, 165/191 constraints. Problems are: Problem set: 26 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 225/416 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:02] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 1/417 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:11] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 1/418 constraints. Problems are: Problem set: 26 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 418 constraints, problems are : Problem set: 26 solved, 225 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 225/251 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 26 solved, 225 unsolved
Search for dead transitions found 26 dead transitions in 60077ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 165/190 places, 226/310 transitions.
Applied a total of 0 rules in 2 ms. Remains 165 /165 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60594 ms. Remains : 165/190 places, 226/310 transitions.
[2025-06-02 17:26:24] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:26:24] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:26:24] [INFO ] Input system was already deterministic with 226 transitions.
[2025-06-02 17:26:24] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:26:24] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:26:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14953675823982814168.gal : 3 ms
[2025-06-02 17:26:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1674446929129338665.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14953675823982814168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1674446929129338665.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,491764,1.92733,43260,2,5536,5,124618,6,0,887,168131,0
Converting to forward existential form...Done !
original formula: EF((EX(EX(((p47==1)&&(p178==1)))) + (EG((((p37==1)&&(p187==1))||(((p134==1)&&(p185==1))&&(p204==0)))) * ((p186==1)||(((p52==1)&&(p150==1)...183
=> equivalent forward existential formula: ([(EY(EY(FwdU(Init,TRUE))) * ((p47==1)&&(p178==1)))] != FALSE + [FwdG((FwdU(Init,TRUE) * ((p186==1)||(((p52==1)&...264
(forward)formula 0,1,2.02807,43260,1,0,8,124618,8,1,1509,168131,3
FORMULA FireWire-PT-15-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 174 transition count 276
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 174 transition count 276
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 167 transition count 255
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 167 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 167 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 165 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 165 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 164 transition count 247
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 164 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 163 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 163 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 162 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 162 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 161 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 161 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 160 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 160 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 159 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 159 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 158 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 158 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 157 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 157 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 156 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 156 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 155 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 155 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 154 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 154 transition count 228
Applied a total of 73 rules in 37 ms. Remains 154 /190 variables (removed 36) and now considering 228/310 (removed 82) transitions.
// Phase 1: matrix 228 rows 154 cols
[2025-06-02 17:26:26] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 17:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:27] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2025-06-02 17:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:31] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:31] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:31] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:31] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:31] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:32] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:32] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:32] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:32] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:33] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 17 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:34] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:34] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:34] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:35] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:35] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:35] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/20 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:38] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:39] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/22 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 228/382 variables, 154/176 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/382 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 176 constraints, problems are : Problem set: 15 solved, 212 unsolved in 27627 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 18/22 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 228/382 variables, 154/176 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 212/388 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:00] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 1/389 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/389 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:23] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 390 constraints, problems are : Problem set: 15 solved, 212 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 212/227 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57680ms problems are : Problem set: 15 solved, 212 unsolved
Search for dead transitions found 15 dead transitions in 57682ms
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 : 154/190 places, 213/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 152 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 152 transition count 211
Applied a total of 4 rules in 9 ms. Remains 152 /154 variables (removed 2) and now considering 211/213 (removed 2) transitions.
// Phase 1: matrix 211 rows 152 cols
[2025-06-02 17:27:25] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:25] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 17:27:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:25] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/190 places, 211/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58529 ms. Remains : 152/190 places, 211/310 transitions.
[2025-06-02 17:27:25] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:27:25] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:27:25] [INFO ] Input system was already deterministic with 211 transitions.
[2025-06-02 17:27:25] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:27:25] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:27:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8835467893546111.gal : 3 ms
[2025-06-02 17:27:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14052407228109841384.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8835467893546111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14052407228109841384.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,538638,1.4282,38652,2,4956,5,114029,6,0,820,168312,0
Converting to forward existential form...Done !
original formula: (EX(EF(((p51==1)&&(p130==1)))) + AF((EG(AG((p53==0))) + !(A((((p117!=1)&&(p90==1))&&(p162==1)) U !(EG((p99==1))))))))
=> equivalent forward existential formula: [FwdG((Init * !(EX(E(TRUE U ((p51==1)&&(p130==1)))))),!((EG(!(E(TRUE U !((p53==0))))) + !(!((E(!(!(EG((p99==1)))...260
Reverse transition relation is NOT exact ! Due to transitions t3, t36, t48, t53, t56, t59, t64, t68, t72, t80, t84, t85, t100, t103, t105, t114, t116, t171...317
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.7579,744348,1,0,736,5.28777e+06,466,425,5647,3.47977e+06,872
FORMULA FireWire-PT-15-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 173 transition count 284
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 173 transition count 284
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 167 transition count 265
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 167 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 47 place count 167 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 166 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 166 transition count 262
Applied a total of 49 rules in 8 ms. Remains 166 /190 variables (removed 24) and now considering 262/310 (removed 48) transitions.
// Phase 1: matrix 262 rows 166 cols
[2025-06-02 17:27:55] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:55] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 17:27:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:27:55] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2025-06-02 17:27:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:00] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:01] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:01] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:01] [INFO ] Deduced a trap composed of 86 places in 182 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:01] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:01] [INFO ] Deduced a trap composed of 95 places in 181 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:02] [INFO ] Deduced a trap composed of 88 places in 187 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:02] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:03] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:03] [INFO ] Deduced a trap composed of 93 places in 176 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:03] [INFO ] Deduced a trap composed of 93 places in 178 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:03] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:04] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 19 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:04] [INFO ] Deduced a trap composed of 86 places in 185 ms of which 26 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 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
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 14/18 constraints. Problems are: Problem set: 26 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:06] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:06] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 2/20 constraints. Problems are: Problem set: 26 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:09] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:10] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:10] [INFO ] Deduced a trap composed of 88 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:10] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:10] [INFO ] Deduced a trap composed of 78 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 17:28:10] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 6/26 constraints. Problems are: Problem set: 26 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:13] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 1/27 constraints. Problems are: Problem set: 26 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 262/428 variables, 166/193 constraints. Problems are: Problem set: 26 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/193 constraints. Problems are: Problem set: 26 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 193 constraints, problems are : Problem set: 26 solved, 235 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 235 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 23/27 constraints. Problems are: Problem set: 26 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:28] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:29] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:30] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/30 constraints. Problems are: Problem set: 26 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 26 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 262/428 variables, 166/196 constraints. Problems are: Problem set: 26 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 235/431 constraints. Problems are: Problem set: 26 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:38] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 1/432 constraints. Problems are: Problem set: 26 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:51] [INFO ] Deduced a trap along path composed of 7 places in 42 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 433 constraints, problems are : Problem set: 26 solved, 235 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 235/261 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60072ms problems are : Problem set: 26 solved, 235 unsolved
Search for dead transitions found 26 dead transitions in 60073ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 166/190 places, 236/310 transitions.
Applied a total of 0 rules in 3 ms. Remains 166 /166 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60478 ms. Remains : 166/190 places, 236/310 transitions.
[2025-06-02 17:28:56] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:28:56] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:28:56] [INFO ] Input system was already deterministic with 236 transitions.
[2025-06-02 17:28:56] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:28:56] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:28:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13156660011562337172.gal : 5 ms
[2025-06-02 17:28:56] [INFO ] Time to serialize properties into /tmp/CTLFireability16157487393179783465.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13156660011562337172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16157487393179783465.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,513626,1.95403,49436,2,5816,5,135556,6,0,901,182262,0
Converting to forward existential form...Done !
original formula: AX((AF((AX(((p115==1)||(p32==1))) + ((AG((p147==1)) * EG((p224==1))) * ((p36==1)&&(p223==1))))) + EF(((p19==1)&&(p162==1)))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(E(TRUE U ((p19==1)&&(p162==1))))),!((!(EX(!(((p115==1)||(p32==1))))) + ((!(E(TRUE U !((p147=...215
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t27, t41, t45, t46, t53, t57, t61, t64, t68, t76, t84, t88, t89, t104, t107, t109, t...314
(forward)formula 0,1,19.2055,455760,1,0,535,3.16866e+06,508,281,6108,1.4505e+06,671
FORMULA FireWire-PT-15-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 172 transition count 274
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 172 transition count 274
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 165 transition count 253
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 165 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 165 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 163 transition count 248
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 163 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 162 transition count 245
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 162 transition count 245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 161 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 160 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 160 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 159 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 159 transition count 240
Applied a total of 63 rules in 13 ms. Remains 159 /190 variables (removed 31) and now considering 240/310 (removed 70) transitions.
// Phase 1: matrix 240 rows 159 cols
[2025-06-02 17:29:15] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:29:15] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-06-02 17:29:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:29:16] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2025-06-02 17:29:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:19] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:20] [INFO ] Deduced a trap composed of 35 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 17:29:20] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:20] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:20] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:20] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:21] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:21] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:21] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:22] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:22] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:22] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:22] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:23] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:23] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 16 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 15/19 constraints. Problems are: Problem set: 22 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:24] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:25] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 2/21 constraints. Problems are: Problem set: 22 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:27] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:28] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:28] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:28] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 36 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 4/25 constraints. Problems are: Problem set: 22 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/25 constraints. Problems are: Problem set: 22 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 240/399 variables, 159/184 constraints. Problems are: Problem set: 22 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/184 constraints. Problems are: Problem set: 22 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:41] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 30 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/399 variables, 1/185 constraints. Problems are: Problem set: 22 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 185 constraints, problems are : Problem set: 22 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 4/4 constraints. Problems are: Problem set: 22 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 22/26 constraints. Problems are: Problem set: 22 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:48] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 27 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/27 constraints. Problems are: Problem set: 22 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/27 constraints. Problems are: Problem set: 22 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 240/399 variables, 159/186 constraints. Problems are: Problem set: 22 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 217/403 constraints. Problems are: Problem set: 22 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:29:56] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 1/404 constraints. Problems are: Problem set: 22 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:08] [INFO ] Deduced a trap along path composed of 7 places in 49 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 1/405 constraints. Problems are: Problem set: 22 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 405 constraints, problems are : Problem set: 22 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 217/239 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60058ms problems are : Problem set: 22 solved, 217 unsolved
Search for dead transitions found 22 dead transitions in 60060ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 159/190 places, 218/310 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60519 ms. Remains : 159/190 places, 218/310 transitions.
[2025-06-02 17:30:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:30:16] [INFO ] Flatten gal took : 11 ms
[2025-06-02 17:30:16] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 17:30:16] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:30:16] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:30:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9727740981469257487.gal : 2 ms
[2025-06-02 17:30:16] [INFO ] Time to serialize properties into /tmp/CTLFireability7730407012300197881.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9727740981469257487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7730407012300197881.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,539048,1.87658,44796,2,5673,5,129196,6,0,855,182949,0
Converting to forward existential form...Done !
original formula: AG((AX((p111==0)) + (((p51==0)||(p232==0)) * (AF(((p52==0)||(p144==0))) + E((p182==1) U (p101==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(!(EX(!((p111==0)))))) * !(((p51==0)||(p232==0))))] = FALSE * [FwdG(((FwdU(Init,TRUE) * !...244
Reverse transition relation is NOT exact ! Due to transitions t3, t36, t48, t52, t56, t59, t63, t68, t72, t80, t84, t85, t100, t103, t105, t114, t116, t180...305
(forward)formula 0,1,4.90241,84920,1,0,374,363551,469,201,5497,269257,456
FORMULA FireWire-PT-15-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 171 transition count 273
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 171 transition count 273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 165 transition count 262
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 165 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 163 transition count 258
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 163 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 162 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 162 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 161 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 161 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 160 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 160 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 159 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 159 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 158 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 158 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 157 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 157 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 156 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 156 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 155 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 155 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 154 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 154 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 153 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 153 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 152 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 152 transition count 236
Applied a total of 76 rules in 21 ms. Remains 152 /190 variables (removed 38) and now considering 236/310 (removed 74) transitions.
// Phase 1: matrix 236 rows 152 cols
[2025-06-02 17:30:21] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:30:21] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-02 17:30:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:30:21] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2025-06-02 17:30: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/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:25] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:25] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:25] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:26] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:26] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:26] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:26] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:26] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:27] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:27] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:27] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:27] [INFO ] Deduced a trap composed of 87 places in 170 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:28] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:28] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:28] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 14 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:30] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 1/20 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:33] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:33] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/22 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:35] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 1/23 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 236/388 variables, 152/175 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/388 variables, and 175 constraints, problems are : Problem set: 15 solved, 220 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 19/23 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 236/388 variables, 152/175 constraints. Problems are: Problem set: 15 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 220/395 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:59] [INFO ] Deduced a trap composed of 82 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 17:30:59] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 2/397 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:11] [INFO ] Deduced a trap along path composed of 7 places in 43 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/398 constraints. Problems are: Problem set: 15 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 398 constraints, problems are : Problem set: 15 solved, 220 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 220/235 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60077ms problems are : Problem set: 15 solved, 220 unsolved
Search for dead transitions found 15 dead transitions in 60079ms
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 : 152/190 places, 221/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 220
Applied a total of 2 rules in 4 ms. Remains 151 /152 variables (removed 1) and now considering 220/221 (removed 1) transitions.
// Phase 1: matrix 220 rows 151 cols
[2025-06-02 17:31:21] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:21] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 17:31:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:22] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/190 places, 220/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60938 ms. Remains : 151/190 places, 220/310 transitions.
[2025-06-02 17:31:22] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:31:22] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:31:22] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-02 17:31:22] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:31:22] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:31:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8248902370383002573.gal : 18 ms
[2025-06-02 17:31:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6132433810157072775.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8248902370383002573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6132433810157072775.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,494698,1.43725,39768,2,4860,5,113855,6,0,825,171333,0
Converting to forward existential form...Done !
original formula: EF(((AX(((A((p220==1) U (p212==1)) * ((p147==1)||((p20==1)&&(p241==1)))) + EG(((p25==1)&&(p187==1))))) * EX(EX(((p41==0)||(p187==0))))) *...167
=> equivalent forward existential formula: [(EY(EY(((FwdU(Init,TRUE) * (p147==1)) * !(EX(!(((!((E(!((p212==1)) U (!((p220==1)) * !((p212==1)))) + EG(!((p21...272
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t36, t39, t48, t52, t56, t59, t63, t71, t79, t83, t84, t100, t103, t105, t114, t116, ...303
(forward)formula 0,0,23.4277,572492,1,0,707,4.11243e+06,474,364,5328,2.70823e+06,851
FORMULA FireWire-PT-15-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 171 transition count 273
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 171 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 164 transition count 252
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 164 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 164 transition count 251
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 162 transition count 247
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 162 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 161 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 160 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 159 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 158 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 158 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 157 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 156 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 155 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 154 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 154 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 153 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 152 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 152 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 151 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 151 transition count 225
Applied a total of 79 rules in 23 ms. Remains 151 /190 variables (removed 39) and now considering 225/310 (removed 85) transitions.
// Phase 1: matrix 225 rows 151 cols
[2025-06-02 17:31:45] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:45] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-02 17:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:46] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-06-02 17:31:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:50] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:50] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:50] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:50] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:50] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:51] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:51] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:51] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 17 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:52] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:52] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:53] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:53] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:53] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 5/17 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:57] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:58] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:59] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 2/20 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:00] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:00] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:00] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 3/23 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:03] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/24 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:05] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 225/376 variables, 151/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 176 constraints, problems are : Problem set: 15 solved, 209 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 21/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 225/376 variables, 151/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 209/385 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:26] [INFO ] Deduced a trap along path composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/386 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 386 constraints, problems are : Problem set: 15 solved, 209 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/224 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60060ms problems are : Problem set: 15 solved, 209 unsolved
Search for dead transitions found 15 dead transitions in 60062ms
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 : 151/190 places, 210/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 208
Applied a total of 4 rules in 5 ms. Remains 149 /151 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 149 cols
[2025-06-02 17:32:46] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:46] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-06-02 17:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:46] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/190 places, 208/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60992 ms. Remains : 149/190 places, 208/310 transitions.
[2025-06-02 17:32:46] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:32:46] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:32:46] [INFO ] Input system was already deterministic with 208 transitions.
[2025-06-02 17:32:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:32:46] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:32:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10180156211667081221.gal : 3 ms
[2025-06-02 17:32:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16939858212214728528.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10180156211667081221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16939858212214728528.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,477446,1.71355,39288,2,4898,5,106757,6,0,805,147401,0
Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t35, t47, t51, t55, t58, t62, t70, t78, t82, t83, t98, t101, t103, t112, t114, t169, t192...299
(forward)formula 0,1,4.24555,79924,1,0,345,318048,430,183,5015,271189,421
FORMULA FireWire-PT-15-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Graph (trivial) has 123 edges and 190 vertex of which 6 / 190 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 185 transition count 286
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 166 transition count 284
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 165 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 163 transition count 282
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 46 place count 163 transition count 273
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 64 place count 154 transition count 273
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 77 place count 141 transition count 242
Iterating global reduction 4 with 13 rules applied. Total rules applied 90 place count 141 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 141 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 91 place count 141 transition count 239
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 95 place count 139 transition count 239
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 99 place count 135 transition count 232
Iterating global reduction 5 with 4 rules applied. Total rules applied 103 place count 135 transition count 232
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 104 place count 134 transition count 230
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 134 transition count 230
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 119 place count 127 transition count 223
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 122 place count 124 transition count 217
Iterating global reduction 5 with 3 rules applied. Total rules applied 125 place count 124 transition count 217
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 123 transition count 214
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 123 transition count 214
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 122 transition count 213
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 122 transition count 213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 121 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 121 transition count 210
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 120 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 120 transition count 209
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 119 transition count 206
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 119 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 118 transition count 205
Applied a total of 136 rules in 143 ms. Remains 118 /190 variables (removed 72) and now considering 205/310 (removed 105) transitions.
[2025-06-02 17:32:51] [INFO ] Flow matrix only has 204 transitions (discarded 1 similar events)
// Phase 1: matrix 204 rows 118 cols
[2025-06-02 17:32:51] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:51] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 17:32:51] [INFO ] Flow matrix only has 204 transitions (discarded 1 similar events)
[2025-06-02 17:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:32:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:32:51] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:32:51] [INFO ] Redundant transitions in 10 ms returned []
Running 201 sub problems to find dead transitions.
[2025-06-02 17:32:51] [INFO ] Flow matrix only has 204 transitions (discarded 1 similar events)
[2025-06-02 17:32:51] [INFO ] Invariant cache hit.
[2025-06-02 17:32:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:52] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:53] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 9 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:53] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 13 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:53] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 19 ms to minimize.
Problem TDEAD172 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:54] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 5/7 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 2/9 constraints. Problems are: Problem set: 20 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:57] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:57] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:58] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:58] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 4/13 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 203/321 variables, 118/131 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 1/132 constraints. Problems are: Problem set: 20 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:03] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 1/133 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/133 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/321 variables, 0/133 constraints. Problems are: Problem set: 20 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/322 variables, and 133 constraints, problems are : Problem set: 20 solved, 181 unsolved in 20722 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 2/14 constraints. Problems are: Problem set: 20 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:15] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/15 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 203/321 variables, 118/133 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 1/134 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 181/315 constraints. Problems are: Problem set: 20 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/315 constraints. Problems are: Problem set: 20 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:34] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 12 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/321 variables, 1/316 constraints. Problems are: Problem set: 20 solved, 181 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/322 variables, and 316 constraints, problems are : Problem set: 20 solved, 181 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/201 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50778ms problems are : Problem set: 20 solved, 181 unsolved
Search for dead transitions found 20 dead transitions in 50779ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 118/190 places, 185/310 transitions.
Applied a total of 0 rules in 9 ms. Remains 118 /118 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:33:42] [INFO ] Redundant transitions in 12 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 51312 ms. Remains : 118/190 places, 185/310 transitions.
[2025-06-02 17:33:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:33:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:33:42] [INFO ] Input system was already deterministic with 185 transitions.
[2025-06-02 17:33:42] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:33:42] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:33:42] [INFO ] Time to serialize gal into /tmp/CTLFireability2763220915160701230.gal : 3 ms
[2025-06-02 17:33:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16047988846985181210.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2763220915160701230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16047988846985181210.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,120940,0.519353,14928,2,2342,5,36817,6,0,656,42117,0
Converting to forward existential form...Done !
original formula: !(E(AF((EG((((p63==1)&&(p52==1))&&(p233==1))) + ((p41==1)&&(p203==1)))) U ((!(EF(((p47==1)||(p161==1)))) + ((E(E(((p52==1)&&(p142==1)) U ...242
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(!((EG((((p63==1)&&(p52==1))&&(p233==1))) + ((p41==1)&&(p203==1))))))) * (((p25==1)&&(p203==1)...434
Reverse transition relation is NOT exact ! Due to transitions t25, t31, t33, t34, t39, t42, t44, t49, t51, t53, t59, t60, t126, t140, t155, t168, t169, t17...288
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,8.67582,236456,1,0,520,1.48073e+06,419,295,4863,1.16938e+06,590
FORMULA FireWire-PT-15-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 172 transition count 274
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 172 transition count 274
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 166 transition count 255
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 166 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 166 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 164 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 164 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 163 transition count 247
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 163 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 162 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 162 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 161 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 161 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 160 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 160 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 159 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 159 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 158 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 158 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 157 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 157 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 156 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 156 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 155 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 155 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 154 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 154 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 153 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 153 transition count 228
Applied a total of 75 rules in 22 ms. Remains 153 /190 variables (removed 37) and now considering 228/310 (removed 82) transitions.
// Phase 1: matrix 228 rows 153 cols
[2025-06-02 17:33:51] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:33:51] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 17:33:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:33:51] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2025-06-02 17:33:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:55] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:55] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:55] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:55] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:55] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:56] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:56] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:56] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:57] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 26 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:58] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:58] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:58] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/16 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:01] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:01] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:01] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:02] [INFO ] Deduced a trap composed of 83 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 17:34:02] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/21 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 228/381 variables, 153/174 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/174 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/381 variables, 0/174 constraints. Problems are: Problem set: 15 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 174 constraints, problems are : Problem set: 15 solved, 212 unsolved in 25780 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:19] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/22 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 228/381 variables, 153/175 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 212/387 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:25] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:26] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 2/389 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/389 constraints. Problems are: Problem set: 15 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 389 constraints, problems are : Problem set: 15 solved, 212 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 212/227 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55832ms problems are : Problem set: 15 solved, 212 unsolved
Search for dead transitions found 15 dead transitions in 55832ms
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 : 153/190 places, 213/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 211
Applied a total of 4 rules in 4 ms. Remains 151 /153 variables (removed 2) and now considering 211/213 (removed 2) transitions.
// Phase 1: matrix 211 rows 151 cols
[2025-06-02 17:34:47] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:34:47] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-02 17:34:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:34:47] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/190 places, 211/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56583 ms. Remains : 151/190 places, 211/310 transitions.
[2025-06-02 17:34:47] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:34:47] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:34:47] [INFO ] Input system was already deterministic with 211 transitions.
[2025-06-02 17:34:47] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:34:47] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:34:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11282033801197080496.gal : 2 ms
[2025-06-02 17:34:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10048855924735824617.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11282033801197080496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10048855924735824617.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,491810,1.20846,34828,2,4527,5,99745,6,0,816,146914,0
Converting to forward existential form...Done !
original formula: EF((EX((p114==1)) * A(((p52==1)&&(p156==1)) U ((p53==1)&&(p178==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * EX((p114==1))) * !(EG(!(((p53==1)&&(p178==1)))))) * !(E(!(((p53==1)&&(p178==1))) U (!(((p5...214
Reverse transition relation is NOT exact ! Due to transitions t3, t23, t37, t49, t53, t58, t61, t65, t73, t81, t85, t86, t101, t104, t106, t115, t117, t172...305
(forward)formula 0,0,23.4904,578540,1,0,661,4.16139e+06,449,337,5242,2.76563e+06,781
FORMULA FireWire-PT-15-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Graph (trivial) has 138 edges and 190 vertex of which 11 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 181 transition count 276
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 157 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 156 transition count 274
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 52 place count 156 transition count 263
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 74 place count 145 transition count 263
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 86 place count 133 transition count 233
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 133 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 133 transition count 232
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 99 place count 133 transition count 231
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 132 transition count 231
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 105 place count 128 transition count 224
Iterating global reduction 4 with 4 rules applied. Total rules applied 109 place count 128 transition count 224
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 127 transition count 222
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 127 transition count 222
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 129 place count 118 transition count 213
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 133 place count 114 transition count 197
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 114 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 114 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 113 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 113 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 141 place count 112 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 112 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 111 transition count 189
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 111 transition count 189
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 110 transition count 188
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 110 transition count 188
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 109 transition count 185
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 109 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 108 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 108 transition count 184
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 151 place count 107 transition count 181
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 107 transition count 181
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 106 transition count 180
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 106 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 105 transition count 177
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 105 transition count 177
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 157 place count 104 transition count 176
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 104 transition count 176
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 103 transition count 174
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 103 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 102 transition count 173
Applied a total of 161 rules in 54 ms. Remains 102 /190 variables (removed 88) and now considering 173/310 (removed 137) transitions.
[2025-06-02 17:35:11] [INFO ] Flow matrix only has 170 transitions (discarded 3 similar events)
// Phase 1: matrix 170 rows 102 cols
[2025-06-02 17:35:11] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:35:11] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 17:35:11] [INFO ] Flow matrix only has 170 transitions (discarded 3 similar events)
[2025-06-02 17:35:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:35:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:35:12] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:35:12] [INFO ] Redundant transitions in 4 ms returned []
Running 168 sub problems to find dead transitions.
[2025-06-02 17:35:12] [INFO ] Flow matrix only has 170 transitions (discarded 3 similar events)
[2025-06-02 17:35:12] [INFO ] Invariant cache hit.
[2025-06-02 17:35:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:13] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:13] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:13] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 20 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:14] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 10 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:14] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 21 ms to minimize.
Problem TDEAD150 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:14] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:14] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 169/270 variables, 101/112 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/113 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 1/271 variables, 1/114 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/272 variables, and 114 constraints, problems are : Problem set: 15 solved, 153 unsolved in 14209 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 169/270 variables, 101/112 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 153/266 constraints. Problems are: Problem set: 15 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:30] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/267 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/267 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/268 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/268 constraints. Problems are: Problem set: 15 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/268 constraints. Problems are: Problem set: 15 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/272 variables, and 268 constraints, problems are : Problem set: 15 solved, 153 unsolved in 28143 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/168 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42383ms problems are : Problem set: 15 solved, 153 unsolved
Search for dead transitions found 15 dead transitions in 42384ms
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 SI_CTL mode, iteration 1 : 102/190 places, 158/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 157
Applied a total of 2 rules in 5 ms. Remains 101 /102 variables (removed 1) and now considering 157/158 (removed 1) transitions.
[2025-06-02 17:35:54] [INFO ] Flow matrix only has 154 transitions (discarded 3 similar events)
// Phase 1: matrix 154 rows 101 cols
[2025-06-02 17:35:54] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:35:54] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-02 17:35:54] [INFO ] Flow matrix only has 154 transitions (discarded 3 similar events)
[2025-06-02 17:35:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:35:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:35:54] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 101/190 places, 157/310 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 43274 ms. Remains : 101/190 places, 157/310 transitions.
[2025-06-02 17:35:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:35:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:35:54] [INFO ] Input system was already deterministic with 157 transitions.
[2025-06-02 17:35:55] [INFO ] Flatten gal took : 36 ms
[2025-06-02 17:35:55] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:35:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4430433855827367893.gal : 1 ms
[2025-06-02 17:35:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9127833718966629772.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4430433855827367893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9127833718966629772.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (3014 resets) in 531 ms. (75 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality9127833718966629772.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 93
BEST_FIRST walk for 40002 steps (1105 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :93 after 118
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :118 after 202
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :202 after 493
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :493 after 2095
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2095 after 3875
Reachability property FireWire-PT-15-CTLFireability-2025-11 is true.
FORMULA FireWire-PT-15-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Finished probabilistic random walk after 91566 steps, run visited all 1 properties in 257 ms. (steps per millisecond=356 )
Probabilistic random walk after 91566 steps, saw 22273 distinct states, run finished after 257 ms. (steps per millisecond=356 ) properties seen :1
ITS runner timed out or was interrupted.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,17365,0.305034,9812,2,2143,15,20932,6,0,559,18559,0
Total reachable state count : 17365
Verifying 1 reachability properties.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 171 transition count 273
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 171 transition count 273
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 164 transition count 252
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 164 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 164 transition count 251
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 162 transition count 247
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 162 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 161 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 160 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 159 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 158 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 158 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 157 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 156 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 155 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 154 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 154 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 153 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 152 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 152 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 151 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 151 transition count 225
Applied a total of 79 rules in 35 ms. Remains 151 /190 variables (removed 39) and now considering 225/310 (removed 85) transitions.
// Phase 1: matrix 225 rows 151 cols
[2025-06-02 17:35:55] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:35:55] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-02 17:35:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:35:56] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2025-06-02 17:35:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:59] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:59] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:59] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:59] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:00] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:00] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:00] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:00] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 16 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:01] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:02] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:02] [INFO ] Deduced a trap composed of 78 places in 152 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:02] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:02] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 5/17 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:05] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/18 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:06] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:06] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 2/20 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:07] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:07] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:08] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 3/23 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:10] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 1/24 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:13] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 225/376 variables, 151/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 176 constraints, problems are : Problem set: 15 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 21/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 225/376 variables, 151/176 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 209/385 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:36] [INFO ] Deduced a trap along path composed of 7 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/386 constraints. Problems are: Problem set: 15 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 386 constraints, problems are : Problem set: 15 solved, 209 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/224 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60075ms problems are : Problem set: 15 solved, 209 unsolved
Search for dead transitions found 15 dead transitions in 60077ms
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 : 151/190 places, 210/310 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 208
Applied a total of 4 rules in 5 ms. Remains 149 /151 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 149 cols
[2025-06-02 17:36:56] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:56] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-02 17:36:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:56] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/190 places, 208/310 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61186 ms. Remains : 149/190 places, 208/310 transitions.
[2025-06-02 17:36:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:36:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:36:56] [INFO ] Input system was already deterministic with 208 transitions.
[2025-06-02 17:36:56] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:36:56] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:36:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2031371287129495994.gal : 3 ms
[2025-06-02 17:36:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17576170310698037370.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2031371287129495994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17576170310698037370.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,477446,1.57963,39164,2,4898,5,106757,6,0,805,147401,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,1.59209,39164,1,0,6,106757,7,1,1050,147401,1
FORMULA FireWire-PT-15-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Graph (trivial) has 135 edges and 190 vertex of which 11 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 181 transition count 278
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 159 transition count 276
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 158 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 157 transition count 275
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 50 place count 157 transition count 264
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 72 place count 146 transition count 264
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 83 place count 135 transition count 244
Iterating global reduction 4 with 11 rules applied. Total rules applied 94 place count 135 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 135 transition count 243
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 95 place count 135 transition count 241
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 99 place count 133 transition count 241
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 102 place count 130 transition count 235
Iterating global reduction 5 with 3 rules applied. Total rules applied 105 place count 130 transition count 235
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 123 place count 121 transition count 226
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 126 place count 118 transition count 212
Iterating global reduction 5 with 3 rules applied. Total rules applied 129 place count 118 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 130 place count 118 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 117 transition count 210
Applied a total of 131 rules in 55 ms. Remains 117 /190 variables (removed 73) and now considering 210/310 (removed 100) transitions.
[2025-06-02 17:36:58] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
// Phase 1: matrix 207 rows 117 cols
[2025-06-02 17:36:58] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:58] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-02 17:36:58] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
[2025-06-02 17:36:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:36:58] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:36:58] [INFO ] Redundant transitions in 2 ms returned []
Running 205 sub problems to find dead transitions.
[2025-06-02 17:36:58] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
[2025-06-02 17:36:58] [INFO ] Invariant cache hit.
[2025-06-02 17:36:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/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 17:37:00] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:00] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:00] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:01] [INFO ] Deduced a trap composed of 22 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 17:37:01] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 10 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:01] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 18 ms to minimize.
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:01] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 18 ms to minimize.
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:02] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 17 ms to minimize.
Problem TDEAD179 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:02] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 9/13 constraints. Problems are: Problem set: 26 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:03] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 1/14 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 206/322 variables, 116/130 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 1/131 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/131 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 1/323 variables, 1/132 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/132 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/323 variables, 0/132 constraints. Problems are: Problem set: 26 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/324 variables, and 132 constraints, problems are : Problem set: 26 solved, 179 unsolved in 21883 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 179 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 10/14 constraints. Problems are: Problem set: 26 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:21] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/16 constraints. Problems are: Problem set: 26 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:22] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/17 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 206/322 variables, 116/133 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 1/134 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 179/313 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/313 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/314 constraints. Problems are: Problem set: 26 solved, 179 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:35] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:35] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:35] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 3/317 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/317 constraints. Problems are: Problem set: 26 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/324 variables, and 317 constraints, problems are : Problem set: 26 solved, 179 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/205 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51950ms problems are : Problem set: 26 solved, 179 unsolved
Search for dead transitions found 26 dead transitions in 51950ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/190 places, 184/310 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:37:50] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 52600 ms. Remains : 117/190 places, 184/310 transitions.
[2025-06-02 17:37:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:37:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:37:50] [INFO ] Input system was already deterministic with 184 transitions.
[2025-06-02 17:37:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:37:50] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:37:50] [INFO ] Time to serialize gal into /tmp/CTLFireability3201852690560111602.gal : 1 ms
[2025-06-02 17:37:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9814627537164513466.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3201852690560111602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9814627537164513466.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,94630,0.788206,18404,2,2926,5,43177,6,0,650,54461,0
Converting to forward existential form...Done !
original formula: EG(EF(((AF((p180==1)) + A((p197==1) U ((p36==1)&&(p176==1)))) + (p227==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(EG(!((p180==1)))) + !((E(!(((p36==1)&&(p176==1))) U (!((p197==1)) * !(((p36==1)&&(p176==...220
Reverse transition relation is NOT exact ! Due to transitions t12, t25, t27, t30, t33, t34, t39, t41, t42, t46, t48, t52, t53, t124, t127, t135, t145, t170...299
(forward)formula 0,1,15.4637,352512,1,0,955,2.02422e+06,407,614,4745,1.81935e+06,1083
FORMULA FireWire-PT-15-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 310/310 transitions.
Graph (trivial) has 142 edges and 190 vertex of which 11 / 190 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 181 transition count 276
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 157 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 156 transition count 274
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 52 place count 156 transition count 263
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 74 place count 145 transition count 263
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 86 place count 133 transition count 233
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 133 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 133 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 99 place count 133 transition count 230
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 103 place count 131 transition count 230
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 107 place count 127 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 127 transition count 223
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 126 transition count 221
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 126 transition count 221
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 133 place count 116 transition count 211
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 137 place count 112 transition count 195
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 112 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 112 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 111 transition count 191
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 111 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 110 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 110 transition count 190
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 109 transition count 187
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 109 transition count 187
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 149 place count 108 transition count 186
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 108 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 107 transition count 185
Applied a total of 151 rules in 50 ms. Remains 107 /190 variables (removed 83) and now considering 185/310 (removed 125) transitions.
[2025-06-02 17:38:06] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
// Phase 1: matrix 182 rows 107 cols
[2025-06-02 17:38:06] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:06] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-06-02 17:38:06] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
[2025-06-02 17:38:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:38:07] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:38:07] [INFO ] Redundant transitions in 2 ms returned []
Running 180 sub problems to find dead transitions.
[2025-06-02 17:38:07] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
[2025-06-02 17:38:07] [INFO ] Invariant cache hit.
[2025-06-02 17:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:08] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:08] [INFO ] Deduced a trap composed of 38 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 17:38:08] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:08] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 20 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:09] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:09] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 17 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:09] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 16 ms to minimize.
Problem TDEAD161 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:10] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:10] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 9/13 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 181/287 variables, 106/119 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 1/120 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/120 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 1/288 variables, 1/121 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/121 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/288 variables, 0/121 constraints. Problems are: Problem set: 22 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/289 variables, and 121 constraints, problems are : Problem set: 22 solved, 158 unsolved in 16110 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 9/13 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 181/287 variables, 106/119 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 1/120 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 158/278 constraints. Problems are: Problem set: 22 solved, 158 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:26] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/279 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/279 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 1/288 variables, 1/280 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/280 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/288 variables, 0/280 constraints. Problems are: Problem set: 22 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/289 variables, and 280 constraints, problems are : Problem set: 22 solved, 158 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 158/180 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46162ms problems are : Problem set: 22 solved, 158 unsolved
Search for dead transitions found 22 dead transitions in 46164ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 107/190 places, 163/310 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:38:53] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 46783 ms. Remains : 107/190 places, 163/310 transitions.
[2025-06-02 17:38:53] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:38:53] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:38:53] [INFO ] Input system was already deterministic with 163 transitions.
[2025-06-02 17:38:53] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:38:53] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:38:53] [INFO ] Time to serialize gal into /tmp/CTLFireability14986227123811602273.gal : 2 ms
[2025-06-02 17:38:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9401574277540782503.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14986227123811602273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9401574277540782503.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,82897,0.329832,14012,2,2058,5,32845,6,0,589,37960,0
Converting to forward existential form...Done !
original formula: AF(((p51==1)&&(p139==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p51==1)&&(p139==1))))] = FALSE
Hit Full ! (commute/partial/dont) 133/0/30
(forward)formula 0,0,1.08241,28508,1,0,8,103674,20,4,3103,81730,8
FORMULA FireWire-PT-15-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 17:38:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:38:54] [INFO ] Flatten gal took : 14 ms
Total runtime 1102246 ms.
BK_STOP 1748885934627
--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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-15"
export BK_EXAMINATION="CTLFireability"
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-15, examination is CTLFireability"
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-174860102400354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;