Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400361.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is FireWire-PT-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 84K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748886633717

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 17:50:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 17:50:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:50:36] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2025-06-02 17:50:36] [INFO ] Transformed 254 places.
[2025-06-02 17:50:36] [INFO ] Transformed 368 transitions.
[2025-06-02 17:50:36] [INFO ] Found NUPN structural information;
[2025-06-02 17:50:36] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Support contains 99 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 26 place count 228 transition count 345
Iterating global reduction 1 with 23 rules applied. Total rules applied 49 place count 228 transition count 345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 227 transition count 344
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 227 transition count 344
Applied a total of 51 rules in 110 ms. Remains 227 /254 variables (removed 27) and now considering 344/368 (removed 24) transitions.
// Phase 1: matrix 344 rows 227 cols
[2025-06-02 17:50:37] [INFO ] Computed 4 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:50:37] [INFO ] Implicit Places using invariants in 610 ms returned []
[2025-06-02 17:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:50:38] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2025-06-02 17:50:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:47] [INFO ] Deduced a trap composed of 91 places in 351 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:48] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:48] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:48] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:48] [INFO ] Deduced a trap composed of 95 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:50:49] [INFO ] Deduced a trap composed of 103 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:50:49] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:50] [INFO ] Deduced a trap composed of 103 places in 226 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:50] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:50] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:50] [INFO ] Deduced a trap composed of 114 places in 232 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:51] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:51] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 24 ms to minimize.
Problem TDEAD198 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD317 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:53] [INFO ] Deduced a trap composed of 106 places in 216 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:53] [INFO ] Deduced a trap composed of 106 places in 203 ms of which 23 ms to minimize.
Problem TDEAD323 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:53] [INFO ] Deduced a trap composed of 95 places in 206 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 16/20 constraints. Problems are: Problem set: 11 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:54] [INFO ] Deduced a trap composed of 109 places in 244 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:55] [INFO ] Deduced a trap composed of 110 places in 260 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:55] [INFO ] Deduced a trap composed of 94 places in 209 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:55] [INFO ] Deduced a trap composed of 103 places in 222 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:56] [INFO ] Deduced a trap composed of 99 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:56] [INFO ] Deduced a trap composed of 103 places in 229 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:50:57] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 7/27 constraints. Problems are: Problem set: 11 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:04] [INFO ] Deduced a trap composed of 90 places in 263 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:04] [INFO ] Deduced a trap composed of 111 places in 264 ms of which 48 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 2/29 constraints. Problems are: Problem set: 11 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:08] [INFO ] Deduced a trap composed of 93 places in 266 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:08] [INFO ] Deduced a trap composed of 105 places in 258 ms of which 52 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/571 variables, and 31 constraints, problems are : Problem set: 11 solved, 332 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/227 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 332 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 332 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 332 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 27/31 constraints. Problems are: Problem set: 11 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:12] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:12] [INFO ] Deduced a trap composed of 99 places in 193 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:13] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:13] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:15] [INFO ] Deduced a trap composed of 109 places in 202 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 5/36 constraints. Problems are: Problem set: 11 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:17] [INFO ] Deduced a trap composed of 108 places in 198 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:18] [INFO ] Deduced a trap composed of 111 places in 187 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:18] [INFO ] Deduced a trap composed of 105 places in 257 ms of which 51 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 3/39 constraints. Problems are: Problem set: 11 solved, 332 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:23] [INFO ] Deduced a trap composed of 77 places in 287 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:23] [INFO ] Deduced a trap composed of 106 places in 215 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:23] [INFO ] Deduced a trap composed of 106 places in 225 ms of which 45 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 3/42 constraints. Problems are: Problem set: 11 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/42 constraints. Problems are: Problem set: 11 solved, 332 unsolved
At refinement iteration 7 (OVERLAPS) 344/571 variables, 227/269 constraints. Problems are: Problem set: 11 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 332/601 constraints. Problems are: Problem set: 11 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 601 constraints, problems are : Problem set: 11 solved, 332 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 332/343 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 11 solved, 332 unsolved
Search for dead transitions found 11 dead transitions in 60425ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 227/254 places, 333/368 transitions.
Applied a total of 0 rules in 13 ms. Remains 227 /227 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61937 ms. Remains : 227/254 places, 333/368 transitions.
Support contains 99 out of 227 places after structural reductions.
[2025-06-02 17:51:39] [INFO ] Flatten gal took : 114 ms
[2025-06-02 17:51:39] [INFO ] Flatten gal took : 55 ms
[2025-06-02 17:51:39] [INFO ] Input system was already deterministic with 333 transitions.
Support contains 83 out of 227 places (down from 99) after GAL structural reductions.
RANDOM walk for 40000 steps (13 resets) in 4129 ms. (9 steps per ms) remains 42/58 properties
BEST_FIRST walk for 4000 steps (10 resets) in 37 ms. (105 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (9 resets) in 90 ms. (43 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4000 steps (8 resets) in 79 ms. (50 steps per ms) remains 38/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 81 ms. (48 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (9 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (9 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4002 steps (10 resets) in 44 ms. (88 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (11 resets) in 36 ms. (108 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (11 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (11 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (9 resets) in 36 ms. (108 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 36 ms. (108 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (9 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (10 resets) in 52 ms. (75 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (10 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (9 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (9 resets) in 69 ms. (57 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 41 ms. (95 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (9 resets) in 36 ms. (108 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (9 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (10 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (10 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
// Phase 1: matrix 333 rows 227 cols
[2025-06-02 17:51:41] [INFO ] Computed 4 invariants in 10 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 1 (OVERLAPS) 146/205 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 315/520 variables, 205/209 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 23/543 variables, 11/220 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 13/556 variables, 8/228 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 4/560 variables, 3/231 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/560 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 231 constraints, problems are : Problem set: 1 solved, 36 unsolved in 3762 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 36 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 36 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 150/205 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:45] [INFO ] Deduced a trap composed of 93 places in 189 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:45] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 94 places in 169 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:46] [INFO ] Deduced a trap composed of 91 places in 274 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 114 places in 258 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 82 places in 253 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:47] [INFO ] Deduced a trap composed of 90 places in 241 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:48] [INFO ] Deduced a trap composed of 105 places in 179 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:48] [INFO ] Deduced a trap composed of 101 places in 229 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:48] [INFO ] Deduced a trap composed of 98 places in 267 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:49] [INFO ] Deduced a trap composed of 98 places in 266 ms of which 61 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 13/17 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 315/520 variables, 205/222 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 33/255 constraints. Problems are: Problem set: 2 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/560 variables, and 255 constraints, problems are : Problem set: 2 solved, 35 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/227 constraints, PredecessorRefiner: 33/37 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8811ms problems are : Problem set: 2 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 333/333 transitions.
Graph (trivial) has 119 edges and 227 vertex of which 4 / 227 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 224 transition count 296
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 73 place count 192 transition count 288
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 81 place count 184 transition count 288
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 81 place count 184 transition count 282
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 93 place count 178 transition count 282
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 101 place count 170 transition count 274
Iterating global reduction 3 with 8 rules applied. Total rules applied 109 place count 170 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 170 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 110 place count 170 transition count 271
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 114 place count 168 transition count 271
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 167 transition count 270
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 167 transition count 270
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 160 place count 145 transition count 248
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 176 place count 137 transition count 268
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 189 place count 137 transition count 255
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 202 place count 124 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 124 transition count 253
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 208 place count 124 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 211 place count 124 transition count 250
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 124 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 123 transition count 249
Applied a total of 213 rules in 229 ms. Remains 123 /227 variables (removed 104) and now considering 249/333 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 123/227 places, 249/333 transitions.
RANDOM walk for 40000 steps (2838 resets) in 814 ms. (49 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (85 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (87 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (85 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (84 resets) in 52 ms. (75 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (84 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (86 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (83 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (88 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (87 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (79 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (89 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (87 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (83 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (89 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (90 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (91 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (85 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (85 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (88 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (87 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (85 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (85 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (87 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (86 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (84 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (82 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (86 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (85 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (80 resets) in 25 ms. (153 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4000 steps (80 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (87 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (82 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (85 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (90 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (83 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
Finished probabilistic random walk after 205079 steps, run visited all 34 properties in 1327 ms. (steps per millisecond=154 )
Probabilistic random walk after 205079 steps, saw 52222 distinct states, run finished after 1333 ms. (steps per millisecond=153 ) properties seen :34
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2025-06-02 17:51:52] [INFO ] Flatten gal took : 23 ms
[2025-06-02 17:51:52] [INFO ] Flatten gal took : 24 ms
[2025-06-02 17:51:52] [INFO ] Input system was already deterministic with 333 transitions.
Computed a total of 30 stabilizing places and 32 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 192 transition count 289
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 192 transition count 289
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 84 place count 178 transition count 271
Iterating global reduction 0 with 14 rules applied. Total rules applied 98 place count 178 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 178 transition count 269
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 176 transition count 267
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 176 transition count 267
Applied a total of 104 rules in 20 ms. Remains 176 /227 variables (removed 51) and now considering 267/333 (removed 66) transitions.
// Phase 1: matrix 267 rows 176 cols
[2025-06-02 17:51:52] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:51:52] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 17:51:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:51:52] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-02 17:51:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:58] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:58] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:51:59] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 12 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:00] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 18 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:00] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 33 ms to minimize.
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 267/443 variables, 176/185 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:07] [INFO ] Deduced a trap composed of 60 places in 210 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:07] [INFO ] Deduced a trap composed of 94 places in 169 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 2/187 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:11] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:11] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 2/189 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/443 variables, and 189 constraints, problems are : Problem set: 15 solved, 251 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:26] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:28] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:28] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 39 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 2/16 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 267/443 variables, 176/192 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 251/443 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:52:40] [INFO ] Deduced a trap along path composed of 10 places in 55 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/444 constraints. Problems are: Problem set: 15 solved, 251 unsolved
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 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 444 constraints, problems are : Problem set: 15 solved, 251 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 251/266 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60089ms problems are : Problem set: 15 solved, 251 unsolved
Search for dead transitions found 15 dead transitions in 60091ms
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 : 176/227 places, 252/333 transitions.
Applied a total of 0 rules in 5 ms. Remains 176 /176 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60478 ms. Remains : 176/227 places, 252/333 transitions.
[2025-06-02 17:52:53] [INFO ] Flatten gal took : 28 ms
[2025-06-02 17:52:53] [INFO ] Flatten gal took : 28 ms
[2025-06-02 17:52:53] [INFO ] Input system was already deterministic with 252 transitions.
[2025-06-02 17:52:53] [INFO ] Flatten gal took : 24 ms
[2025-06-02 17:52:53] [INFO ] Flatten gal took : 24 ms
[2025-06-02 17:52:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality286771491009180527.gal : 13 ms
[2025-06-02 17:52:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10713425214017998527.ctl : 5 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/CTLCardinality286771491009180527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10713425214017998527.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,1.61649e+06,0.476719,11996,2,2074,5,22374,6,0,957,31389,0


Converting to forward existential form...Done !
original formula: AG(AX(((EF(((p64==0)&&(p174==1))) + EX(((p248==0)||(p29==1)))) + (p134==1))))
=> equivalent forward existential formula: [(((EY(FwdU(Init,TRUE)) * !((p134==1))) * !(EX(((p248==0)||(p29==1))))) * !(E(TRUE U ((p64==0)&&(p174==1)))))] =...161
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t26, t28, t34, t39, t44, t52, t65, t69, t82, t87, t91, t95, t97, t113, t121, t127, ...297
(forward)formula 0,0,7.0283,154532,1,0,472,927365,527,263,6318,648112,594
FORMULA FireWire-PT-16-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 191 transition count 288
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 191 transition count 288
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 85 place count 178 transition count 271
Iterating global reduction 0 with 13 rules applied. Total rules applied 98 place count 178 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 178 transition count 269
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 176 transition count 267
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 176 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 175 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 175 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 174 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 174 transition count 265
Applied a total of 108 rules in 30 ms. Remains 174 /227 variables (removed 53) and now considering 265/333 (removed 68) transitions.
// Phase 1: matrix 265 rows 174 cols
[2025-06-02 17:53:00] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:53:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-06-02 17:53:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:53:00] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2025-06-02 17:53:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:06] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:06] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:06] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:07] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 12 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:08] [INFO ] Deduced a trap composed of 75 places in 164 ms of which 28 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:08] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 29 ms to minimize.
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:09] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:09] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:09] [INFO ] Deduced a trap composed of 84 places in 172 ms of which 26 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 3/13 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:14] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 265/439 variables, 174/188 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:20] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:21] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 2/190 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/190 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/439 variables, and 190 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:34] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:34] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 2/18 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 265/439 variables, 174/192 constraints. Problems are: Problem set: 15 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 249/441 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:42] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:43] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:43] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 3/444 constraints. Problems are: Problem set: 15 solved, 249 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:53:56] [INFO ] Deduced a trap along path composed of 10 places in 43 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/439 variables, and 445 constraints, problems are : Problem set: 15 solved, 249 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 249/264 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60108ms problems are : Problem set: 15 solved, 249 unsolved
Search for dead transitions found 15 dead transitions in 60111ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/227 places, 250/333 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60694 ms. Remains : 174/227 places, 250/333 transitions.
[2025-06-02 17:54:01] [INFO ] Flatten gal took : 23 ms
[2025-06-02 17:54:01] [INFO ] Flatten gal took : 23 ms
[2025-06-02 17:54:01] [INFO ] Input system was already deterministic with 250 transitions.
[2025-06-02 17:54:01] [INFO ] Flatten gal took : 24 ms
[2025-06-02 17:54:01] [INFO ] Flatten gal took : 23 ms
[2025-06-02 17:54:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality11480868144005237431.gal : 8 ms
[2025-06-02 17:54:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality11414902024975880118.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/CTLCardinality11480868144005237431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11414902024975880118.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,1.53629e+06,0.454021,12016,2,2086,5,22361,6,0,947,31286,0


Converting to forward existential form...Done !
original formula: AF(AG(AX(EF((p193==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EX(!(E(TRUE U (p193==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t43, t51, t64, t67, t80, t81, t86, t90, t94, t96, t112, t120, t...302
(forward)formula 0,1,2.59638,57956,1,0,406,244471,526,228,6163,218419,515
FORMULA FireWire-PT-16-CTLCardinality-2025-01 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 : 227/227 places, 333/333 transitions.
Graph (trivial) has 190 edges and 227 vertex of which 15 / 227 are part of one of the 3 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 214 transition count 261
Reduce places removed 59 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 61 rules applied. Total rules applied 121 place count 155 transition count 259
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 123 place count 154 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 153 transition count 258
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 124 place count 153 transition count 253
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 134 place count 148 transition count 253
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 151 place count 131 transition count 227
Iterating global reduction 4 with 17 rules applied. Total rules applied 168 place count 131 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 131 transition count 226
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 169 place count 131 transition count 220
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 181 place count 125 transition count 220
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 187 place count 119 transition count 202
Iterating global reduction 5 with 6 rules applied. Total rules applied 193 place count 119 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 196 place count 119 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 197 place count 118 transition count 199
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 227 place count 103 transition count 184
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 228 place count 102 transition count 182
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 102 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 230 place count 101 transition count 181
Applied a total of 230 rules in 50 ms. Remains 101 /227 variables (removed 126) and now considering 181/333 (removed 152) transitions.
[2025-06-02 17:54:03] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
// Phase 1: matrix 179 rows 101 cols
[2025-06-02 17:54:03] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:54:04] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-02 17:54:04] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
[2025-06-02 17:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:54:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:54:04] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:54:04] [INFO ] Redundant transitions in 13 ms returned []
Running 176 sub problems to find dead transitions.
[2025-06-02 17:54:04] [INFO ] Flow matrix only has 179 transitions (discarded 2 similar events)
[2025-06-02 17:54:04] [INFO ] Invariant cache hit.
[2025-06-02 17:54:04] [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/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:05] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:05] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:06] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:06] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:06] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 11 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:06] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 10 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:06] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 14 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:07] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 15 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 178/278 variables, 100/112 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:11] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/114 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/114 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/115 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/115 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/115 constraints. Problems are: Problem set: 15 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/280 variables, and 115 constraints, problems are : Problem set: 15 solved, 161 unsolved in 19108 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:24] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 178/278 variables, 100/114 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 1/115 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 161/276 constraints. Problems are: Problem set: 15 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:29] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 1/277 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/277 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 1/279 variables, 1/278 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/278 constraints. Problems are: Problem set: 15 solved, 161 unsolved
At refinement iteration 11 (OVERLAPS) 0/279 variables, 0/278 constraints. Problems are: Problem set: 15 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/280 variables, and 278 constraints, problems are : Problem set: 15 solved, 161 unsolved in 29358 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 161/176 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48518ms problems are : Problem set: 15 solved, 161 unsolved
Search for dead transitions found 15 dead transitions in 48519ms
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 : 101/227 places, 166/333 transitions.
Applied a total of 0 rules in 12 ms. Remains 101 /101 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:54:53] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 49060 ms. Remains : 101/227 places, 166/333 transitions.
[2025-06-02 17:54:53] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:54:53] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:54:53] [INFO ] Input system was already deterministic with 166 transitions.
[2025-06-02 17:54:53] [INFO ] Flatten gal took : 30 ms
[2025-06-02 17:54:53] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:54:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8386965423577128481.gal : 5 ms
[2025-06-02 17:54:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7323906759077810854.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/ReachabilityCardinality8386965423577128481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7323906759077810854.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
Loading property file /tmp/ReachabilityCardinality7323906759077810854.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 21
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :21 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 111
RANDOM walk for 40000 steps (3800 resets) in 820 ms. (48 steps per ms) remains 1/1 properties
Invariant property FireWire-PT-16-CTLCardinality-2025-02 does not hold.
FORMULA FireWire-PT-16-CTLCardinality-2025-02 FALSE 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 129 fixpoint passes
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,1737,0.092796,4864,2,428,13,2022,6,0,568,940,0
Total reachable state count : 1737

Verifying 1 reachability properties.
Invariant property FireWire-PT-16-CTLCardinality-2025-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-16-CTLCardinality-2025-02,1,0.093971,5120,2,102,13,2022,7,0,574,940,0
BEST_FIRST walk for 40002 steps (1249 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4823 steps, run visited all 1 properties in 29 ms. (steps per millisecond=166 )
Probabilistic random walk after 4823 steps, saw 1283 distinct states, run finished after 29 ms. (steps per millisecond=166 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Graph (trivial) has 174 edges and 227 vertex of which 19 / 227 are part of one of the 3 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 210 transition count 269
Reduce places removed 46 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 164 transition count 266
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 161 transition count 266
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 99 place count 161 transition count 261
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 109 place count 156 transition count 261
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 125 place count 140 transition count 236
Iterating global reduction 3 with 16 rules applied. Total rules applied 141 place count 140 transition count 236
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 141 place count 140 transition count 232
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 136 transition count 232
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 134 transition count 228
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 134 transition count 228
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 3 with 2 rules applied. Total rules applied 155 place count 134 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 133 transition count 226
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 184 place count 119 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 185 place count 118 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 118 transition count 210
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 188 place count 118 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 117 transition count 209
Applied a total of 189 rules in 81 ms. Remains 117 /227 variables (removed 110) and now considering 209/333 (removed 124) transitions.
[2025-06-02 17:54:53] [INFO ] Flow matrix only has 206 transitions (discarded 3 similar events)
// Phase 1: matrix 206 rows 117 cols
[2025-06-02 17:54:53] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:54:53] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-02 17:54:53] [INFO ] Flow matrix only has 206 transitions (discarded 3 similar events)
[2025-06-02 17:54:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:54:53] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-02 17:54:54] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:54:54] [INFO ] Redundant transitions in 15 ms returned []
Running 204 sub problems to find dead transitions.
[2025-06-02 17:54:54] [INFO ] Flow matrix only has 206 transitions (discarded 3 similar events)
[2025-06-02 17:54:54] [INFO ] Invariant cache hit.
[2025-06-02 17:54:54] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:57] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:57] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:58] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 17 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD91 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:54:58] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 21 ms to minimize.
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:58] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:58] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:59] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 23 ms to minimize.
Problem TDEAD188 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:54:59] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 8/12 constraints. Problems are: Problem set: 16 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:01] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:01] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/14 constraints. Problems are: Problem set: 16 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:02] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/15 constraints. Problems are: Problem set: 16 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:04] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/16 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 205/321 variables, 116/132 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 11/143 constraints. Problems are: Problem set: 16 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:10] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 1/144 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/144 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 12 (OVERLAPS) 1/322 variables, 1/145 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/145 constraints. Problems are: Problem set: 16 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/323 variables, and 145 constraints, problems are : Problem set: 16 solved, 188 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 8/9 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 3/12 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 5/17 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 205/321 variables, 116/133 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 11/144 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 188/332 constraints. Problems are: Problem set: 16 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:55:34] [INFO ] Deduced a trap along path composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 1/333 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/333 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 11 (OVERLAPS) 1/322 variables, 1/334 constraints. Problems are: Problem set: 16 solved, 188 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/334 constraints. Problems are: Problem set: 16 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/323 variables, and 334 constraints, problems are : Problem set: 16 solved, 188 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 188/204 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60070ms problems are : Problem set: 16 solved, 188 unsolved
Search for dead transitions found 16 dead transitions in 60071ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/227 places, 193/333 transitions.
Applied a total of 0 rules in 10 ms. Remains 117 /117 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:55:54] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60760 ms. Remains : 117/227 places, 193/333 transitions.
[2025-06-02 17:55:54] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:55:54] [INFO ] Flatten gal took : 18 ms
[2025-06-02 17:55:54] [INFO ] Input system was already deterministic with 193 transitions.
[2025-06-02 17:55:54] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:55:54] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:55:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13629542921830089633.gal : 2 ms
[2025-06-02 17:55:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13342457786281870484.ctl : 2 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/CTLCardinality13629542921830089633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13342457786281870484.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,132954,0.315335,9584,2,1349,5,16644,6,0,658,22270,0


Converting to forward existential form...Done !
original formula: E((p42==1) U A(((AF((p200!=0)) + !(((p194==0)||(p69==1)))) + E((p95==0) U ((p205==0)||(p233==1)))) U E((EF((p73==1)) * !(((p101==1)&&((p4...234
=> equivalent forward existential formula: [((FwdU(Init,(p42==1)) * !(EG(!(E((E(TRUE U (p73==1)) * !(((p101==1)&&((p40==0)||(p13==1))))) U (!(((p115==0)&&(...580
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t8, t18, t25, t29, t37, t41, t43, t54, t58, t59, t116, t121, t126, t127, t129, t130, ...315
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 190/0/3
(forward)formula 0,1,23.7399,573968,1,0,1551,3.77295e+06,444,907,4835,3.71037e+06,1593
FORMULA FireWire-PT-16-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 193 transition count 290
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 193 transition count 290
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 80 place count 181 transition count 274
Iterating global reduction 0 with 12 rules applied. Total rules applied 92 place count 181 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 181 transition count 273
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 179 transition count 271
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 179 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 178 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 178 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 177 transition count 269
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 177 transition count 269
Applied a total of 101 rules in 13 ms. Remains 177 /227 variables (removed 50) and now considering 269/333 (removed 64) transitions.
// Phase 1: matrix 269 rows 177 cols
[2025-06-02 17:56:18] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:56:18] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-06-02 17:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:56:18] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-02 17:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:24] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:25] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:25] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:25] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 44 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:26] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 37 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:27] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:27] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/11 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 269/446 variables, 177/188 constraints. Problems are: Problem set: 15 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:35] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:35] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 2/190 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/190 constraints. Problems are: Problem set: 15 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/446 variables, and 190 constraints, problems are : Problem set: 15 solved, 253 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 253 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:52] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:56:52] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 2/15 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 269/446 variables, 177/192 constraints. Problems are: Problem set: 15 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 253/445 constraints. Problems are: Problem set: 15 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:00] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:00] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 2/447 constraints. Problems are: Problem set: 15 solved, 253 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:13] [INFO ] Deduced a trap along path composed of 12 places in 48 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 448 constraints, problems are : Problem set: 15 solved, 253 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 253/268 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60086ms problems are : Problem set: 15 solved, 253 unsolved
Search for dead transitions found 15 dead transitions in 60088ms
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 : 177/227 places, 254/333 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60656 ms. Remains : 177/227 places, 254/333 transitions.
[2025-06-02 17:57:18] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:57:18] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:57:19] [INFO ] Input system was already deterministic with 254 transitions.
[2025-06-02 17:57:19] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:57:19] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:57:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10970508073542776309.gal : 5 ms
[2025-06-02 17:57:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality10060179483778955407.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/CTLCardinality10970508073542776309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10060179483778955407.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,1.86638e+06,0.544461,12840,2,2510,5,23878,6,0,963,34765,0


Converting to forward existential form...Done !
original formula: (AF(((p198==0)||(p20==1))) * EX(AX(AG((((p9==0)&&(p112==1))||(p54==0))))))
=> equivalent forward existential formula: ([FwdG(Init,!(((p198==0)||(p20==1))))] = FALSE * [(Init * !(EX(!(EX(!(!(E(TRUE U !((((p9==0)&&(p112==1))||(p54==...177
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t31, t32, t37, t41, t43, t51, t64, t67, t80, t87, t91, t95, t97, t113, t1...307
(forward)formula 0,0,6.51146,157844,1,0,438,918743,529,244,6293,705821,547
FORMULA FireWire-PT-16-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 192 transition count 289
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 192 transition count 289
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 83 place count 179 transition count 272
Iterating global reduction 0 with 13 rules applied. Total rules applied 96 place count 179 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 179 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 178 transition count 269
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 178 transition count 269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 177 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 177 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 176 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 176 transition count 267
Applied a total of 104 rules in 11 ms. Remains 176 /227 variables (removed 51) and now considering 267/333 (removed 66) transitions.
// Phase 1: matrix 267 rows 176 cols
[2025-06-02 17:57: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:57:25] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-06-02 17:57:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:57:26] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-02 17:57:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:32] [INFO ] Deduced a trap composed of 74 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:57:32] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:32] [INFO ] Deduced a trap composed of 52 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:57:32] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 41 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:34] [INFO ] Deduced a trap composed of 57 places in 209 ms of which 34 ms to minimize.
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:35] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:35] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 2/11 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:38] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/12 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 267/443 variables, 176/188 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:48] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:48] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:49] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:49] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 4/192 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:57:51] [INFO ] Deduced a trap composed of 82 places in 182 ms of which 25 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 1/193 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/443 variables, and 193 constraints, problems are : Problem set: 15 solved, 251 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 13/17 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 267/443 variables, 176/193 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 251/444 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:03] [INFO ] Deduced a trap composed of 46 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:58:04] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:05] [INFO ] Deduced a trap composed of 77 places in 167 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 3/447 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:17] [INFO ] Deduced a trap along path composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 1/448 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 448 constraints, problems are : Problem set: 15 solved, 251 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 251/266 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60075ms problems are : Problem set: 15 solved, 251 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 : 176/227 places, 252/333 transitions.
Applied a total of 0 rules in 3 ms. Remains 176 /176 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60632 ms. Remains : 176/227 places, 252/333 transitions.
[2025-06-02 17:58:26] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:58:26] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:58:26] [INFO ] Input system was already deterministic with 252 transitions.
[2025-06-02 17:58:26] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:58:26] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:58:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality10051751285013282750.gal : 2 ms
[2025-06-02 17:58:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8449725889058267036.ctl : 3 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/CTLCardinality10051751285013282750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8449725889058267036.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,1.6082e+06,0.374925,11916,2,2251,5,23456,6,0,957,34696,0


Converting to forward existential form...Done !
original formula: EX(E((((p20==0)||(p9==1))||((p215==0)||(p179==1))) U ((AX((p10==1)) * EG((p124==1))) * (AF((p90==1)) + EF((p59==0))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),(((p20==0)||(p9==1))||((p215==0)||(p179==1)))) * (!(EX(!((p10==1)))) * EG((p124==1)))) * !(EG(...319
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t59, t63, t66, t79, t84, t88, t92, t94, t100, t112, t...308
(forward)formula 0,0,17.1645,425792,1,0,911,2.77692e+06,534,460,6055,2.61181e+06,1092
FORMULA FireWire-PT-16-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Graph (trivial) has 191 edges and 227 vertex of which 19 / 227 are part of one of the 3 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 210 transition count 258
Reduce places removed 57 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 59 rules applied. Total rules applied 117 place count 153 transition count 256
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 119 place count 152 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 151 transition count 255
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 120 place count 151 transition count 250
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 130 place count 146 transition count 250
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 148 place count 128 transition count 223
Iterating global reduction 4 with 18 rules applied. Total rules applied 166 place count 128 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 128 transition count 222
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 167 place count 128 transition count 216
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 179 place count 122 transition count 216
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 185 place count 116 transition count 198
Iterating global reduction 5 with 6 rules applied. Total rules applied 191 place count 116 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 116 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 195 place count 115 transition count 195
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 225 place count 100 transition count 180
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 226 place count 99 transition count 178
Iterating global reduction 7 with 1 rules applied. Total rules applied 227 place count 99 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 228 place count 98 transition count 177
Applied a total of 228 rules in 44 ms. Remains 98 /227 variables (removed 129) and now considering 177/333 (removed 156) transitions.
[2025-06-02 17:58:43] [INFO ] Flow matrix only has 174 transitions (discarded 3 similar events)
// Phase 1: matrix 174 rows 98 cols
[2025-06-02 17:58:43] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:58:43] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 17:58:43] [INFO ] Flow matrix only has 174 transitions (discarded 3 similar events)
[2025-06-02 17:58:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:58:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-02 17:58:44] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:58:44] [INFO ] Redundant transitions in 2 ms returned []
Running 172 sub problems to find dead transitions.
[2025-06-02 17:58:44] [INFO ] Flow matrix only has 174 transitions (discarded 3 similar events)
[2025-06-02 17:58:44] [INFO ] Invariant cache hit.
[2025-06-02 17:58:44] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:45] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:45] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:45] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:45] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 9 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:46] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 15 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:46] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 19 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:47] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/11 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 173/270 variables, 97/108 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 11/119 constraints. Problems are: Problem set: 15 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:58:50] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/120 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/120 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/121 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/121 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/121 constraints. Problems are: Problem set: 15 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/272 variables, and 121 constraints, problems are : Problem set: 15 solved, 157 unsolved in 19246 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:04] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 173/270 variables, 97/110 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 11/121 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 157/278 constraints. Problems are: Problem set: 15 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:07] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/279 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/279 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 1/271 variables, 1/280 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/280 constraints. Problems are: Problem set: 15 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/280 constraints. Problems are: Problem set: 15 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/272 variables, and 280 constraints, problems are : Problem set: 15 solved, 157 unsolved in 28599 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 98/98 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 157/172 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47871ms problems are : Problem set: 15 solved, 157 unsolved
Search for dead transitions found 15 dead transitions in 47873ms
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 : 98/227 places, 162/333 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:59:31] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 48304 ms. Remains : 98/227 places, 162/333 transitions.
[2025-06-02 17:59:32] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:59:32] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:59:32] [INFO ] Input system was already deterministic with 162 transitions.
[2025-06-02 17:59:32] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:59:32] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:59:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality4106170808252044826.gal : 3 ms
[2025-06-02 17:59:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality8556778884778919919.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/CTLCardinality4106170808252044826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8556778884778919919.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,74575,0.222839,7132,2,925,5,8898,6,0,552,12516,0


Converting to forward existential form...Done !
original formula: EF(EG((p142==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p142==1))] != FALSE
Hit Full ! (commute/partial/dont) 156/0/6
(forward)formula 0,1,0.511318,10972,1,0,8,33145,19,2,2916,15166,8
FORMULA FireWire-PT-16-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 195 transition count 292
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 195 transition count 292
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 183 transition count 276
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 183 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 183 transition count 275
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 181 transition count 273
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 181 transition count 273
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 180 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 180 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 179 transition count 271
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 179 transition count 271
Applied a total of 97 rules in 17 ms. Remains 179 /227 variables (removed 48) and now considering 271/333 (removed 62) transitions.
// Phase 1: matrix 271 rows 179 cols
[2025-06-02 17:59:32] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:59:32] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-06-02 17:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:59:33] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-02 17:59:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:38] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:39] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:39] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:39] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:40] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:40] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 43 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:41] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 35 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:41] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 27 ms to minimize.
Problem TDEAD252 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:42] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:46] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:46] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/15 constraints. Problems are: Problem set: 15 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/15 constraints. Problems are: Problem set: 15 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 271/450 variables, 179/194 constraints. Problems are: Problem set: 15 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:59:56] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 36 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 1/195 constraints. Problems are: Problem set: 15 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:00] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 20 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 1/196 constraints. Problems are: Problem set: 15 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 196 constraints, problems are : Problem set: 15 solved, 255 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 255 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 13/17 constraints. Problems are: Problem set: 15 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 271/450 variables, 179/196 constraints. Problems are: Problem set: 15 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 255/451 constraints. Problems are: Problem set: 15 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:11] [INFO ] Deduced a trap composed of 78 places in 180 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 1/452 constraints. Problems are: Problem set: 15 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:00:24] [INFO ] Deduced a trap along path composed of 11 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 1/453 constraints. Problems are: Problem set: 15 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 453 constraints, problems are : Problem set: 15 solved, 255 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 255/270 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60075ms problems are : Problem set: 15 solved, 255 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 : 179/227 places, 256/333 transitions.
Applied a total of 0 rules in 2 ms. Remains 179 /179 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60751 ms. Remains : 179/227 places, 256/333 transitions.
[2025-06-02 18:00:33] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:00:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:00:33] [INFO ] Input system was already deterministic with 256 transitions.
[2025-06-02 18:00:33] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:00:33] [INFO ] Flatten gal took : 14 ms
[2025-06-02 18:00:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality1157457939219282035.gal : 3 ms
[2025-06-02 18:00:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7536427524386094459.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/CTLCardinality1157457939219282035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7536427524386094459.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,1.81879e+06,0.447978,13508,2,2717,5,25526,6,0,973,38443,0


Converting to forward existential form...Done !
original formula: EF(EX((AF(AG(((p156==0)||(p51==1)))) * ((((p40==0)&&(p222==0)) * (EF((p8==1)) + ((p43==0)&&(p24==1)))) + (EG(((p197==0)||(p186==1))) * EG...171
=> equivalent forward existential formula: (([(FwdU(((EY(FwdU(Init,TRUE)) * !(EG(!(!(E(TRUE U !(((p156==0)||(p51==1))))))))) * ((p40==0)&&(p222==0))),TRUE)...446
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t43, t46, t48, t52, t65, t68, t81, t86, t91, t94, t96, t11...324
Detected timeout of ITS tools.
[2025-06-02 18:01:03] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:01:03] [INFO ] Applying decomposition
[2025-06-02 18:01:03] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph688895652548023351.txt' '-o' '/tmp/graph688895652548023351.bin' '-w' '/tmp/graph688895652548023351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph688895652548023351.bin' '-l' '-1' '-v' '-w' '/tmp/graph688895652548023351.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:01:03] [INFO ] Decomposing Gal with order
[2025-06-02 18:01:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:01:03] [INFO ] Removed a total of 160 redundant transitions.
[2025-06-02 18:01:03] [INFO ] Flatten gal took : 115 ms
[2025-06-02 18:01:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 19 ms.
[2025-06-02 18:01:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality16801404051246010804.gal : 13 ms
[2025-06-02 18:01:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality4167363461144582721.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/CTLCardinality16801404051246010804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4167363461144582721.ctl'

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 -...263
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,1.81879e+06,1.22779,28276,388,244,19615,39535,627,36355,160,185587,0


Converting to forward existential form...Done !
original formula: EF(EX((AF(AG(((i7.u36.p156==0)||(i3.i0.u10.p51==1)))) * ((((i2.u7.p40==0)&&(i10.i1.u51.p222==0)) * (EF((i1.i0.u5.p8==1)) + ((i3.i0.u8.p43...256
=> equivalent forward existential formula: (([(FwdU(((EY(FwdU(Init,TRUE)) * !(EG(!(!(E(TRUE U !(((i7.u36.p156==0)||(i3.i0.u10.p51==1))))))))) * ((i2.u7.p40...582
Reverse transition relation is NOT exact ! Due to transitions t43, t114, t131, t156, t245, t249, t252, i0.u22.t86, i1.t130, i1.i0.u5.t145, i2.t124, i2.t120...485
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,4.82226,96628,1,0,139203,47509,4115,261486,972,185587,277482
FORMULA FireWire-PT-16-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Graph (trivial) has 181 edges and 227 vertex of which 9 / 227 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 219 transition count 269
Reduce places removed 56 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 58 rules applied. Total rules applied 115 place count 163 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 162 transition count 267
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 116 place count 162 transition count 263
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 158 transition count 263
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 139 place count 143 transition count 239
Iterating global reduction 3 with 15 rules applied. Total rules applied 154 place count 143 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 155 place count 143 transition count 238
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 155 place count 143 transition count 232
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 167 place count 137 transition count 232
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 172 place count 132 transition count 215
Iterating global reduction 4 with 5 rules applied. Total rules applied 177 place count 132 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 132 transition count 214
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 212 place count 115 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 114 transition count 196
Applied a total of 213 rules in 33 ms. Remains 114 /227 variables (removed 113) and now considering 196/333 (removed 137) transitions.
[2025-06-02 18:01:08] [INFO ] Flow matrix only has 195 transitions (discarded 1 similar events)
// Phase 1: matrix 195 rows 114 cols
[2025-06-02 18:01:08] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:01:08] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 18:01:08] [INFO ] Flow matrix only has 195 transitions (discarded 1 similar events)
[2025-06-02 18:01:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 18:01:09] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:01:09] [INFO ] Redundant transitions in 2 ms returned []
Running 192 sub problems to find dead transitions.
[2025-06-02 18:01:09] [INFO ] Flow matrix only has 195 transitions (discarded 1 similar events)
[2025-06-02 18:01:09] [INFO ] Invariant cache hit.
[2025-06-02 18:01:09] [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/113 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:10] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:10] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:11] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:11] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:11] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:11] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 16 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:12] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 22 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:12] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 23 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 194/307 variables, 113/125 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 1/126 constraints. Problems are: Problem set: 15 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:16] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 1/127 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 1/308 variables, 1/128 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/128 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/128 constraints. Problems are: Problem set: 15 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/309 variables, and 128 constraints, problems are : Problem set: 15 solved, 177 unsolved in 21462 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 9/13 constraints. Problems are: Problem set: 15 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:01:31] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/14 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 194/307 variables, 113/127 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 1/128 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 177/305 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/305 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 1/308 variables, 1/306 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/306 constraints. Problems are: Problem set: 15 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/308 variables, 0/306 constraints. Problems are: Problem set: 15 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/309 variables, and 306 constraints, problems are : Problem set: 15 solved, 177 unsolved in 26218 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 177/192 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47728ms problems are : Problem set: 15 solved, 177 unsolved
Search for dead transitions found 15 dead transitions in 47730ms
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 : 114/227 places, 181/333 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:01:57] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 48245 ms. Remains : 114/227 places, 181/333 transitions.
[2025-06-02 18:01:57] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:01:57] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:01:57] [INFO ] Input system was already deterministic with 181 transitions.
[2025-06-02 18:01:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:01:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:01:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13967580971416488513.gal : 3 ms
[2025-06-02 18:01:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality16285433253105919526.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/CTLCardinality13967580971416488513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16285433253105919526.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,162759,0.234777,7492,2,1093,5,11281,6,0,636,14113,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF((p217==0)) + AF(((p252==0)&&(p65==1)))) + (((p189==0)&&(p207==1))||((p157==0)&&(p87==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!((p217==0)))) + !(EG(!(((p252==0)&&(p65==1)))))) + (((p189==0)&&(p207==1))||((p1...185
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t14, t19, t24, t25, t37, t46, t50, t62, t63, t102, t107, t111, t112, t114, t154, ...291
(forward)formula 0,0,5.01561,117392,1,0,623,699674,393,306,4346,703725,730
FORMULA FireWire-PT-16-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 190 transition count 287
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 190 transition count 287
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 88 place count 176 transition count 269
Iterating global reduction 0 with 14 rules applied. Total rules applied 102 place count 176 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 104 place count 176 transition count 267
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 174 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 174 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 173 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 173 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 172 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 172 transition count 263
Applied a total of 112 rules in 10 ms. Remains 172 /227 variables (removed 55) and now considering 263/333 (removed 70) transitions.
// Phase 1: matrix 263 rows 172 cols
[2025-06-02 18:02:02] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:02:02] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-02 18:02:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:02:02] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-02 18:02:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:08] [INFO ] Deduced a trap composed of 73 places in 168 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:08] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:08] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:09] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:09] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 12 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:10] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 27 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:10] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 33 ms to minimize.
Problem TDEAD245 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:11] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:11] [INFO ] Deduced a trap composed of 82 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 18:02:12] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 35 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/186 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:19] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:20] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 2/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/188 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/435 variables, and 188 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:35] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 263/435 variables, 172/189 constraints. Problems are: Problem set: 15 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 247/436 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:46] [INFO ] Deduced a trap along path composed of 11 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 1/437 constraints. Problems are: Problem set: 15 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:02:59] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 37 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/435 variables, and 438 constraints, problems are : Problem set: 15 solved, 247 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 247/262 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60079ms problems are : Problem set: 15 solved, 247 unsolved
Search for dead transitions found 15 dead transitions in 60081ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 172/227 places, 248/333 transitions.
Applied a total of 0 rules in 3 ms. Remains 172 /172 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60599 ms. Remains : 172/227 places, 248/333 transitions.
[2025-06-02 18:03:02] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:03:02] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:03:02] [INFO ] Input system was already deterministic with 248 transitions.
[2025-06-02 18:03:02] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:03:02] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:03:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality229301637115971482.gal : 3 ms
[2025-06-02 18:03:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6696072206100373566.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/CTLCardinality229301637115971482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6696072206100373566.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 -...282
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,1.5349e+06,0.452861,11848,2,2040,5,21898,6,0,937,30031,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.479004,11848,1,0,6,21898,7,1,1226,30031,1
FORMULA FireWire-PT-16-CTLCardinality-2025-09 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 : 227/227 places, 333/333 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 192 transition count 289
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 192 transition count 289
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 83 place count 179 transition count 272
Iterating global reduction 0 with 13 rules applied. Total rules applied 96 place count 179 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 179 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 177 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 177 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 176 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 176 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 175 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 175 transition count 266
Applied a total of 106 rules in 15 ms. Remains 175 /227 variables (removed 52) and now considering 266/333 (removed 67) transitions.
// Phase 1: matrix 266 rows 175 cols
[2025-06-02 18:03:03] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:03:03] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-02 18:03:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:03:03] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-06-02 18:03:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:09] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:09] [INFO ] Deduced a trap composed of 75 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 18:03:10] [INFO ] Deduced a trap composed of 78 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 18:03:10] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 13 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:11] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 28 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:12] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 15 ms to minimize.
Problem TDEAD248 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:12] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:13] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/12 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 266/441 variables, 175/187 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:21] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:21] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:22] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 3/190 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 0/190 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/441 variables, and 190 constraints, problems are : Problem set: 15 solved, 250 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:36] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:36] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/17 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 266/441 variables, 175/192 constraints. Problems are: Problem set: 15 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 250/442 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:44] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:45] [INFO ] Deduced a trap composed of 76 places in 206 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:46] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 3/445 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:03:51] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 1/446 constraints. Problems are: Problem set: 15 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 446 constraints, problems are : Problem set: 15 solved, 250 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 250/265 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 15 solved, 250 unsolved
Search for dead transitions found 15 dead transitions in 60093ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/227 places, 251/333 transitions.
Applied a total of 0 rules in 9 ms. Remains 175 /175 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60721 ms. Remains : 175/227 places, 251/333 transitions.
[2025-06-02 18:04:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:04:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:04:04] [INFO ] Input system was already deterministic with 251 transitions.
[2025-06-02 18:04:04] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:04:04] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:04:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality14491286594850640948.gal : 3 ms
[2025-06-02 18:04:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality16378927139034507523.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/CTLCardinality14491286594850640948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16378927139034507523.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,1.62182e+06,0.522098,12796,2,2251,5,23076,6,0,952,35534,0


Converting to forward existential form...Done !
original formula: (EX(EF(((p106==0)&&(p144==1)))) + EG((p55==1)))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * ((p106==0)&&(p144==1)))] != FALSE + [FwdG(Init,(p55==1))] != FALSE)
(forward)formula 0,1,0.719169,13308,1,0,9,23558,9,1,1904,35774,4
FORMULA FireWire-PT-16-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Graph (trivial) has 190 edges and 227 vertex of which 19 / 227 are part of one of the 3 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 210 transition count 259
Reduce places removed 56 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 58 rules applied. Total rules applied 115 place count 154 transition count 257
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 117 place count 153 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 152 transition count 256
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 118 place count 152 transition count 251
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 128 place count 147 transition count 251
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 144 place count 131 transition count 226
Iterating global reduction 4 with 16 rules applied. Total rules applied 160 place count 131 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 131 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 161 place count 131 transition count 221
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 169 place count 127 transition count 221
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 175 place count 121 transition count 203
Iterating global reduction 5 with 6 rules applied. Total rules applied 181 place count 121 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 184 place count 121 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 185 place count 120 transition count 200
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 219 place count 103 transition count 183
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 220 place count 102 transition count 181
Iterating global reduction 7 with 1 rules applied. Total rules applied 221 place count 102 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 222 place count 101 transition count 180
Applied a total of 222 rules in 38 ms. Remains 101 /227 variables (removed 126) and now considering 180/333 (removed 153) transitions.
[2025-06-02 18:04:04] [INFO ] Flow matrix only has 177 transitions (discarded 3 similar events)
// Phase 1: matrix 177 rows 101 cols
[2025-06-02 18:04:04] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:04:05] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-02 18:04:05] [INFO ] Flow matrix only has 177 transitions (discarded 3 similar events)
[2025-06-02 18:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:04:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-02 18:04:05] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:04:05] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2025-06-02 18:04:05] [INFO ] Flow matrix only has 177 transitions (discarded 3 similar events)
[2025-06-02 18:04:05] [INFO ] Invariant cache hit.
[2025-06-02 18:04:05] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:06] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:06] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:07] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 17 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:07] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 17 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:07] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 11 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:07] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:08] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 176/276 variables, 100/111 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 11/122 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 1/277 variables, 1/123 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/123 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/123 constraints. Problems are: Problem set: 15 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/278 variables, and 123 constraints, problems are : Problem set: 15 solved, 160 unsolved in 16643 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 176/276 variables, 100/111 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 11/122 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 160/282 constraints. Problems are: Problem set: 15 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:25] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:27] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/284 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/284 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 1/277 variables, 1/285 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/285 constraints. Problems are: Problem set: 15 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 0/277 variables, 0/285 constraints. Problems are: Problem set: 15 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/278 variables, and 285 constraints, problems are : Problem set: 15 solved, 160 unsolved in 26593 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 160/175 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43290ms problems are : Problem set: 15 solved, 160 unsolved
Search for dead transitions found 15 dead transitions in 43292ms
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 : 101/227 places, 165/333 transitions.
Applied a total of 0 rules in 6 ms. Remains 101 /101 variables (removed 0) and now considering 165/165 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:04:48] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 43885 ms. Remains : 101/227 places, 165/333 transitions.
[2025-06-02 18:04:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:04:48] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:04:48] [INFO ] Input system was already deterministic with 165 transitions.
[2025-06-02 18:04:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:04:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:04:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17443258139165071129.gal : 1 ms
[2025-06-02 18:04:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality9477188035622167811.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/CTLCardinality17443258139165071129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9477188035622167811.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,82792,0.133764,7172,2,1020,5,8765,6,0,567,12613,0


Converting to forward existential form...Done !
original formula: EF(AG(((p30!=0)&&(p90!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p30!=0)&&(p90!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t14, t16, t27, t35, t37, t41, t44, t45, t88, t96, t97, t105, t106, t108, t139, t140, ...279
(forward)formula 0,0,0.649507,20976,1,0,292,82052,348,148,3941,67029,339
FORMULA FireWire-PT-16-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 191 transition count 288
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 191 transition count 288
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 85 place count 178 transition count 273
Iterating global reduction 0 with 13 rules applied. Total rules applied 98 place count 178 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 178 transition count 271
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 176 transition count 269
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 176 transition count 269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 175 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 175 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 174 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 174 transition count 267
Applied a total of 108 rules in 9 ms. Remains 174 /227 variables (removed 53) and now considering 267/333 (removed 66) transitions.
// Phase 1: matrix 267 rows 174 cols
[2025-06-02 18:04:49] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:04:49] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 18:04:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:04:49] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-02 18:04:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:54] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:55] [INFO ] Deduced a trap composed of 82 places in 182 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:55] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:55] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:56] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:56] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 12 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:57] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 16 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:57] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 33 ms to minimize.
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 8/12 constraints. Problems are: Problem set: 18 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:04:58] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/13 constraints. Problems are: Problem set: 18 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:02] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/14 constraints. Problems are: Problem set: 18 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:05] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:05] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 34 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 2/16 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/16 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 267/441 variables, 174/190 constraints. Problems are: Problem set: 18 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:12] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:14] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:14] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 30 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 3/193 constraints. Problems are: Problem set: 18 solved, 248 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 1.0)
(t14 1.0)
(t15 1.0)
(t16 1.0)
(t17 1.0)
(t18 2.0)
(t19 2.0)
(t20 0.0)
(t21 1.0)
(t22 1.0)
(t23 1.0)
(t24 1.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 1.0)
(t31 0.0)
(t32 1.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 1.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 1.0)
(t63 1.0)
(t64 0.0)
(t65 0.0)
(t66 1.0)
(t67 0.0)
(t68 0.0)
(t69 1.0)
(t70 1.0)
(t71 0.0)
(t72 1.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/441 variables, and 193 constraints, problems are : Problem set: 18 solved, 248 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 15/19 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 267/441 variables, 174/193 constraints. Problems are: Problem set: 18 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 248/441 constraints. Problems are: Problem set: 18 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:33] [INFO ] Deduced a trap along path composed of 11 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 1/442 constraints. Problems are: Problem set: 18 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:44] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 33 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 1/443 constraints. Problems are: Problem set: 18 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 443 constraints, problems are : Problem set: 18 solved, 248 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 248/266 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60085ms problems are : Problem set: 18 solved, 248 unsolved
Search for dead transitions found 18 dead transitions in 60086ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/227 places, 249/333 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60569 ms. Remains : 174/227 places, 249/333 transitions.
[2025-06-02 18:05:50] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:05:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:05:50] [INFO ] Input system was already deterministic with 249 transitions.
[2025-06-02 18:05:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:05:50] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:05:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality4695175241497638487.gal : 6 ms
[2025-06-02 18:05:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11766563009493130174.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/CTLCardinality4695175241497638487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11766563009493130174.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,1.64772e+06,0.46796,11872,2,2420,5,22086,6,0,946,31327,0


Converting to forward existential form...Done !
original formula: (AG((p98==0)) + AX(AX(((!(A((p103==1) U ((p203==0)||(p215==1)))) * (p50==0)) * (p149==1)))))
=> equivalent forward existential formula: (([((EY(EY((Init * !(!(E(TRUE U !((p98==0)))))))) * !(EG(!(((p203==0)||(p215==1)))))) * !(E(!(((p203==0)||(p215=...366
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t38, t42, t43, t51, t64, t67, t80, t89, t93, t95, t111, t119, t124, ...297
(forward)formula 0,0,7.14383,166196,1,0,465,1.00482e+06,521,264,6162,647081,608
FORMULA FireWire-PT-16-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Graph (trivial) has 183 edges and 227 vertex of which 9 / 227 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 219 transition count 267
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 161 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 160 transition count 266
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 119 place count 160 transition count 261
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 155 transition count 261
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 144 place count 140 transition count 237
Iterating global reduction 3 with 15 rules applied. Total rules applied 159 place count 140 transition count 237
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 159 place count 140 transition count 231
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 171 place count 134 transition count 231
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 128 transition count 213
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 128 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 128 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 127 transition count 210
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 217 place count 112 transition count 195
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 218 place count 111 transition count 193
Iterating global reduction 5 with 1 rules applied. Total rules applied 219 place count 111 transition count 193
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 111 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 110 transition count 192
Applied a total of 221 rules in 33 ms. Remains 110 /227 variables (removed 117) and now considering 192/333 (removed 141) transitions.
[2025-06-02 18:05:57] [INFO ] Flow matrix only has 191 transitions (discarded 1 similar events)
// Phase 1: matrix 191 rows 110 cols
[2025-06-02 18:05:57] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:05:57] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 18:05:57] [INFO ] Flow matrix only has 191 transitions (discarded 1 similar events)
[2025-06-02 18:05:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:05:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 18:05:57] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:05:57] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2025-06-02 18:05:57] [INFO ] Flow matrix only has 191 transitions (discarded 1 similar events)
[2025-06-02 18:05:57] [INFO ] Invariant cache hit.
[2025-06-02 18:05:57] [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/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:59] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:59] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:59] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:59] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:05:59] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 20 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:00] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 10 ms to minimize.
Problem TDEAD84 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:00] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 12 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:00] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 190/299 variables, 109/121 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 1/122 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/122 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 1/300 variables, 1/123 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/123 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/123 constraints. Problems are: Problem set: 15 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/301 variables, and 123 constraints, problems are : Problem set: 15 solved, 171 unsolved in 18593 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 190/299 variables, 109/121 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 1/122 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 171/293 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/293 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/300 variables, 1/294 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/294 constraints. Problems are: Problem set: 15 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/294 constraints. Problems are: Problem set: 15 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/301 variables, and 294 constraints, problems are : Problem set: 15 solved, 171 unsolved in 23887 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/186 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42521ms problems are : Problem set: 15 solved, 171 unsolved
Search for dead transitions found 15 dead transitions in 42523ms
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 : 110/227 places, 177/333 transitions.
Applied a total of 0 rules in 3 ms. Remains 110 /110 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:06:40] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 42949 ms. Remains : 110/227 places, 177/333 transitions.
[2025-06-02 18:06:40] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:06:40] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:06:40] [INFO ] Input system was already deterministic with 177 transitions.
[2025-06-02 18:06:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:06:40] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:06:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality15618298864182036977.gal : 2 ms
[2025-06-02 18:06:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality18069413452686688760.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/CTLCardinality15618298864182036977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18069413452686688760.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,142005,0.223824,8708,2,1047,5,14187,6,0,616,18117,0


Converting to forward existential form...Done !
original formula: (AF((p222==1)) + AG(!(E(((EF(((p41==0)||(p143==1))) * AG((p245==1))) * AG(((p65==0)||(p134==1)))) U EG(AG((p217==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU((Init * !(!(EG(!((p222==1)))))),TRUE),((E(TRUE U ((p41==0)||(p143==1))) * !(E(TRUE U !((p245==1)...237
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t11, t19, t27, t32, t40, t42, t55, t56, t96, t97, t99, t105, t108, t109, t115, t153, ...291
(forward)formula 0,1,4.61674,120760,1,0,514,716785,395,257,4544,643153,616
FORMULA FireWire-PT-16-CTLCardinality-2024-13 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 : 227/227 places, 333/333 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 192 transition count 289
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 192 transition count 289
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 83 place count 179 transition count 273
Iterating global reduction 0 with 13 rules applied. Total rules applied 96 place count 179 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 179 transition count 271
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 177 transition count 269
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 177 transition count 269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 176 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 176 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 175 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 175 transition count 267
Applied a total of 106 rules in 14 ms. Remains 175 /227 variables (removed 52) and now considering 267/333 (removed 66) transitions.
// Phase 1: matrix 267 rows 175 cols
[2025-06-02 18:06:45] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:06:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-02 18:06:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:06:45] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2025-06-02 18:06:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:51] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:51] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:51] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:51] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:52] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:52] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:52] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 13 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:53] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 22 ms to minimize.
Problem TDEAD249 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:54] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:06:55] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 51 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/14 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 267/442 variables, 175/189 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:02] [INFO ] Deduced a trap composed of 60 places in 207 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:03] [INFO ] Deduced a trap composed of 94 places in 168 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 2/191 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/191 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/442 variables, and 191 constraints, problems are : Problem set: 15 solved, 251 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 267/442 variables, 175/191 constraints. Problems are: Problem set: 15 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 251/442 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:24] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:24] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 30 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 2/444 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:07:35] [INFO ] Deduced a trap along path composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 1/445 constraints. Problems are: Problem set: 15 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/442 variables, and 445 constraints, problems are : Problem set: 15 solved, 251 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 251/266 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60075ms problems are : Problem set: 15 solved, 251 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 : 175/227 places, 252/333 transitions.
Applied a total of 0 rules in 2 ms. Remains 175 /175 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60625 ms. Remains : 175/227 places, 252/333 transitions.
[2025-06-02 18:07:45] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:07:45] [INFO ] Flatten gal took : 9 ms
[2025-06-02 18:07:45] [INFO ] Input system was already deterministic with 252 transitions.
[2025-06-02 18:07:45] [INFO ] Flatten gal took : 11 ms
[2025-06-02 18:07:45] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:07:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17275643336894726424.gal : 2 ms
[2025-06-02 18:07:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality1847621210669950848.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/CTLCardinality17275643336894726424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1847621210669950848.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,1.59867e+06,0.45794,11652,2,2127,5,21514,6,0,953,29521,0


Converting to forward existential form...Done !
original formula: E(AX(FALSE) U E(EF(AG((p44==0))) U (AG(!(AG((p215==1)))) * ((p161==0)||(p187==1)))))
=> equivalent forward existential formula: [((FwdU(FwdU(Init,!(EX(!(FALSE)))),E(TRUE U !(E(TRUE U !((p44==0)))))) * ((p161==0)||(p187==1))) * !(E(TRUE U !(...197
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t36, t37, t42, t50, t52, t53, t66, t69, t82, t87, t91, t95, t97, t11...312
(forward)formula 0,1,12.1878,289944,1,0,583,1.80324e+06,533,321,6436,1.23648e+06,737
FORMULA FireWire-PT-16-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 333/333 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 196 transition count 302
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 196 transition count 302
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 186 transition count 288
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 186 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 184 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 184 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 183 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 183 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 182 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 182 transition count 284
Applied a total of 90 rules in 13 ms. Remains 182 /227 variables (removed 45) and now considering 284/333 (removed 49) transitions.
// Phase 1: matrix 284 rows 182 cols
[2025-06-02 18:07:58] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:58] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-06-02 18:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:07:58] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2025-06-02 18:07:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:04] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:05] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:05] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 24 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:06] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 24 ms to minimize.
Problem TDEAD265 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 4/8 constraints. Problems are: Problem set: 15 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:07] [INFO ] Deduced a trap composed of 85 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:07] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:07] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:08] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 39 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 4/12 constraints. Problems are: Problem set: 15 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:12] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/13 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 284/466 variables, 182/195 constraints. Problems are: Problem set: 15 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:22] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:23] [INFO ] Deduced a trap composed of 94 places in 203 ms of which 35 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 2/197 constraints. Problems are: Problem set: 15 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:27] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 198 constraints, problems are : Problem set: 15 solved, 268 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:31] [INFO ] Deduced a trap composed of 85 places in 181 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/17 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/17 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 284/466 variables, 182/199 constraints. Problems are: Problem set: 15 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 268/467 constraints. Problems are: Problem set: 15 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:41] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 1/468 constraints. Problems are: Problem set: 15 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:08:53] [INFO ] Deduced a trap along path composed of 10 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 469 constraints, problems are : Problem set: 15 solved, 268 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 268/283 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60083ms problems are : Problem set: 15 solved, 268 unsolved
Search for dead transitions found 15 dead transitions in 60084ms
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 : 182/227 places, 269/333 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 269/269 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60655 ms. Remains : 182/227 places, 269/333 transitions.
[2025-06-02 18:08:58] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:08:58] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:08:58] [INFO ] Input system was already deterministic with 269 transitions.
[2025-06-02 18:08:58] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:08:58] [INFO ] Flatten gal took : 10 ms
[2025-06-02 18:08:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality419198729270164547.gal : 3 ms
[2025-06-02 18:08:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8824854709411266517.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/CTLCardinality419198729270164547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8824854709411266517.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 -...282
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,1.87003e+06,0.533155,13308,2,2314,5,25324,6,0,998,35997,0


Converting to forward existential form...Done !
original formula: (AG((((p187==0) * !(A((((p132==0)||(p91==1))&&(p40==1)) U (((p151==0)||(p182==1))&&(p229==1))))) + EF(AX((p121==1))))) + AG(((A(AX((p160=...268
=> equivalent forward existential formula: ([(((FwdU((Init * !(!(E(TRUE U !((((p187==0) * !(!((E(!((((p151==0)||(p182==1))&&(p229==1))) U (!((((p132==0)||(...1026
Reverse transition relation is NOT exact ! Due to transitions t18, t21, t22, t26, t28, t30, t35, t40, t45, t48, t51, t55, t68, t71, t84, t90, t94, t98, t10...318
Detected timeout of ITS tools.
[2025-06-02 18:09:28] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:09:28] [INFO ] Applying decomposition
[2025-06-02 18:09:28] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13924314282227088883.txt' '-o' '/tmp/graph13924314282227088883.bin' '-w' '/tmp/graph13924314282227088883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13924314282227088883.bin' '-l' '-1' '-v' '-w' '/tmp/graph13924314282227088883.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:09:28] [INFO ] Decomposing Gal with order
[2025-06-02 18:09:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:09:28] [INFO ] Removed a total of 197 redundant transitions.
[2025-06-02 18:09:28] [INFO ] Flatten gal took : 25 ms
[2025-06-02 18:09:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 10 ms.
[2025-06-02 18:09:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality8397855427518612227.gal : 5 ms
[2025-06-02 18:09:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality519051443258783969.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/CTLCardinality8397855427518612227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality519051443258783969.ctl'

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 -...261
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,1.87003e+06,0.199292,9296,460,156,8896,1413,653,17343,152,4956,0


Converting to forward existential form...Done !
original formula: (AG((((i6.u41.p187==0) * !(A((((i5.u30.p132==0)||(i0.i1.u21.p91==1))&&(i2.i1.u10.p40==1)) U (((i4.u34.p151==0)||(i0.i0.u16.p182==1))&&(i9...413
=> equivalent forward existential formula: ([(((FwdU((Init * !(!(E(TRUE U !((((i6.u41.p187==0) * !(!((E(!((((i4.u34.p151==0)||(i0.i0.u16.p182==1))&&(i9.i0....1494
Reverse transition relation is NOT exact ! Due to transitions t45, t51, t134, t149, t159, t257, t265, i0.i1.u20.t90, i1.t133, i2.t127, i2.i1.t123, i3.i1.u1...467
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,8.01118,183632,1,0,267325,4592,4220,800128,786,15553,476817
FORMULA FireWire-PT-16-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 18:09:37] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:09:37] [INFO ] Flatten gal took : 7 ms
Total runtime 1140775 ms.

BK_STOP 1748887777113

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-16"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-16, examination is CTLCardinality"
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-174860102400361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-16.tgz
mv FireWire-PT-16 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;