Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 97K 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-07-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-07-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-07-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748851609086

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 08:06:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 08:06:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:06:52] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2025-06-02 08:06:52] [INFO ] Transformed 126 places.
[2025-06-02 08:06:52] [INFO ] Transformed 396 transitions.
[2025-06-02 08:06:52] [INFO ] Found NUPN structural information;
[2025-06-02 08:06:52] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 75 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 123 transition count 336
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 123 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 123 transition count 329
Applied a total of 13 rules in 76 ms. Remains 123 /126 variables (removed 3) and now considering 329/343 (removed 14) transitions.
[2025-06-02 08:06:52] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
// Phase 1: matrix 303 rows 123 cols
[2025-06-02 08:06:52] [INFO ] Computed 8 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:06:52] [INFO ] Implicit Places using invariants in 527 ms returned []
[2025-06-02 08:06:52] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2025-06-02 08:06:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:06:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 08:06:53] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-02 08:06:53] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2025-06-02 08:06:53] [INFO ] Invariant cache hit.
[2025-06-02 08:06:53] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:59] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:06:59] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:00] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:00] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:00] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:00] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:01] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/425 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 43/181 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 1/426 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 182 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/425 variables, 123/138 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 43/181 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 328/509 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 509 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60674ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60709ms
Starting structural reductions in LTL mode, iteration 1 : 123/126 places, 329/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62049 ms. Remains : 123/126 places, 329/343 transitions.
Support contains 75 out of 123 places after structural reductions.
[2025-06-02 08:07:54] [INFO ] Flatten gal took : 112 ms
[2025-06-02 08:07:54] [INFO ] Flatten gal took : 59 ms
[2025-06-02 08:07:54] [INFO ] Input system was already deterministic with 329 transitions.
Support contains 72 out of 123 places (down from 75) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 66 to 65
RANDOM walk for 40000 steps (2256 resets) in 3151 ms. (12 steps per ms) remains 33/65 properties
BEST_FIRST walk for 4003 steps (59 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (63 resets) in 56 ms. (70 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (57 resets) in 54 ms. (72 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (53 resets) in 65 ms. (60 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4003 steps (70 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (52 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (59 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (32 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (9 resets) in 23 ms. (166 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4001 steps (147 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (99 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (101 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (102 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (15 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (65 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (102 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (61 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (60 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (149 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (60 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (68 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (55 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (151 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (41 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
[2025-06-02 08:07:56] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2025-06-02 08:07:56] [INFO ] Invariant cache hit.
[2025-06-02 08:07:56] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 1 (OVERLAPS) 70/114 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:56] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 7/121 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:57] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:57] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 4 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:57] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 302/423 variables, 121/133 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 43/176 constraints. Problems are: Problem set: 4 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:07:58] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 24 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/177 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/177 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 2/425 variables, 2/179 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/179 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 1/426 variables, 1/180 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/180 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/180 constraints. Problems are: Problem set: 4 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 180 constraints, problems are : Problem set: 4 solved, 26 unsolved in 4171 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 26 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 77/114 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 7/121 variables, 2/10 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 3/13 constraints. Problems are: Problem set: 6 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:01] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/14 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 302/423 variables, 121/135 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 43/178 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 23/201 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/201 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 2/425 variables, 2/203 constraints. Problems are: Problem set: 6 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 1/204 constraints. Problems are: Problem set: 6 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/426 variables, and 204 constraints, problems are : Problem set: 6 solved, 24 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 24/30 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9230ms problems are : Problem set: 6 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 329/329 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 122 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 122 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 122 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 121 transition count 322
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 119 transition count 326
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 119 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 119 transition count 320
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 119 transition count 322
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 22 place count 118 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 118 transition count 318
Applied a total of 24 rules in 114 ms. Remains 118 /123 variables (removed 5) and now considering 318/329 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 118/123 places, 318/329 transitions.
RANDOM walk for 40000 steps (2174 resets) in 836 ms. (47 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (68 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (55 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (49 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (11 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (154 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (112 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (103 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (107 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (60 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (107 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (60 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (69 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (149 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (48 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (48 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (149 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (65 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 734511 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :21 out of 23
Probabilistic random walk after 734511 steps, saw 162381 distinct states, run finished after 3010 ms. (steps per millisecond=244 ) properties seen :21
[2025-06-02 08:08:09] [INFO ] Flow matrix only has 291 transitions (discarded 27 similar events)
// Phase 1: matrix 291 rows 118 cols
[2025-06-02 08:08:09] [INFO ] Computed 8 invariants in 5 ms
[2025-06-02 08:08:09] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/116 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:09] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:09] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 291/407 variables, 116/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/409 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/409 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/116 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 291/407 variables, 116/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 45/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/409 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/409 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1175ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 570 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 318/318 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 311
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 114 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 114 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 113 transition count 310
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 113 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 113 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 112 transition count 306
Applied a total of 15 rules in 80 ms. Remains 112 /118 variables (removed 6) and now considering 306/318 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 112/118 places, 306/318 transitions.
RANDOM walk for 40000 steps (2248 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (529 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (64 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 706274 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 2
Probabilistic random walk after 706274 steps, saw 158027 distinct states, run finished after 3009 ms. (steps per millisecond=234 ) properties seen :0
[2025-06-02 08:08:14] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
// Phase 1: matrix 277 rows 112 cols
[2025-06-02 08:08:14] [INFO ] Computed 8 invariants in 3 ms
[2025-06-02 08:08:14] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/389 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 163 constraints, problems are : Problem set: 0 solved, 2 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 225/288 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 92/380 variables, 42/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/389 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/389 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/389 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1131ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 428 ms.
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 15 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 112/112 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 306/306 transitions.
Applied a total of 0 rules in 19 ms. Remains 112 /112 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2025-06-02 08:08:15] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2025-06-02 08:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:08:15] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-02 08:08:15] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2025-06-02 08:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:08:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 08:08:16] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:08:16] [INFO ] Redundant transitions in 33 ms returned []
Running 304 sub problems to find dead transitions.
[2025-06-02 08:08:16] [INFO ] Flow matrix only has 277 transitions (discarded 29 similar events)
[2025-06-02 08:08:16] [INFO ] Invariant cache hit.
[2025-06-02 08:08:16] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:18] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:18] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:19] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:19] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:19] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:20] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:20] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/126 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/169 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:30] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:08:30] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 389/389 variables, and 172 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (OVERLAPS) 277/388 variables, 111/128 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 304/475 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/389 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 476 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60987 ms. Remains : 112/112 places, 306/306 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 112 vertex of which 29 / 112 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 86 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 86 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 85 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 85 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 84 transition count 173
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 84 transition count 168
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 81 transition count 167
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 81 transition count 167
Applied a total of 20 rules in 42 ms. Remains 81 /112 variables (removed 31) and now considering 167/306 (removed 139) transitions.
Running SMT prover for 2 properties.
[2025-06-02 08:09:16] [INFO ] Flow matrix only has 165 transitions (discarded 2 similar events)
// Phase 1: matrix 165 rows 81 cols
[2025-06-02 08:09:16] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 08:09:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 08:09:16] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 08:09:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 08:09:17] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:17] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:17] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 4 ms to minimize.
[2025-06-02 08:09:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
TRAPS : Iteration 1
[2025-06-02 08:09:17] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 08:09:17] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 729 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-07-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 08:09:17] [INFO ] Flatten gal took : 41 ms
[2025-06-02 08:09:17] [INFO ] Flatten gal took : 42 ms
[2025-06-02 08:09:17] [INFO ] Input system was already deterministic with 329 transitions.
Support contains 60 out of 123 places (down from 63) after GAL structural reductions.
Computed a total of 21 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 287
Applied a total of 36 rules in 31 ms. Remains 106 /123 variables (removed 17) and now considering 287/329 (removed 42) transitions.
[2025-06-02 08:09:17] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2025-06-02 08:09:17] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:09:17] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 08:09:17] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:09:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:09:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:09:18] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-02 08:09:18] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:09:18] [INFO ] Invariant cache hit.
[2025-06-02 08:09:18] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:22] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:22] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:22] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:22] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:22] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:09:23] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 22162 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
SMT process timed out in 52275ms, After SMT, problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 52278ms
Starting structural reductions in LTL mode, iteration 1 : 106/123 places, 287/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52778 ms. Remains : 106/123 places, 287/329 transitions.
[2025-06-02 08:10:10] [INFO ] Flatten gal took : 33 ms
[2025-06-02 08:10:10] [INFO ] Flatten gal took : 32 ms
[2025-06-02 08:10:10] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-02 08:10:10] [INFO ] Flatten gal took : 22 ms
[2025-06-02 08:10:10] [INFO ] Flatten gal took : 17 ms
[2025-06-02 08:10:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16286013214172208601.gal : 11 ms
[2025-06-02 08:10:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9086860964419103347.ctl : 6 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/CTLFireability16286013214172208601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9086860964419103347.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,6.23367e+06,7.30321,169348,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(((p8==1)&&(p108==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((p8==1)&&(p108==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...612
Detected timeout of ITS tools.
[2025-06-02 08:10:40] [INFO ] Flatten gal took : 16 ms
[2025-06-02 08:10:40] [INFO ] Applying decomposition
[2025-06-02 08:10:40] [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/graph10405513874996844505.txt' '-o' '/tmp/graph10405513874996844505.bin' '-w' '/tmp/graph10405513874996844505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10405513874996844505.bin' '-l' '-1' '-v' '-w' '/tmp/graph10405513874996844505.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:10:41] [INFO ] Decomposing Gal with order
[2025-06-02 08:10:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:10:41] [INFO ] Removed a total of 444 redundant transitions.
[2025-06-02 08:10:41] [INFO ] Flatten gal took : 89 ms
[2025-06-02 08:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 23 ms.
[2025-06-02 08:10:41] [INFO ] Time to serialize gal into /tmp/CTLFireability17182890288198372779.gal : 7 ms
[2025-06-02 08:10:41] [INFO ] Time to serialize properties into /tmp/CTLFireability6953978626775153824.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/CTLFireability17182890288198372779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6953978626775153824.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,6.23367e+06,3.27292,78592,1226,75,121717,732,582,362180,74,3036,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(((i2.u2.p8==1)&&(i5.i1.u36.p108==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((i2.u2.p8==1)&&(i5.i1.u36.p108==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t91, t92, t93, t94, t99, t140, t14...768
(forward)formula 0,0,11.145,203264,1,0,309915,1474,3322,1.01956e+06,306,5409,758618
FORMULA FireWire-PT-07-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 105 transition count 286
Applied a total of 38 rules in 56 ms. Remains 105 /123 variables (removed 18) and now considering 286/329 (removed 43) transitions.
[2025-06-02 08:10:52] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
// Phase 1: matrix 260 rows 105 cols
[2025-06-02 08:10:52] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:10:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 08:10:52] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2025-06-02 08:10:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:10:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:10:52] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:10:52] [INFO ] Redundant transitions in 8 ms returned []
Running 285 sub problems to find dead transitions.
[2025-06-02 08:10:52] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2025-06-02 08:10:52] [INFO ] Invariant cache hit.
[2025-06-02 08:10:52] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:56] [INFO ] Deduced a trap composed of 36 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 08:10:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:56] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:56] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:56] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:10:57] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 259/364 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 37/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 157 constraints, problems are : Problem set: 0 solved, 285 unsolved in 22505 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 259/364 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 37/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 285/441 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 442 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52652ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 52654ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/123 places, 286/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53145 ms. Remains : 105/123 places, 286/329 transitions.
[2025-06-02 08:11:45] [INFO ] Flatten gal took : 29 ms
[2025-06-02 08:11:45] [INFO ] Flatten gal took : 26 ms
[2025-06-02 08:11:45] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-02 08:11:45] [INFO ] Flatten gal took : 20 ms
[2025-06-02 08:11:45] [INFO ] Flatten gal took : 20 ms
[2025-06-02 08:11:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17639245660487790171.gal : 4 ms
[2025-06-02 08:11:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4370334753590673347.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/CTLFireability17639245660487790171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4370334753590673347.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,5.1877e+06,5.89828,127660,2,6114,5,346804,6,0,705,458356,0


Converting to forward existential form...Done !
original formula: AG(EF(((p106==1) * (EF(((p8==0)||(p125==0))) + (((p3==1)&&(p40==1))&&(((p37==0)||(p8==0))||(p101==0)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p106==1) * (E(TRUE U ((p8==0)||(p125==0))) + (((p3==1)&&(p40==1))&&(((p37==0)||...190
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...606
Detected timeout of ITS tools.
[2025-06-02 08:12:15] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:12:15] [INFO ] Applying decomposition
[2025-06-02 08:12:15] [INFO ] Flatten gal took : 14 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/graph17079794778148569305.txt' '-o' '/tmp/graph17079794778148569305.bin' '-w' '/tmp/graph17079794778148569305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17079794778148569305.bin' '-l' '-1' '-v' '-w' '/tmp/graph17079794778148569305.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:12:15] [INFO ] Decomposing Gal with order
[2025-06-02 08:12:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:12:15] [INFO ] Removed a total of 436 redundant transitions.
[2025-06-02 08:12:15] [INFO ] Flatten gal took : 34 ms
[2025-06-02 08:12:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 12 ms.
[2025-06-02 08:12:16] [INFO ] Time to serialize gal into /tmp/CTLFireability2203207537271986887.gal : 4 ms
[2025-06-02 08:12:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13827410371377546165.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/CTLFireability2203207537271986887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13827410371377546165.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,5.1877e+06,5.68104,123676,1539,199,166613,2437,597,667956,85,17713,0


Converting to forward existential form...Done !
original formula: AG(EF(((i6.u35.p106==1) * (EF(((i3.u2.p8==0)||(i6.u37.p125==0))) + (((i0.u0.p3==1)&&(i1.i0.u13.p40==1))&&(((i1.i0.u12.p37==0)||(i3.u2.p8=...183
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((i6.u35.p106==1) * (E(TRUE U ((i3.u2.p8==0)||(i6.u37.p125==0))) + (((i0.u0.p3==1...249
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...781
(forward)formula 0,0,12.0878,189776,1,0,276349,6065,2745,995594,357,38442,547422
FORMULA FireWire-PT-07-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 118 transition count 316
Applied a total of 12 rules in 5 ms. Remains 118 /123 variables (removed 5) and now considering 316/329 (removed 13) transitions.
[2025-06-02 08:12:28] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 118 cols
[2025-06-02 08:12:28] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:12:28] [INFO ] Implicit Places using invariants in 209 ms returned []
[2025-06-02 08:12:28] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 08:12:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:12:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 08:12:28] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2025-06-02 08:12:28] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 08:12:28] [INFO ] Invariant cache hit.
[2025-06-02 08:12:28] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:33] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:33] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:34] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:34] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:34] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:34] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:12:35] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 35 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 42/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/408 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/408 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 176 constraints, problems are : Problem set: 0 solved, 315 unsolved in 28949 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/407 variables, 118/133 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 42/175 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 315/490 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 315 unsolved
SMT process timed out in 59072ms, After SMT, problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 59075ms
Starting structural reductions in LTL mode, iteration 1 : 118/123 places, 316/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59787 ms. Remains : 118/123 places, 316/329 transitions.
[2025-06-02 08:13:27] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:13:27] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:13:28] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-02 08:13:28] [INFO ] Flatten gal took : 13 ms
[2025-06-02 08:13:28] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:13:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9005105938465590311.gal : 3 ms
[2025-06-02 08:13:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1309004440257691345.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/CTLFireability9005105938465590311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1309004440257691345.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,6.68364e+06,0.6618,19988,2,2362,5,60474,6,0,787,52804,0


Converting to forward existential form...Done !
original formula: (EF((((p3==1)&&(p41==1))||((p13!=1)&&((p3!=1)||(p76!=1))))) * AG(AX(EF(((p3==0)||(p41==0))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((p3==1)&&(p41==1))||((p13!=1)&&((p3!=1)||(p76!=1)))))))] = FALSE * [(EY(FwdU(Init,TRUE)) ...200
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...684
(forward)formula 0,1,3.01175,72488,1,0,584,341411,651,295,6525,298772,653
FORMULA FireWire-PT-07-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 311
Applied a total of 16 rules in 4 ms. Remains 116 /123 variables (removed 7) and now considering 311/329 (removed 18) transitions.
[2025-06-02 08:13:31] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
// Phase 1: matrix 285 rows 116 cols
[2025-06-02 08:13:31] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:13:31] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 08:13:31] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2025-06-02 08:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:13:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 08:13:31] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2025-06-02 08:13:31] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2025-06-02 08:13:31] [INFO ] Invariant cache hit.
[2025-06-02 08:13:31] [INFO ] State equation strengthened by 42 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, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:35] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:35] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:36] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:36] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:36] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:36] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:13:37] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 173 constraints, problems are : Problem set: 0 solved, 310 unsolved in 27259 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 310/482 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/401 variables, and 482 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57444ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 57446ms
Starting structural reductions in LTL mode, iteration 1 : 116/123 places, 311/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57955 ms. Remains : 116/123 places, 311/329 transitions.
[2025-06-02 08:14:29] [INFO ] Flatten gal took : 17 ms
[2025-06-02 08:14:29] [INFO ] Flatten gal took : 16 ms
[2025-06-02 08:14:29] [INFO ] Input system was already deterministic with 311 transitions.
[2025-06-02 08:14:29] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:14:29] [INFO ] Flatten gal took : 12 ms
[2025-06-02 08:14:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4200173035118092665.gal : 3 ms
[2025-06-02 08:14:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1275138071277057547.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/CTLFireability4200173035118092665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1275138071277057547.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,6.3314e+06,1.03839,22096,2,2174,5,64765,6,0,774,60984,0


Converting to forward existential form...Done !
original formula: E((((AX(((p8==1)&&(p100==1))) + AF(!(((p61==1)&&(p70==1))))) + ((p2!=1) + ((AX(!(((p5==1)&&(p35==1)))) * (p8==1)) * (p109==1)))) + ((EX((...259
=> equivalent forward existential formula: [(FwdU(Init,(((!(EX(!(((p8==1)&&(p100==1))))) + !(EG(!(!(((p61==1)&&(p70==1))))))) + ((p2!=1) + ((!(EX(!(!(((p5=...341
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...672
Detected timeout of ITS tools.
[2025-06-02 08:14:59] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:14:59] [INFO ] Applying decomposition
[2025-06-02 08:14:59] [INFO ] Flatten gal took : 11 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/graph10556204432928477492.txt' '-o' '/tmp/graph10556204432928477492.bin' '-w' '/tmp/graph10556204432928477492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10556204432928477492.bin' '-l' '-1' '-v' '-w' '/tmp/graph10556204432928477492.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:14:59] [INFO ] Decomposing Gal with order
[2025-06-02 08:14:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:14:59] [INFO ] Removed a total of 486 redundant transitions.
[2025-06-02 08:14:59] [INFO ] Flatten gal took : 44 ms
[2025-06-02 08:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 13 ms.
[2025-06-02 08:14:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14789785352116936857.gal : 4 ms
[2025-06-02 08:14:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14554535783989641225.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/CTLFireability14789785352116936857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14554535783989641225.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 -...264
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,6.3314e+06,6.42551,147428,2079,122,223493,1125,661,653838,82,6612,0


Converting to forward existential form...Done !
original formula: E((((AX(((i2.u3.p8==1)&&(i6.i1.u35.p100==1))) + AF(!(((i5.u23.p61==1)&&(i5.u22.p70==1))))) + ((i0.u0.p2!=1) + ((AX(!(((i1.i0.u2.p5==1)&&(...396
=> equivalent forward existential formula: [(FwdU(Init,(((!(EX(!(((i2.u3.p8==1)&&(i6.i1.u35.p100==1))))) + !(EG(!(!(((i5.u23.p61==1)&&(i5.u22.p70==1)))))))...478
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t73, t74, t79, t91, t92, t93, t94, t97, t99, t140...842
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 a local SCC at level 1
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 105 transition count 286
Applied a total of 38 rules in 57 ms. Remains 105 /123 variables (removed 18) and now considering 286/329 (removed 43) transitions.
[2025-06-02 08:15:29] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
// Phase 1: matrix 260 rows 105 cols
[2025-06-02 08:15:29] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:15:29] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 08:15:29] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2025-06-02 08:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:15:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:15:29] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:15:29] [INFO ] Redundant transitions in 4 ms returned []
Running 285 sub problems to find dead transitions.
[2025-06-02 08:15:29] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2025-06-02 08:15:29] [INFO ] Invariant cache hit.
[2025-06-02 08:15:29] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:34] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:34] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:34] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:34] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:34] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:15:35] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 259/364 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 37/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 157 constraints, problems are : Problem set: 0 solved, 285 unsolved in 21602 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (OVERLAPS) 259/364 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 37/156 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 285/441 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 442 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51700ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 51707ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/123 places, 286/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52171 ms. Remains : 105/123 places, 286/329 transitions.
[2025-06-02 08:16:21] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:16:21] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:16:21] [INFO ] Input system was already deterministic with 286 transitions.
[2025-06-02 08:16:21] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:16:21] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:16:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13128437009404426416.gal : 3 ms
[2025-06-02 08:16:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4749419861799520025.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/CTLFireability13128437009404426416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4749419861799520025.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,5.1877e+06,7.1204,127144,2,6114,5,346804,6,0,705,458356,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(!(A(((p38==1)&&(p49==1)) U ((p9==1)&&(p86==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(!(!((E(!(((p9==1)&&(p86==1))) U (!(((p38==1)&&(p49==1))) * !(((p9==1)&&(p86==1)...206
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...606
Detected timeout of ITS tools.
[2025-06-02 08:16:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:16:51] [INFO ] Applying decomposition
[2025-06-02 08:16:51] [INFO ] Flatten gal took : 9 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/graph16730455393254955117.txt' '-o' '/tmp/graph16730455393254955117.bin' '-w' '/tmp/graph16730455393254955117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16730455393254955117.bin' '-l' '-1' '-v' '-w' '/tmp/graph16730455393254955117.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:16:51] [INFO ] Decomposing Gal with order
[2025-06-02 08:16:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:16:51] [INFO ] Removed a total of 436 redundant transitions.
[2025-06-02 08:16:51] [INFO ] Flatten gal took : 33 ms
[2025-06-02 08:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 13 ms.
[2025-06-02 08:16:51] [INFO ] Time to serialize gal into /tmp/CTLFireability14153595372452398238.gal : 4 ms
[2025-06-02 08:16:51] [INFO ] Time to serialize properties into /tmp/CTLFireability15727715453198307809.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/CTLFireability14153595372452398238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15727715453198307809.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 -...264
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,5.1877e+06,11.9225,285484,2633,202,310756,2830,560,2.21174e+06,85,29366,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(!(A(((i3.u12.p38==1)&&(i3.u16.p49==1)) U ((i2.u3.p9==1)&&(i2.u28.p86==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(!(!((E(!(((i2.u3.p9==1)&&(i2.u28.p86==1))) U (!(((i3.u12.p38==1)&&(i3.u16.p49==...259
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...784
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 117 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 290
Applied a total of 33 rules in 14 ms. Remains 107 /123 variables (removed 16) and now considering 290/329 (removed 39) transitions.
[2025-06-02 08:17:22] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 107 cols
[2025-06-02 08:17:22] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:17:22] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 08:17:22] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2025-06-02 08:17:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:17:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:17:22] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2025-06-02 08:17:22] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2025-06-02 08:17:22] [INFO ] Invariant cache hit.
[2025-06-02 08:17:22] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:26] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:26] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:27] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:27] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:27] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:17:28] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/370 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/371 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/371 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 159 constraints, problems are : Problem set: 0 solved, 289 unsolved in 22757 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/370 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 289/447 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 289 unsolved
SMT process timed out in 52853ms, After SMT, problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 52854ms
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 290/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53308 ms. Remains : 107/123 places, 290/329 transitions.
[2025-06-02 08:18:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:18:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:18:15] [INFO ] Input system was already deterministic with 290 transitions.
[2025-06-02 08:18:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:18:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:18:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11765007979333583592.gal : 3 ms
[2025-06-02 08:18:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11881616848312153204.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/CTLFireability11765007979333583592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11881616848312153204.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,6.3644e+06,7.50423,166940,2,6164,5,456807,6,0,717,576001,0


Converting to forward existential form...Done !
original formula: AG(((AX(((p6==0)||(p55==0))) + (p5==0)) + (p95==0)))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * !((p95==0))) * !((p5==0)))) * !(((p6==0)||(p55==0))))] = FALSE
(forward)formula 0,1,7.5324,166940,1,0,14,456807,13,6,1186,576001,4
FORMULA FireWire-PT-07-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 320
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 318
Applied a total of 10 rules in 3 ms. Remains 119 /123 variables (removed 4) and now considering 318/329 (removed 11) transitions.
[2025-06-02 08:18:23] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
// Phase 1: matrix 292 rows 119 cols
[2025-06-02 08:18:23] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:18:23] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 08:18:23] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2025-06-02 08:18:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:18:23] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 08:18:23] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2025-06-02 08:18:23] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2025-06-02 08:18:23] [INFO ] Invariant cache hit.
[2025-06-02 08:18:23] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:28] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:28] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:28] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:28] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:29] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:29] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:18:30] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 291/410 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 1/411 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 177 constraints, problems are : Problem set: 0 solved, 317 unsolved in 25598 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 291/410 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 317/493 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/411 variables, and 493 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55713ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 55714ms
Starting structural reductions in LTL mode, iteration 1 : 119/123 places, 318/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56135 ms. Remains : 119/123 places, 318/329 transitions.
[2025-06-02 08:19:19] [INFO ] Flatten gal took : 14 ms
[2025-06-02 08:19:19] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:19:19] [INFO ] Input system was already deterministic with 318 transitions.
[2025-06-02 08:19:19] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:19:19] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:19:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6483206919152173240.gal : 4 ms
[2025-06-02 08:19:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1793199141194107515.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/CTLFireability6483206919152173240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1793199141194107515.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,6.52164e+06,1.17076,25384,2,2361,5,75528,6,0,793,62520,0


Converting to forward existential form...Done !
original formula: ((AF((E(((p8==1)&&(p107==1)) U (p54==1)) * ((((p10==1)&&(p121==1))||((p3==1)&&(p74==1)))||(((p38==1)&&(p49==1))||((p10==1)&&(p42==1))))))...291
=> equivalent forward existential formula: [(FwdU((Init * !((!(EG(!((E(((p8==1)&&(p107==1)) U (p54==1)) * ((((p10==1)&&(p121==1))||((p3==1)&&(p74==1)))||((...372
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...684
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 08:19:49] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:19:49] [INFO ] Applying decomposition
[2025-06-02 08:19:49] [INFO ] Flatten gal took : 9 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/graph14702413821670024493.txt' '-o' '/tmp/graph14702413821670024493.bin' '-w' '/tmp/graph14702413821670024493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14702413821670024493.bin' '-l' '-1' '-v' '-w' '/tmp/graph14702413821670024493.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:19:49] [INFO ] Decomposing Gal with order
[2025-06-02 08:19:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:19:49] [INFO ] Removed a total of 479 redundant transitions.
[2025-06-02 08:19:49] [INFO ] Flatten gal took : 39 ms
[2025-06-02 08:19:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 5 ms.
[2025-06-02 08:19:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14686585138072564009.gal : 3 ms
[2025-06-02 08:19:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2673873470768398715.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/CTLFireability14686585138072564009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2673873470768398715.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,6.52164e+06,2.56762,70112,1728,244,100893,2316,604,361464,106,19126,0


Converting to forward existential form...Done !
original formula: ((AF((E(((i1.u2.p8==1)&&(i7.i0.u33.p107==1)) U (i3.u19.p54==1)) * ((((i0.u3.p10==1)&&(i0.u3.p121==1))||((i6.u0.p3==1)&&(i6.u0.p74==1)))||...431
=> equivalent forward existential formula: [(FwdU((Init * !((!(EG(!((E(((i1.u2.p8==1)&&(i7.i0.u33.p107==1)) U (i3.u19.p54==1)) * ((((i0.u3.p10==1)&&(i0.u3....512
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t64, t69, t74, t79, t83, t91, t92, t93, t94, t97, t99, t140...872
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
(forward)formula 0,0,16.153,338908,1,0,501912,6515,3817,1.74953e+06,562,45506,1094348
FORMULA FireWire-PT-07-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 115 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 105 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 104 transition count 285
Applied a total of 38 rules in 38 ms. Remains 104 /123 variables (removed 19) and now considering 285/329 (removed 44) transitions.
[2025-06-02 08:20:05] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 104 cols
[2025-06-02 08:20:05] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:05] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 08:20:05] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 08:20:06] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:20:06] [INFO ] Redundant transitions in 4 ms returned []
Running 282 sub problems to find dead transitions.
[2025-06-02 08:20:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:20:06] [INFO ] Invariant cache hit.
[2025-06-02 08:20:06] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:08] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:08] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:08] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:08] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:08] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:09] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:09] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:10] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 18 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:45] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:20:49] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/363 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/123 places, 285/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60645 ms. Remains : 104/123 places, 285/329 transitions.
[2025-06-02 08:21:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:21:06] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:21:06] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 08:21:06] [INFO ] Flatten gal took : 32 ms
[2025-06-02 08:21:06] [INFO ] Flatten gal took : 19 ms
[2025-06-02 08:21:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10922451213010059790.gal : 2 ms
[2025-06-02 08:21:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14157165374898064477.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/ReachabilityCardinality10922451213010059790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14157165374898064477.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (2279 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (23 resets) in 51 ms. (769 steps per ms) remains 1/1 properties

Finished probabilistic random walk after 290 steps, run visited all 1 properties in 8 ms. (steps per millisecond=36 )
Probabilistic random walk after 290 steps, saw 224 distinct states, run finished after 15 ms. (steps per millisecond=19 ) properties seen :1
FORMULA FireWire-PT-07-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 115 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 105 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 104 transition count 285
Applied a total of 38 rules in 40 ms. Remains 104 /123 variables (removed 19) and now considering 285/329 (removed 44) transitions.
[2025-06-02 08:21:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:21:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:21:06] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-02 08:21:06] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:21:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:21:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 08:21:07] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:21:07] [INFO ] Redundant transitions in 2 ms returned []
Running 282 sub problems to find dead transitions.
[2025-06-02 08:21:07] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:21:07] [INFO ] Invariant cache hit.
[2025-06-02 08:21:07] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:08] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:09] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:09] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:09] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:09] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:09] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:10] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:10] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 26801 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:41] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:21:45] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/363 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56924ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 56926ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/123 places, 285/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57477 ms. Remains : 104/123 places, 285/329 transitions.
[2025-06-02 08:22:04] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:22:04] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:22:04] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 08:22:04] [INFO ] Flatten gal took : 61 ms
[2025-06-02 08:22:04] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:22:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3001912699349436820.gal : 2 ms
RANDOM walk for 40000 steps (2364 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
[2025-06-02 08:22:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4747715284428869620.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3001912699349436820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4747715284428869620.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
BEST_FIRST walk for 40003 steps (1078 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2362 steps, run visited all 1 properties in 10 ms. (steps per millisecond=236 )
Probabilistic random walk after 2362 steps, saw 1260 distinct states, run finished after 10 ms. (steps per millisecond=236 ) properties seen :1
FORMULA FireWire-PT-07-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 108 transition count 292
Applied a total of 32 rules in 23 ms. Remains 108 /123 variables (removed 15) and now considering 292/329 (removed 37) transitions.
[2025-06-02 08:22:04] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
// Phase 1: matrix 266 rows 108 cols
[2025-06-02 08:22:04] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:22:04] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-02 08:22:04] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2025-06-02 08:22:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:22:04] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:22:04] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:22:04] [INFO ] Redundant transitions in 2 ms returned []
Running 291 sub problems to find dead transitions.
[2025-06-02 08:22:04] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2025-06-02 08:22:04] [INFO ] Invariant cache hit.
[2025-06-02 08:22:04] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:08] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:09] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:09] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:09] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:10] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:22:10] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/373 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/374 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/374 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 161 constraints, problems are : Problem set: 0 solved, 291 unsolved in 23464 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/373 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 291/451 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 1/374 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 452 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53568ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 53569ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/123 places, 292/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54074 ms. Remains : 108/123 places, 292/329 transitions.
[2025-06-02 08:22:58] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:22:58] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:22:58] [INFO ] Input system was already deterministic with 292 transitions.
[2025-06-02 08:22:58] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:22:58] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:22:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13047870352227246433.gal : 2 ms
[2025-06-02 08:22:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7629636430046621408.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/CTLFireability13047870352227246433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7629636430046621408.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,5.21655e+06,6.95387,151896,2,7008,5,426750,6,0,723,545138,0


Converting to forward existential form...Done !
original formula: AG(!(E(((AF(((p8==1)&&(p55==1))) * AG(((p10==1)&&(p89==1)))) + (((!((p8==1)&&(p125==1)))||(((p8==1)&&(p107==1))&&((p8==1)&&(p51==1)))) * ...211
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,TRUE),((!(EG(!(((p8==1)&&(p55==1))))) * !(E(TRUE U !(((p10==1)&&(p89==1)))))) + (((!((p8==1...288
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...619
Hit Full ! (commute/partial/dont) 282/9/10
(forward)formula 0,0,11.6383,167968,1,0,526,706648,622,268,6455,659313,604
FORMULA FireWire-PT-07-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 119 transition count 319
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 305
Applied a total of 20 rules in 5 ms. Remains 114 /123 variables (removed 9) and now considering 305/329 (removed 24) transitions.
[2025-06-02 08:23:10] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
// Phase 1: matrix 279 rows 114 cols
[2025-06-02 08:23:10] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:23:10] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 08:23:10] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2025-06-02 08:23:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:23:10] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 08:23:10] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2025-06-02 08:23:10] [INFO ] Flow matrix only has 279 transitions (discarded 26 similar events)
[2025-06-02 08:23:10] [INFO ] Invariant cache hit.
[2025-06-02 08:23:10] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:15] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:15] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:15] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:15] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:15] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:16] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:17] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/392 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/393 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 169 constraints, problems are : Problem set: 0 solved, 304 unsolved in 26315 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 278/392 variables, 114/129 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 304/472 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:23:52] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 304 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 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(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 1)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(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 1)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/393 variables, and 473 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 114/114 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56446ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 56448ms
Starting structural reductions in LTL mode, iteration 1 : 114/123 places, 305/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56841 ms. Remains : 114/123 places, 305/329 transitions.
[2025-06-02 08:24:06] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:24:06] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:24:06] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-02 08:24:06] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:24:07] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:24:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10789259156203197571.gal : 2 ms
[2025-06-02 08:24:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1752824032355680857.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/CTLFireability10789259156203197571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1752824032355680857.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,6.47117e+06,2.53036,50488,2,2550,5,180318,6,0,760,155515,0


Converting to forward existential form...Done !
original formula: (E(AF((AX(((p8==1)&&(p97==1))) * E(EG(((p9==1)&&(p80==1))) U AX(((p9==1)&&(p122==1)))))) U !(EF((EF(((p10==1)&&(p100==1))) + ((p10==1)&&(...564
=> equivalent forward existential formula: ([(FwdU((Init * E(!(EG(!((!(EX(!(((p8==1)&&(p97==1))))) * E(EG(((p9==1)&&(p80==1))) U !(EX(!(((p9==1)&&(p122==1)...1938
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...649
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 08:24:37] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:24:37] [INFO ] Applying decomposition
[2025-06-02 08:24:37] [INFO ] Flatten gal took : 14 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/graph10696217264947604508.txt' '-o' '/tmp/graph10696217264947604508.bin' '-w' '/tmp/graph10696217264947604508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10696217264947604508.bin' '-l' '-1' '-v' '-w' '/tmp/graph10696217264947604508.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:24:37] [INFO ] Decomposing Gal with order
[2025-06-02 08:24:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:24:37] [INFO ] Removed a total of 472 redundant transitions.
[2025-06-02 08:24:37] [INFO ] Flatten gal took : 32 ms
[2025-06-02 08:24:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 7 ms.
[2025-06-02 08:24:37] [INFO ] Time to serialize gal into /tmp/CTLFireability2971330334518430876.gal : 5 ms
[2025-06-02 08:24:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3189044261915525490.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/CTLFireability2971330334518430876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3189044261915525490.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 -...262
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,6.47117e+06,8.44137,194048,1759,161,292511,1415,639,1.10299e+06,86,10990,0


Converting to forward existential form...Done !
original formula: (E(AF((AX(((i3.u2.p8==1)&&(i5.u33.p97==1))) * E(EG(((i1.i0.u3.p9==1)&&(i0.u26.p80==1))) U AX(((i1.i0.u3.p9==1)&&(i1.i0.u3.p122==1)))))) U...869
=> equivalent forward existential formula: ([(FwdU((Init * E(!(EG(!((!(EX(!(((i3.u2.p8==1)&&(i5.u33.p97==1))))) * E(EG(((i1.i0.u3.p9==1)&&(i0.u26.p80==1)))...2821
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t74, t79, t91, t92, t93, t94, t99, t140, t142, t155, t...835
Fast SCC detection found an SCC at level 1
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 1
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 317
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 287
Applied a total of 36 rules in 17 ms. Remains 106 /123 variables (removed 17) and now considering 287/329 (removed 42) transitions.
[2025-06-02 08:25:07] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2025-06-02 08:25:07] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:25:07] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-06-02 08:25:07] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:25:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 08:25:07] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2025-06-02 08:25:07] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2025-06-02 08:25:07] [INFO ] Invariant cache hit.
[2025-06-02 08:25:07] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:12] [INFO ] Deduced a trap composed of 36 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 08:25:12] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:12] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:12] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:12] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:25:13] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 158 constraints, problems are : Problem set: 0 solved, 286 unsolved in 21998 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/366 variables, 106/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 37/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 286/443 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/367 variables, and 443 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52097ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 52098ms
Starting structural reductions in LTL mode, iteration 1 : 106/123 places, 287/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52630 ms. Remains : 106/123 places, 287/329 transitions.
[2025-06-02 08:25:59] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:25:59] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:25:59] [INFO ] Input system was already deterministic with 287 transitions.
[2025-06-02 08:25:59] [INFO ] Flatten gal took : 11 ms
[2025-06-02 08:25:59] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:25:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17599627200881293156.gal : 3 ms
[2025-06-02 08:25:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6858415746651067732.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/CTLFireability17599627200881293156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6858415746651067732.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,6.23367e+06,9.46136,169660,2,6179,5,456345,6,0,710,596611,0


Converting to forward existential form...Done !
original formula: EF((EX(((p8==1)&&(p109==1))) * (p54==0)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (p54==0))) * ((p8==1)&&(p109==1)))] != FALSE
(forward)formula 0,1,9.72018,169660,1,0,9,456345,9,2,1321,596611,3
FORMULA FireWire-PT-07-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 115 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 105 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 104 transition count 285
Applied a total of 38 rules in 31 ms. Remains 104 /123 variables (removed 19) and now considering 285/329 (removed 44) transitions.
[2025-06-02 08:26:09] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 104 cols
[2025-06-02 08:26:09] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:26:09] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 08:26:09] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:26:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 08:26:10] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:26:10] [INFO ] Redundant transitions in 1 ms returned []
Running 282 sub problems to find dead transitions.
[2025-06-02 08:26:10] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:26:10] [INFO ] Invariant cache hit.
[2025-06-02 08:26:10] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:11] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:12] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:12] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:12] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:12] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:12] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:13] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:13] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 17 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:50] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:26:55] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/363 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/123 places, 285/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60835 ms. Remains : 104/123 places, 285/329 transitions.
[2025-06-02 08:27:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:27:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:27:10] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 08:27:10] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:27:10] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:27:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2571421574538606281.gal : 2 ms
[2025-06-02 08:27:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13201727322500442929.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/CTLFireability2571421574538606281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13201727322500442929.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,5.1877e+06,5.17665,105804,2,5089,5,297543,6,0,700,382873,0


Converting to forward existential form...Done !
original formula: EG(EF((p100==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p100==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...606
Detected timeout of ITS tools.
[2025-06-02 08:27:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:27:40] [INFO ] Applying decomposition
[2025-06-02 08:27:40] [INFO ] Flatten gal took : 9 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/graph17857897597786767459.txt' '-o' '/tmp/graph17857897597786767459.bin' '-w' '/tmp/graph17857897597786767459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17857897597786767459.bin' '-l' '-1' '-v' '-w' '/tmp/graph17857897597786767459.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:27:40] [INFO ] Decomposing Gal with order
[2025-06-02 08:27:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:27:40] [INFO ] Removed a total of 432 redundant transitions.
[2025-06-02 08:27:40] [INFO ] Flatten gal took : 17 ms
[2025-06-02 08:27:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 4 ms.
[2025-06-02 08:27:40] [INFO ] Time to serialize gal into /tmp/CTLFireability10069349282189722090.gal : 3 ms
[2025-06-02 08:27:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8743632905733122327.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/CTLFireability10069349282189722090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8743632905733122327.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,5.1877e+06,2.54974,59204,1967,148,110921,1233,555,233294,85,7606,0


Converting to forward existential form...Done !
original formula: EG(EF((i5.u37.p100==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i5.u37.p100==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t43, t47, t48, t50, t58, t63, t68, t73, t78, t81, t90, t91, t92, t93, t98, t139, t14...760
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
(forward)formula 0,1,26.0625,593592,1,0,1.16671e+06,3741,2892,2.65757e+06,357,23947,1864537
FORMULA FireWire-PT-07-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 117 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 117 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 115 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 113 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 112 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 111 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 105 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 105 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 104 transition count 285
Applied a total of 38 rules in 28 ms. Remains 104 /123 variables (removed 19) and now considering 285/329 (removed 44) transitions.
[2025-06-02 08:28:07] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:28:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:28:07] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-02 08:28:07] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:28:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:28:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 08:28:07] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:28:07] [INFO ] Redundant transitions in 3 ms returned []
Running 282 sub problems to find dead transitions.
[2025-06-02 08:28:07] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2025-06-02 08:28:07] [INFO ] Invariant cache hit.
[2025-06-02 08:28:07] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:28:09] [INFO ] Deduced a trap composed of 35 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 08:28:09] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:28:09] [INFO ] Deduced a trap composed of 15 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 08:28:09] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:28:10] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:28:10] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:28:10] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:28:11] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 19 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 1/362 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/363 variables, and 156 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 258/361 variables, 103/119 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 282/437 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:28:46] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:28:51] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 1/362 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/363 variables, and 440 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in SI_CTL mode, iteration 1 : 104/123 places, 285/329 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60703 ms. Remains : 104/123 places, 285/329 transitions.
[2025-06-02 08:29:07] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:29:07] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:29:07] [INFO ] Input system was already deterministic with 285 transitions.
[2025-06-02 08:29:07] [INFO ] Flatten gal took : 7 ms
[2025-06-02 08:29:07] [INFO ] Flatten gal took : 8 ms
[2025-06-02 08:29:07] [INFO ] Time to serialize gal into /tmp/CTLFireability5430177806555459110.gal : 2 ms
[2025-06-02 08:29:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1957857084920128207.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/CTLFireability5430177806555459110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1957857084920128207.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,5.1877e+06,5.24935,105588,2,5089,5,297543,6,0,700,382873,0


Converting to forward existential form...Done !
original formula: EF(AG(((p5==1)&&(p107==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p5==1)&&(p107==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...606
(forward)formula 0,0,8.75349,114036,1,0,508,505826,589,259,5912,444116,577
FORMULA FireWire-PT-07-CTLFireability-2024-14 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 : 123/123 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 119 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 119 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 118 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 295
Applied a total of 29 rules in 21 ms. Remains 109 /123 variables (removed 14) and now considering 295/329 (removed 34) transitions.
[2025-06-02 08:29:16] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
// Phase 1: matrix 269 rows 109 cols
[2025-06-02 08:29:16] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:29:16] [INFO ] Implicit Places using invariants in 245 ms returned []
[2025-06-02 08:29:16] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2025-06-02 08:29:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:29:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 08:29:17] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2025-06-02 08:29:17] [INFO ] Flow matrix only has 269 transitions (discarded 26 similar events)
[2025-06-02 08:29:17] [INFO ] Invariant cache hit.
[2025-06-02 08:29:17] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:29:21] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:29:21] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:29:22] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:29:22] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:29:22] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:29:22] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/377 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 1/378 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 9 (OVERLAPS) 0/378 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 162 constraints, problems are : Problem set: 0 solved, 294 unsolved in 24026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 268/377 variables, 109/123 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 38/161 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 294/455 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:29:50] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/378 variables, and 456 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 38/39 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54177ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 54179ms
Starting structural reductions in LTL mode, iteration 1 : 109/123 places, 295/329 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54833 ms. Remains : 109/123 places, 295/329 transitions.
[2025-06-02 08:30:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:30:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:30:11] [INFO ] Input system was already deterministic with 295 transitions.
[2025-06-02 08:30:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 08:30:11] [INFO ] Flatten gal took : 10 ms
[2025-06-02 08:30:11] [INFO ] Time to serialize gal into /tmp/CTLFireability12483024836536842577.gal : 2 ms
[2025-06-02 08:30:11] [INFO ] Time to serialize properties into /tmp/CTLFireability384793492741389150.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/CTLFireability12483024836536842577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability384793492741389150.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,6.95698e+06,9.77943,174624,2,6411,5,474286,6,0,730,600873,0


Converting to forward existential form...Done !
original formula: (E(!(AF(!(E(((p3==1)&&(p56==1)) U ((p6==1)&&(p51==1)))))) U ((p8==1)&&(p53==1))) + (AF(AG(((p3==0)||(p43==0)))) * EX(((p53==0)||((p11==1)...170
=> equivalent forward existential formula: ([FwdG((Init * !(E(!(!(EG(!(!(E(((p3==1)&&(p56==1)) U ((p6==1)&&(p51==1)))))))) U ((p8==1)&&(p53==1))))),!(!(E(T...351
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...630
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 08:30:41] [INFO ] Flatten gal took : 30 ms
[2025-06-02 08:30:41] [INFO ] Applying decomposition
[2025-06-02 08:30:41] [INFO ] Flatten gal took : 8 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/graph10520395054390156876.txt' '-o' '/tmp/graph10520395054390156876.bin' '-w' '/tmp/graph10520395054390156876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10520395054390156876.bin' '-l' '-1' '-v' '-w' '/tmp/graph10520395054390156876.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:30:41] [INFO ] Decomposing Gal with order
[2025-06-02 08:30:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:30:41] [INFO ] Removed a total of 450 redundant transitions.
[2025-06-02 08:30:41] [INFO ] Flatten gal took : 29 ms
[2025-06-02 08:30:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 7 ms.
[2025-06-02 08:30:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3347911688605475067.gal : 4 ms
[2025-06-02 08:30:41] [INFO ] Time to serialize properties into /tmp/CTLFireability5020446520007902573.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/CTLFireability3347911688605475067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5020446520007902573.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 -...262
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,6.95698e+06,21.0961,385656,1528,181,283569,9306,614,3.66862e+06,93,78930,0


Converting to forward existential form...Done !
original formula: (E(!(AF(!(E(((i0.u0.p3==1)&&(i2.u18.p56==1)) U ((i6.i1.u35.p6==1)&&(i2.u17.p51==1)))))) U ((i1.u2.p8==1)&&(i2.u18.p53==1))) + (AF(AG(((i0...254
=> equivalent forward existential formula: ([FwdG((Init * !(E(!(!(EG(!(!(E(((i0.u0.p3==1)&&(i2.u18.p56==1)) U ((i6.i1.u35.p6==1)&&(i2.u17.p51==1)))))))) U ...478
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...811
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
Detected timeout of ITS tools.
[2025-06-02 08:31:11] [INFO ] Flatten gal took : 16 ms
[2025-06-02 08:31:11] [INFO ] Flatten gal took : 15 ms
[2025-06-02 08:31:11] [INFO ] Applying decomposition
[2025-06-02 08:31:11] [INFO ] Flatten gal took : 15 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/graph17272060737888131989.txt' '-o' '/tmp/graph17272060737888131989.bin' '-w' '/tmp/graph17272060737888131989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17272060737888131989.bin' '-l' '-1' '-v' '-w' '/tmp/graph17272060737888131989.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:31:11] [INFO ] Decomposing Gal with order
[2025-06-02 08:31:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:31:11] [INFO ] Removed a total of 492 redundant transitions.
[2025-06-02 08:31:11] [INFO ] Flatten gal took : 32 ms
[2025-06-02 08:31:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 6 ms.
[2025-06-02 08:31:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6875107454237569667.gal : 4 ms
[2025-06-02 08:31:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10476749391114571878.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/CTLFireability6875107454237569667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10476749391114571878.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 4 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,7.41622e+06,9.27636,166148,1903,231,249313,2163,600,570723,115,17740,0


Converting to forward existential form...Done !
original formula: E((((AX(((i3.u2.p8==1)&&(i6.u38.p100==1))) + AF(!(((i7.i0.u21.p61==1)&&(i7.i0.u22.p70==1))))) + ((i0.u0.p2!=1) + ((AX(!(((i4.u1.p5==1)&&(...378
=> equivalent forward existential formula: [(FwdU(Init,(((!(EX(!(((i3.u2.p8==1)&&(i6.u38.p100==1))))) + !(EG(!(!(((i7.i0.u21.p61==1)&&(i7.i0.u22.p70==1))))...460
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t58, t59, t64, t69, t74, t79, t91, t92, t93, t94, t97, t99, t106...857
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local 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
(forward)formula 0,1,137.84,2081144,1,0,3.07359e+06,9610,3269,8.61029e+06,580,124225,5285652
FORMULA FireWire-PT-07-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EF(AG(!(A(((i4.u12.p38==1)&&(i5.u16.p49==1)) U ((i2.u3.p9==1)&&(i2.u27.p86==1)))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(!(!((E(!(((i2.u3.p9==1)&&(i2.u27.p86==1))) U (!(((i4.u12.p38==1)&&(i5.u16.p49==...259
(forward)formula 1,1,190.354,2333176,1,0,3.40764e+06,10191,2506,9.42734e+06,369,132818,1800635
FORMULA FireWire-PT-07-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E(AF((AX(((i3.u2.p8==1)&&(i6.u31.p97==1))) * E(EG(((i2.u3.p9==1)&&(i0.u24.p80==1))) U AX(((i2.u3.p9==1)&&(i2.u3.p122==1)))))) U !(EF((EF...821
=> equivalent forward existential formula: ([(FwdU((Init * E(!(EG(!((!(EX(!(((i3.u2.p8==1)&&(i6.u31.p97==1))))) * E(EG(((i2.u3.p9==1)&&(i0.u24.p80==1))) U ...2683
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 a local 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
(forward)formula 2,0,230.681,2333176,1,0,3.40764e+06,10191,2792,9.42734e+06,383,132818,4535452
FORMULA FireWire-PT-07-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E(!(AF(!(E(((i0.u0.p3==1)&&(i5.u18.p56==1)) U ((i6.u31.p6==1)&&(i5.u17.p51==1)))))) U ((i3.u2.p8==1)&&(i5.u18.p53==1))) + (AF(AG(((i0.u0...242
=> equivalent forward existential formula: ([FwdG((Init * !(E(!(!(EG(!(!(E(((i0.u0.p3==1)&&(i5.u18.p56==1)) U ((i6.u31.p6==1)&&(i5.u17.p51==1)))))))) U ((i...463
Fast SCC detection found an SCC at level 7
(forward)formula 3,0,352.095,2578364,1,0,3.6209e+06,10191,1408,1.05267e+07,270,132818,2304326
FORMULA FireWire-PT-07-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1813572 ms.

BK_STOP 1748853425201

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-07, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102200290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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