Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 101K 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-10-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-10-CTLFireability-2024-15
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-00
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-01
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-02
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-03
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-04
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-05
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-06
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-07
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-08
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-09
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-10
FORMULA_NAME FireWire-PT-10-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748859141246

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 10:12:23] [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 10:12:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 10:12:24] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2025-06-02 10:12:24] [INFO ] Transformed 131 places.
[2025-06-02 10:12:24] [INFO ] Transformed 409 transitions.
[2025-06-02 10:12:24] [INFO ] Found NUPN structural information;
[2025-06-02 10:12:24] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 84 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 131 transition count 347
Applied a total of 6 rules in 51 ms. Remains 131 /131 variables (removed 0) and now considering 347/353 (removed 6) transitions.
[2025-06-02 10:12:24] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
// Phase 1: matrix 321 rows 131 cols
[2025-06-02 10:12:24] [INFO ] Computed 8 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:12:25] [INFO ] Implicit Places using invariants in 578 ms returned []
[2025-06-02 10:12:25] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
[2025-06-02 10:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:12:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:12:25] [INFO ] Implicit Places using invariants and state equation in 688 ms returned [13, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1360 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/131 places, 347/353 transitions.
Applied a total of 0 rules in 10 ms. Remains 129 /129 variables (removed 0) and now considering 347/347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1463 ms. Remains : 129/131 places, 347/353 transitions.
Support contains 84 out of 129 places after structural reductions.
[2025-06-02 10:12:26] [INFO ] Flatten gal took : 126 ms
[2025-06-02 10:12:26] [INFO ] Flatten gal took : 66 ms
[2025-06-02 10:12:26] [INFO ] Input system was already deterministic with 347 transitions.
Reduction of identical properties reduced properties to check from 85 to 83
RANDOM walk for 40000 steps (2182 resets) in 3548 ms. (11 steps per ms) remains 44/83 properties
BEST_FIRST walk for 4002 steps (74 resets) in 75 ms. (52 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (26 resets) in 74 ms. (53 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (47 resets) in 68 ms. (58 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (58 resets) in 89 ms. (44 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (68 resets) in 81 ms. (48 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (58 resets) in 72 ms. (54 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (66 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (74 resets) in 41 ms. (95 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (53 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (11 resets) in 34 ms. (114 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (59 resets) in 73 ms. (54 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (147 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (22 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (48 resets) in 28 ms. (138 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (13 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (64 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (17 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (58 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (66 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (50 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (55 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (117 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (104 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (24 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (39 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (70 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (22 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (62 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (48 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (44 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (99 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (68 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (106 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (152 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
[2025-06-02 10:12:28] [INFO ] Flow matrix only has 321 transitions (discarded 26 similar events)
// Phase 1: matrix 321 rows 129 cols
[2025-06-02 10:12:28] [INFO ] Computed 6 invariants in 9 ms
[2025-06-02 10:12:28] [INFO ] State equation strengthened by 45 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/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 58/124 variables, 6/72 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 58/130 constraints. Problems are: Problem set: 10 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:29] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:29] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:29] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:30] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:30] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/135 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/135 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 320/444 variables, 124/259 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 44/303 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/303 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 5/449 variables, 5/308 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 5/313 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/313 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 1/450 variables, 1/314 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 0/314 constraints. Problems are: Problem set: 10 solved, 32 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 314 constraints, problems are : Problem set: 10 solved, 32 unsolved in 5021 ms.
Refiners :[Domain max(s): 129/129 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 129/129 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 32 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/47 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 77/124 variables, 6/53 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 77/130 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 5/135 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/135 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 320/444 variables, 124/259 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 44/303 constraints. Problems are: Problem set: 10 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 29/332 constraints. Problems are: Problem set: 10 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:36] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/333 constraints. Problems are: Problem set: 10 solved, 32 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/450 variables, and 333 constraints, problems are : Problem set: 10 solved, 32 unsolved in 5016 ms.
Refiners :[Domain max(s): 124/129 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/129 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 29/42 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10273ms problems are : Problem set: 10 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 347/347 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 129 transition count 344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 128 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 128 transition count 342
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 128 transition count 341
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 2 with 2 rules applied. Total rules applied 8 place count 127 transition count 343
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 127 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 127 transition count 340
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 127 transition count 338
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 15 place count 125 transition count 338
Applied a total of 15 rules in 147 ms. Remains 125 /129 variables (removed 4) and now considering 338/347 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 125/129 places, 338/347 transitions.
RANDOM walk for 40000 steps (2113 resets) in 832 ms. (48 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (78 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 38 ms. (102 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (67 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (44 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (66 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (55 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/32 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (45 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (147 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (41 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (57 resets) in 25 ms. (153 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4003 steps (55 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (67 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (55 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (98 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (104 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (45 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (66 resets) in 52 ms. (75 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (49 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (50 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (56 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (96 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (109 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (147 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
[2025-06-02 10:12:39] [INFO ] Flow matrix only has 314 transitions (discarded 24 similar events)
// Phase 1: matrix 314 rows 125 cols
[2025-06-02 10:12:39] [INFO ] Computed 6 invariants in 5 ms
[2025-06-02 10:12:39] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 77/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:39] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:40] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:40] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:40] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:40] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 314/434 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 5/439 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/439 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 182 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3570 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 77/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 314/434 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 24/201 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 5/439 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:47] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:47] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:12:50] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 15 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 0/439 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 212 constraints, problems are : Problem set: 0 solved, 27 unsolved in 20736 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24383ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 5 properties in 3886 ms.
Support contains 37 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 338/338 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 125 transition count 337
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 124 transition count 335
Applied a total of 4 rules in 31 ms. Remains 124 /125 variables (removed 1) and now considering 335/338 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 124/125 places, 335/338 transitions.
RANDOM walk for 40000 steps (2131 resets) in 395 ms. (101 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (48 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (60 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (57 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (64 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (52 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (38 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (57 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (100 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (112 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (64 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (62 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (74 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (59 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (109 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (102 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (149 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 409671 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :10 out of 22
Probabilistic random walk after 409671 steps, saw 95115 distinct states, run finished after 3010 ms. (steps per millisecond=136 ) properties seen :10
[2025-06-02 10:13:11] [INFO ] Flow matrix only has 311 transitions (discarded 24 similar events)
// Phase 1: matrix 311 rows 124 cols
[2025-06-02 10:13:11] [INFO ] Computed 6 invariants in 3 ms
[2025-06-02 10:13:11] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 96/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 311/430 variables, 119/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 46/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 5/435 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/435 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 176 constraints, problems are : Problem set: 0 solved, 12 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 96/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:12] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:12] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 311/430 variables, 119/127 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/430 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/430 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 5/435 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/435 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 190 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3964 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4695ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 1 properties in 7419 ms.
Support contains 20 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 335/335 transitions.
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 2 place count 123 transition count 334
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 0 with 4 rules applied. Total rules applied 6 place count 121 transition count 338
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 121 transition count 332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 120 transition count 331
Applied a total of 13 rules in 52 ms. Remains 120 /124 variables (removed 4) and now considering 331/335 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 120/124 places, 331/335 transitions.
RANDOM walk for 40000 steps (2269 resets) in 374 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (625 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (557 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (75 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (557 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (570 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (569 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1079 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1129 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1120 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (73 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1117 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 532606 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :1 out of 11
Probabilistic random walk after 532606 steps, saw 112935 distinct states, run finished after 3005 ms. (steps per millisecond=177 ) properties seen :1
[2025-06-02 10:13:26] [INFO ] Flow matrix only has 303 transitions (discarded 28 similar events)
// Phase 1: matrix 303 rows 120 cols
[2025-06-02 10:13:26] [INFO ] Computed 6 invariants in 2 ms
[2025-06-02 10:13:26] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 92/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 303/415 variables, 112/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 45/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 8/423 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/423 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 171 constraints, problems are : Problem set: 0 solved, 10 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 92/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 303/415 variables, 112/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 45/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:28] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 8/423 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 182 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3192 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3830ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 9506 ms.
Support contains 20 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 331/331 transitions.
Applied a total of 0 rules in 12 ms. Remains 120 /120 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 120/120 places, 331/331 transitions.
RANDOM walk for 40000 steps (2391 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (648 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (562 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (72 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (576 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (554 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1079 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1125 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1096 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (75 resets) in 42 ms. (930 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1051 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 517112 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 10
Probabilistic random walk after 517112 steps, saw 109702 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2025-06-02 10:13:43] [INFO ] Flow matrix only has 303 transitions (discarded 28 similar events)
[2025-06-02 10:13:43] [INFO ] Invariant cache hit.
[2025-06-02 10:13:43] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 92/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 303/415 variables, 112/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 45/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 8/423 variables, 8/170 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/423 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 171 constraints, problems are : Problem set: 0 solved, 10 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 92/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 303/415 variables, 112/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 45/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:44] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 8/423 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 182 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2269 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2865ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 5837 ms.
Support contains 20 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 331/331 transitions.
Applied a total of 0 rules in 12 ms. Remains 120 /120 variables (removed 0) and now considering 331/331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 120/120 places, 331/331 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 331/331 transitions.
Applied a total of 0 rules in 9 ms. Remains 120 /120 variables (removed 0) and now considering 331/331 (removed 0) transitions.
[2025-06-02 10:13:52] [INFO ] Flow matrix only has 303 transitions (discarded 28 similar events)
[2025-06-02 10:13:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:13:52] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 10:13:52] [INFO ] Flow matrix only has 303 transitions (discarded 28 similar events)
[2025-06-02 10:13:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:13:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:13:52] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:13:52] [INFO ] Redundant transitions in 32 ms returned []
Running 329 sub problems to find dead transitions.
[2025-06-02 10:13:52] [INFO ] Flow matrix only has 303 transitions (discarded 28 similar events)
[2025-06-02 10:13:52] [INFO ] Invariant cache hit.
[2025-06-02 10:13:52] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:54] [INFO ] Deduced a trap composed of 34 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 10:13:54] [INFO ] Deduced a trap composed of 40 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 10:13:54] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:54] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:55] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:56] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:56] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:13:56] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 13 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 303/422 variables, 119/133 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:14:03] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 1/423 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 423/423 variables, and 180 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (OVERLAPS) 303/422 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 45/179 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 329/508 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:14:30] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:14:34] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:14:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/423 variables, and 511 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60671 ms. Remains : 120/120 places, 331/331 transitions.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-10-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 10:14:52] [INFO ] Flatten gal took : 29 ms
[2025-06-02 10:14:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-10-CTLFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 10:14:52] [INFO ] Flatten gal took : 32 ms
[2025-06-02 10:14:53] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 64 out of 129 places (down from 66) after GAL structural reductions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 316
Applied a total of 27 rules in 23 ms. Remains 117 /129 variables (removed 12) and now considering 316/347 (removed 31) transitions.
[2025-06-02 10:14:53] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
// Phase 1: matrix 290 rows 117 cols
[2025-06-02 10:14:53] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:14:53] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 10:14:53] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 10:14:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:14:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-06-02 10:14:53] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 315 sub problems to find dead transitions.
[2025-06-02 10:14:53] [INFO ] Flow matrix only has 290 transitions (discarded 26 similar events)
[2025-06-02 10:14:53] [INFO ] Invariant cache hit.
[2025-06-02 10:14:53] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 6/6 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 10:14:57] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:14:57] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:14:57] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:14:57] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:14:57] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/406 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 1/407 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 9 (OVERLAPS) 0/407 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 169 constraints, problems are : Problem set: 0 solved, 315 unsolved in 26985 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 5/5 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/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 289/406 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 40/168 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 315/483 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/407 variables, and 483 constraints, problems are : Problem set: 0 solved, 315 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57139ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 57149ms
Starting structural reductions in LTL mode, iteration 1 : 117/129 places, 316/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57602 ms. Remains : 117/129 places, 316/347 transitions.
[2025-06-02 10:15:50] [INFO ] Flatten gal took : 33 ms
[2025-06-02 10:15:50] [INFO ] Flatten gal took : 32 ms
[2025-06-02 10:15:50] [INFO ] Input system was already deterministic with 316 transitions.
[2025-06-02 10:15:50] [INFO ] Flatten gal took : 31 ms
[2025-06-02 10:15:50] [INFO ] Flatten gal took : 30 ms
[2025-06-02 10:15:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4686109210078151283.gal : 16 ms
[2025-06-02 10:15:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18309510506760240920.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/CTLFireability4686109210078151283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18309510506760240920.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16573e+07,10.4442,201248,2,8961,5,533336,6,0,783,706435,0


Converting to forward existential form...Done !
original formula: AX(!(E(AX(!((((p3==1)&&(p87==1))&&(p59==1)))) U A(AF(((p3==1)&&(p34==1))) U EF(((p3==1)&&(p127==1)))))))
=> equivalent forward existential formula: [((FwdU(EY(Init),!(EX(!(!((((p3==1)&&(p87==1))&&(p59==1))))))) * !(EG(!(E(TRUE U ((p3==1)&&(p127==1))))))) * !(E...274
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...663
Detected timeout of ITS tools.
[2025-06-02 10:16:21] [INFO ] Flatten gal took : 29 ms
[2025-06-02 10:16:21] [INFO ] Applying decomposition
[2025-06-02 10:16:21] [INFO ] Flatten gal took : 27 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/graph3514658543787638093.txt' '-o' '/tmp/graph3514658543787638093.bin' '-w' '/tmp/graph3514658543787638093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3514658543787638093.bin' '-l' '-1' '-v' '-w' '/tmp/graph3514658543787638093.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:16:21] [INFO ] Decomposing Gal with order
[2025-06-02 10:16:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:16:21] [INFO ] Removed a total of 488 redundant transitions.
[2025-06-02 10:16:21] [INFO ] Flatten gal took : 91 ms
[2025-06-02 10:16:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 23 ms.
[2025-06-02 10:16:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4832797223310191483.gal : 8 ms
[2025-06-02 10:16:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14943456865837350126.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/CTLFireability4832797223310191483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14943456865837350126.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16573e+07,2.06453,56032,1528,173,80055,2231,637,246091,105,14818,0


Converting to forward existential form...Done !
original formula: AX(!(E(AX(!((((i5.u0.p3==1)&&(i5.u0.p87==1))&&(i3.u20.p59==1)))) U A(AF(((i5.u0.p3==1)&&(i1.u12.p34==1))) U EF(((i5.u0.p3==1)&&(i5.u0.p12...166
=> equivalent forward existential formula: [((FwdU(EY(Init),!(EX(!(!((((i5.u0.p3==1)&&(i5.u0.p87==1))&&(i3.u20.p59==1))))))) * !(EG(!(E(TRUE U ((i5.u0.p3==...342
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t75, t91, t94, t133, t134, t135, t137, ...792
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 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 : 129/129 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 307
Applied a total of 35 rules in 23 ms. Remains 113 /129 variables (removed 16) and now considering 307/347 (removed 40) transitions.
[2025-06-02 10:16:51] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2025-06-02 10:16:51] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:16:51] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-02 10:16:51] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 10:16:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:16:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:16:52] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-02 10:16:52] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 10:16:52] [INFO ] Invariant cache hit.
[2025-06-02 10:16:52] [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/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:16:55] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:16:55] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:16:55] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:16:55] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 163 constraints, problems are : Problem set: 0 solved, 306 unsolved in 21212 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/468 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:17:31] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:17:38] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/394 variables, and 470 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 51357ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 51361ms
Starting structural reductions in LTL mode, iteration 1 : 113/129 places, 307/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51871 ms. Remains : 113/129 places, 307/347 transitions.
[2025-06-02 10:17:43] [INFO ] Flatten gal took : 25 ms
[2025-06-02 10:17:43] [INFO ] Flatten gal took : 24 ms
[2025-06-02 10:17:43] [INFO ] Input system was already deterministic with 307 transitions.
[2025-06-02 10:17:43] [INFO ] Flatten gal took : 23 ms
[2025-06-02 10:17:43] [INFO ] Flatten gal took : 25 ms
[2025-06-02 10:17:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10418779492830338832.gal : 5 ms
[2025-06-02 10:17:43] [INFO ] Time to serialize properties into /tmp/CTLFireability12342122751091244527.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/CTLFireability10418779492830338832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12342122751091244527.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,8.78099,184888,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,8.79464,184888,1,0,6,477294,7,1,1161,637251,1
FORMULA FireWire-PT-10-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 126 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 126 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 339
Applied a total of 8 rules in 4 ms. Remains 126 /129 variables (removed 3) and now considering 339/347 (removed 8) transitions.
[2025-06-02 10:17:52] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
// Phase 1: matrix 313 rows 126 cols
[2025-06-02 10:17:52] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:17:52] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 10:17:52] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2025-06-02 10:17:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:17:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:17:52] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2025-06-02 10:17:52] [INFO ] Flow matrix only has 313 transitions (discarded 26 similar events)
[2025-06-02 10:17:52] [INFO ] Invariant cache hit.
[2025-06-02 10:17:52] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:17:56] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:17:56] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:17:56] [INFO ] Deduced a trap composed of 35 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 10:17:56] [INFO ] Deduced a trap composed of 42 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 10:17:56] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:17:57] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 312/438 variables, 126/138 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 44/182 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 1/439 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 0/439 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 183 constraints, problems are : Problem set: 0 solved, 338 unsolved in 21145 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 312/438 variables, 126/138 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 44/182 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 338/520 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:36] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/439 variables, and 522 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 126/126 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51261ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 51262ms
Starting structural reductions in LTL mode, iteration 1 : 126/129 places, 339/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51719 ms. Remains : 126/129 places, 339/347 transitions.
[2025-06-02 10:18:44] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:18:44] [INFO ] Flatten gal took : 19 ms
[2025-06-02 10:18:44] [INFO ] Input system was already deterministic with 339 transitions.
[2025-06-02 10:18:44] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:18:44] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:18:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6272683675098905023.gal : 3 ms
[2025-06-02 10:18:44] [INFO ] Time to serialize properties into /tmp/CTLFireability7905476203357380005.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6272683675098905023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7905476203357380005.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2152e+07,3.29305,78088,2,2988,5,226791,6,0,842,235699,0


Converting to forward existential form...Done !
original formula: EF(((AX(((p3==1)&&(p16==1))) * (EX(((p11==0)||(p26==0))) + EX(((p3==0)||(p81==0))))) * (((p3==0)||(p117==0))&&((p3==0)||(p43==0)))))
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * (((p3==0)||(p117==0))&&((p3==0)||(p43==0)))) * !(EX(!(((p3==1)&&(p16==1))))))) * ((p11...321
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...718
(forward)formula 0,0,5.18309,79984,1,0,616,313203,695,313,7088,297690,686
FORMULA FireWire-PT-10-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 123 transition count 332
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 123 transition count 332
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 15 place count 122 transition count 331
Applied a total of 15 rules in 43 ms. Remains 122 /129 variables (removed 7) and now considering 331/347 (removed 16) transitions.
[2025-06-02 10:18:49] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
// Phase 1: matrix 305 rows 122 cols
[2025-06-02 10:18:49] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:18:49] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 10:18:49] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2025-06-02 10:18:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:18:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:18:49] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:18:49] [INFO ] Redundant transitions in 6 ms returned []
Running 328 sub problems to find dead transitions.
[2025-06-02 10:18:49] [INFO ] Flow matrix only has 305 transitions (discarded 26 similar events)
[2025-06-02 10:18:49] [INFO ] Invariant cache hit.
[2025-06-02 10:18:49] [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/121 variables, 6/6 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 10:18:52] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:52] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:52] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:52] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:53] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:18:53] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 304/425 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 42/175 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 10:19:01] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:19:02] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 1/426 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/427 variables, and 178 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 122/122 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 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/121 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 304/425 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 328/505 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 10:19:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 1/506 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 10:19:41] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/427 variables, and 507 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 121/122 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60182ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in SI_CTL mode, iteration 1 : 122/129 places, 331/347 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60660 ms. Remains : 122/129 places, 331/347 transitions.
[2025-06-02 10:19:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 10:19:50] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:19:50] [INFO ] Input system was already deterministic with 331 transitions.
[2025-06-02 10:19:50] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:19:50] [INFO ] Flatten gal took : 12 ms
[2025-06-02 10:19:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2237014111173661685.gal : 4 ms
[2025-06-02 10:19:50] [INFO ] Time to serialize properties into /tmp/CTLFireability18249723603605258676.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/CTLFireability2237014111173661685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18249723603605258676.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,9.67097e+06,9.52545,171312,2,8576,5,453286,6,0,818,559080,0


Converting to forward existential form...Done !
original formula: !(E(AG(A(!(AG(((p8==1)&&(p55==1)))) U EF(((p4==1)&&(p118==1))))) U AG(A(((((p6==1)&&(p104==1))||((p3==1)&&(p127==1)))||(p28==1)) U !((((p...200
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((E(!(E(TRUE U ((p4==1)&&(p118==1)))) U (!(!(!(E(TRUE U !(((p8==1)&&(p55==1))))))) * !...496
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...694
Detected timeout of ITS tools.
[2025-06-02 10:20:20] [INFO ] Flatten gal took : 21 ms
[2025-06-02 10:20:20] [INFO ] Applying decomposition
[2025-06-02 10:20:20] [INFO ] Flatten gal took : 19 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/graph1388446038201185185.txt' '-o' '/tmp/graph1388446038201185185.bin' '-w' '/tmp/graph1388446038201185185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1388446038201185185.bin' '-l' '-1' '-v' '-w' '/tmp/graph1388446038201185185.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:20:20] [INFO ] Decomposing Gal with order
[2025-06-02 10:20:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:20:20] [INFO ] Removed a total of 527 redundant transitions.
[2025-06-02 10:20:20] [INFO ] Flatten gal took : 53 ms
[2025-06-02 10:20:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 24 ms.
[2025-06-02 10:20:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5825355948719676743.gal : 6 ms
[2025-06-02 10:20:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1803279852771268545.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/CTLFireability5825355948719676743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1803279852771268545.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,9.67097e+06,4.80824,100164,2043,172,156317,1677,647,432601,85,12833,0


Converting to forward existential form...Done !
original formula: !(E(AG(A(!(AG(((i3.u2.p8==1)&&(i4.u19.p55==1)))) U EF(((i2.i2.u1.p4==1)&&(i0.u40.p118==1))))) U AG(A(((((i6.i2.u38.p6==1)&&(i6.i1.u36.p10...296
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((E(!(E(TRUE U ((i2.i2.u1.p4==1)&&(i0.u40.p118==1)))) U (!(!(!(E(TRUE U !(((i3.u2.p8==...682
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t47, t55, t56, t60, t65, t70, t75, t87, t88, t89, t90, t93, t95,...839
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
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
(forward)formula 0,1,27.2746,483572,1,0,736121,4608,3283,2.05839e+06,352,29976,1763910
FORMULA FireWire-PT-10-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 318
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 26 place count 116 transition count 317
Applied a total of 26 rules in 37 ms. Remains 116 /129 variables (removed 13) and now considering 317/347 (removed 30) transitions.
[2025-06-02 10:20:48] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
// Phase 1: matrix 291 rows 116 cols
[2025-06-02 10:20:48] [INFO ] Computed 6 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:20:48] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-02 10:20:48] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 10:20:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:20:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-06-02 10:20:48] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:20:48] [INFO ] Redundant transitions in 29 ms returned []
Running 314 sub problems to find dead transitions.
[2025-06-02 10:20:48] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2025-06-02 10:20:48] [INFO ] Invariant cache hit.
[2025-06-02 10:20:48] [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/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:20:50] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:20:50] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:20:50] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:20:50] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:20:50] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:20:51] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:20:52] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 290/405 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 39/167 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 1/406 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:21:05] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/407 variables, and 169 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 290/405 variables, 115/129 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 39/168 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 314/482 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:21:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:21:31] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:21:32] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:21:44] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/407 variables, and 486 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/116 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/129 places, 317/347 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60688 ms. Remains : 116/129 places, 317/347 transitions.
[2025-06-02 10:21:48] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:21:48] [INFO ] Flatten gal took : 11 ms
[2025-06-02 10:21:48] [INFO ] Input system was already deterministic with 317 transitions.
[2025-06-02 10:21:48] [INFO ] Flatten gal took : 17 ms
[2025-06-02 10:21:48] [INFO ] Flatten gal took : 17 ms
[2025-06-02 10:21:48] [INFO ] Time to serialize gal into /tmp/CTLFireability3472791115648335906.gal : 5 ms
[2025-06-02 10:21:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8395463369477459095.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/CTLFireability3472791115648335906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8395463369477459095.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,9.79316e+06,7.16699,154892,2,7839,5,411552,6,0,780,524080,0


Converting to forward existential form...Done !
original formula: EG((AG(EF(((p7==0)||(p63==0)))) * (AF(((p9==0)||(p87==0))) + (((p8==0)||(p105==0))&&((p5==0)||(p52==0))))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E(TRUE U ((p7==0)||(p63==0)))))) * (!(EG(!(((p9==0)||(p87==0))))) + (((p8==0)||(p105==0...192
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...663
(forward)formula 0,1,19.5821,323968,1,0,575,1.0756e+06,663,298,6972,1.13145e+06,667
FORMULA FireWire-PT-10-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 307
Applied a total of 35 rules in 18 ms. Remains 113 /129 variables (removed 16) and now considering 307/347 (removed 40) transitions.
[2025-06-02 10:22:08] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2025-06-02 10:22:08] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:22:08] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-02 10:22:08] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 10:22:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:22:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:22:08] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-02 10:22:08] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 10:22:08] [INFO ] Invariant cache hit.
[2025-06-02 10:22:08] [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/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:22:11] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:22:11] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:22:12] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:22:12] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 163 constraints, problems are : Problem set: 0 solved, 306 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/468 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:22:44] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:22:52] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/394 variables, and 470 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50116ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 50117ms
Starting structural reductions in LTL mode, iteration 1 : 113/129 places, 307/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50503 ms. Remains : 113/129 places, 307/347 transitions.
[2025-06-02 10:22:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:22:59] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:22:59] [INFO ] Input system was already deterministic with 307 transitions.
[2025-06-02 10:22:59] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:22:59] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:22:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18442541729179983433.gal : 2 ms
[2025-06-02 10:22:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11501812762992843725.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/CTLFireability18442541729179983433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11501812762992843725.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,8.69682,184804,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: (AF(AX(AG(((p9==1)&&(p47==1))))) + EF(EG((((p4==1)&&(p18==1))&&((p3==0)||(p19==0))))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U EG((((p4==1)&&(p18==1))&&((p3==0)||(p19==0))))))),!(!(EX(!(!(E(TRUE U !(((p9==1)&&(p47=...176
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...639
Detected timeout of ITS tools.
[2025-06-02 10:23:29] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:23:29] [INFO ] Applying decomposition
[2025-06-02 10:23:29] [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/graph6618539154472443261.txt' '-o' '/tmp/graph6618539154472443261.bin' '-w' '/tmp/graph6618539154472443261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6618539154472443261.bin' '-l' '-1' '-v' '-w' '/tmp/graph6618539154472443261.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:23:29] [INFO ] Decomposing Gal with order
[2025-06-02 10:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:23:29] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-02 10:23:29] [INFO ] Flatten gal took : 25 ms
[2025-06-02 10:23:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 10 ms.
[2025-06-02 10:23:29] [INFO ] Time to serialize gal into /tmp/CTLFireability325217464095964222.gal : 4 ms
[2025-06-02 10:23:29] [INFO ] Time to serialize properties into /tmp/CTLFireability568345908136022903.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/CTLFireability325217464095964222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability568345908136022903.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,12.7969,210084,1941,222,273603,2190,634,952732,86,20820,0


Converting to forward existential form...Done !
original formula: (AF(AX(AG(((i3.i2.u3.p9==1)&&(i3.i0.u15.p47==1))))) + EF(EG((((i1.i1.u1.p4==1)&&(i3.i2.u6.p18==1))&&((i0.u0.p3==0)||(i2.u12.p19==0))))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U EG((((i1.i1.u1.p4==1)&&(i3.i2.u6.p18==1))&&((i0.u0.p3==0)||(i2.u12.p19==0))))))),!(!(EX...226
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t71, t76, t79, t80, t84, t91, t94, t133, t13...777
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 a local SCC at level 2
Fast SCC detection found a local 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 : 129/129 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 338
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 124 transition count 335
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 123 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 123 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 122 transition count 330
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 122 transition count 330
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 121 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 121 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 120 transition count 325
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 120 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 119 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 119 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 118 transition count 320
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 118 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 117 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 117 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 116 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 116 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 115 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 115 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 114 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 114 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 113 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 113 transition count 309
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 34 place count 112 transition count 308
Applied a total of 34 rules in 42 ms. Remains 112 /129 variables (removed 17) and now considering 308/347 (removed 39) transitions.
[2025-06-02 10:23:59] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
// Phase 1: matrix 282 rows 112 cols
[2025-06-02 10:23:59] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:23:59] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 10:23:59] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2025-06-02 10:23:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:23:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-06-02 10:23:59] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:23:59] [INFO ] Redundant transitions in 2 ms returned []
Running 305 sub problems to find dead transitions.
[2025-06-02 10:23:59] [INFO ] Flow matrix only has 282 transitions (discarded 26 similar events)
[2025-06-02 10:23:59] [INFO ] Invariant cache hit.
[2025-06-02 10:23:59] [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/111 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:24:01] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:24:01] [INFO ] Deduced a trap composed of 35 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 10:24:01] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:24:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:24:02] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 281/392 variables, 111/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 38/160 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 1/393 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/394 variables, and 161 constraints, problems are : Problem set: 0 solved, 305 unsolved in 26773 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 112/112 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 281/392 variables, 111/122 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 38/160 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 305/465 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:24:32] [INFO ] Deduced a trap composed of 33 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 10:24:34] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:24:35] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:24:41] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:24:42] [INFO ] Deduced a trap along path composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/394 variables, and 470 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/112 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 56870ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 56871ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/129 places, 308/347 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57285 ms. Remains : 112/129 places, 308/347 transitions.
[2025-06-02 10:24:56] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:24:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:24:56] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-02 10:24:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:24:56] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:24:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9262762892433246969.gal : 2 ms
[2025-06-02 10:24:56] [INFO ] Time to serialize properties into /tmp/CTLFireability18111731233051374693.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/CTLFireability9262762892433246969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18111731233051374693.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,9.55497e+06,5.8083,128260,2,5810,5,340314,6,0,755,427706,0


Converting to forward existential form...Done !
original formula: EG(E(A((AG(((p6==1)&&(p56==1))) + !(((p5==1)&&(p100==1)))) U ((p8==1)&&(p104==1))) U AG(EF(((p6==1)&&(p63==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(!((E(!(((p8==1)&&(p104==1))) U (!((!(E(TRUE U !(((p6==1)&&(p56==1))))) + !(((p5==1)&&(p100==1))))) ...274
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t16, t18, t22, t23, t25, t26, t28, t30, t34, t35, t37...639
Detected timeout of ITS tools.
[2025-06-02 10:25:26] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:25:26] [INFO ] Applying decomposition
[2025-06-02 10:25:26] [INFO ] Flatten gal took : 10 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/graph16496947380240778470.txt' '-o' '/tmp/graph16496947380240778470.bin' '-w' '/tmp/graph16496947380240778470.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16496947380240778470.bin' '-l' '-1' '-v' '-w' '/tmp/graph16496947380240778470.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:25:26] [INFO ] Decomposing Gal with order
[2025-06-02 10:25:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:25:26] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-02 10:25:26] [INFO ] Flatten gal took : 24 ms
[2025-06-02 10:25:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 10 ms.
[2025-06-02 10:25:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7698849943209053448.gal : 3 ms
[2025-06-02 10:25:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3070549740199422504.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/CTLFireability7698849943209053448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3070549740199422504.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,9.55497e+06,11.616,176896,2032,229,213737,1449,611,888011,87,16628,0


Converting to forward existential form...Done !
original formula: EG(E(A((AG(((i5.i1.u38.p6==1)&&(i4.u19.p56==1))) + !(((i3.i0.u1.p5==1)&&(i3.i0.u25.p100==1)))) U ((i4.u2.p8==1)&&(i6.u35.p104==1))) U AG(...198
=> equivalent forward existential formula: [FwdG(Init,E(!((E(!(((i4.u2.p8==1)&&(i6.u35.p104==1))) U (!((!(E(TRUE U !(((i5.i1.u38.p6==1)&&(i4.u19.p56==1))))...366
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t40, t41, t44, t45, t55, t60, t65, t70, t75, t78, t90, t93, t102, t134, t135, t136, ...758
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 336
Applied a total of 11 rules in 3 ms. Remains 125 /129 variables (removed 4) and now considering 336/347 (removed 11) transitions.
[2025-06-02 10:25:56] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 125 cols
[2025-06-02 10:25:56] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:25:57] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 10:25:57] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2025-06-02 10:25:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:25:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:25:57] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2025-06-02 10:25:57] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2025-06-02 10:25:57] [INFO ] Invariant cache hit.
[2025-06-02 10:25:57] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:26:00] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:26:01] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:26:01] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:26:01] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:26:01] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:26:02] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/137 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 1/435 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 182 constraints, problems are : Problem set: 0 solved, 335 unsolved in 26529 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/137 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 335/516 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:26:37] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/435 variables, and 517 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56633ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 56634ms
Starting structural reductions in LTL mode, iteration 1 : 125/129 places, 336/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57095 ms. Remains : 125/129 places, 336/347 transitions.
[2025-06-02 10:26:53] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:26:53] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:26:53] [INFO ] Input system was already deterministic with 336 transitions.
[2025-06-02 10:26:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:26:54] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:26:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12567538444506422459.gal : 2 ms
[2025-06-02 10:26:54] [INFO ] Time to serialize properties into /tmp/CTLFireability9362995516234334414.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/CTLFireability12567538444506422459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9362995516234334414.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,2.99877,68552,2,2820,5,202226,6,0,835,209509,0


Converting to forward existential form...Done !
original formula: EF(AG(((p5==1) * ((EX(((p9==1)&&(p117==1))) + (p8==0)) + (p54==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p5==1) * ((EX(((p9==1)&&(p117==1))) + (p8==0)) + (p54==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...712
(forward)formula 0,0,4.99531,76916,1,0,614,318031,693,314,6999,283496,686
FORMULA FireWire-PT-10-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 125 transition count 340
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 125 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 125 transition count 337
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 11 place count 124 transition count 336
Applied a total of 11 rules in 15 ms. Remains 124 /129 variables (removed 5) and now considering 336/347 (removed 11) transitions.
[2025-06-02 10:26:59] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 124 cols
[2025-06-02 10:26:59] [INFO ] Computed 6 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:26:59] [INFO ] Implicit Places using invariants in 165 ms returned []
[2025-06-02 10:26:59] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2025-06-02 10:26:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:26:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-02 10:26:59] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:26:59] [INFO ] Redundant transitions in 3 ms returned []
Running 333 sub problems to find dead transitions.
[2025-06-02 10:26:59] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2025-06-02 10:26:59] [INFO ] Invariant cache hit.
[2025-06-02 10:26:59] [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/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:01] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:01] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:01] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:02] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:02] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:02] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 24 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:04] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 309/432 variables, 123/136 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (OVERLAPS) 1/433 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/434 variables, and 180 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (OVERLAPS) 309/432 variables, 123/136 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 333/512 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:38] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:27:45] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/434 variables, and 514 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 123/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/129 places, 336/347 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60727 ms. Remains : 124/129 places, 336/347 transitions.
[2025-06-02 10:27:59] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:27:59] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:27:59] [INFO ] Input system was already deterministic with 336 transitions.
[2025-06-02 10:27:59] [INFO ] Flatten gal took : 18 ms
[2025-06-02 10:27:59] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:27:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7284508075167368012.gal : 3 ms
[2025-06-02 10:27:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3982797545737735427.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/CTLFireability7284508075167368012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3982797545737735427.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,9.71202e+06,2.38109,53616,2,2435,5,168638,6,0,831,167960,0


Converting to forward existential form...Done !
original formula: (EG((AG((EF(((p8==1)&&(p104==1))) + A(((p3==1)&&(p60==1)) U ((p4==1)&&(p46==1))))) + A(((p11==1)&&(p63==1)) U ((p7==1)&&(p28==1))))) * EF...178
=> equivalent forward existential formula: [(FwdU((Init * EG((!(E(TRUE U !((E(TRUE U ((p8==1)&&(p104==1))) + !((E(!(((p4==1)&&(p46==1))) U (!(((p3==1)&&(p6...382
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36,...705
Detected timeout of ITS tools.
[2025-06-02 10:28:29] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:28:29] [INFO ] Applying decomposition
[2025-06-02 10:28:29] [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/graph12176248963629720238.txt' '-o' '/tmp/graph12176248963629720238.bin' '-w' '/tmp/graph12176248963629720238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12176248963629720238.bin' '-l' '-1' '-v' '-w' '/tmp/graph12176248963629720238.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:28:29] [INFO ] Decomposing Gal with order
[2025-06-02 10:28:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:28:30] [INFO ] Removed a total of 536 redundant transitions.
[2025-06-02 10:28:30] [INFO ] Flatten gal took : 38 ms
[2025-06-02 10:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 13 ms.
[2025-06-02 10:28:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3272942374095112462.gal : 5 ms
[2025-06-02 10:28:30] [INFO ] Time to serialize properties into /tmp/CTLFireability4122621432491040788.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/CTLFireability3272942374095112462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4122621432491040788.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,9.71202e+06,10.3189,186004,2693,215,281786,1732,684,797175,85,15267,0


Converting to forward existential form...Done !
original formula: (EG((AG((EF(((i4.u2.p8==1)&&(i5.i1.u36.p104==1))) + A(((i3.u0.p3==1)&&(i4.u21.p60==1)) U ((i0.i2.u1.p4==1)&&(i2.i2.u15.p46==1))))) + A(((...271
=> equivalent forward existential formula: [(FwdU((Init * EG((!(E(TRUE U !((E(TRUE U ((i4.u2.p8==1)&&(i5.i1.u36.p104==1))) + !((E(!(((i0.i2.u1.p4==1)&&(i2....537
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t42, t45, t46, t48, t54, t56, t61, t66, t71, t76, t80, t88, t89, t90, t91, t94, t13...849
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 126 transition count 341
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 126 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 126 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 125 transition count 336
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 125 transition count 336
Applied a total of 10 rules in 5 ms. Remains 125 /129 variables (removed 4) and now considering 336/347 (removed 11) transitions.
[2025-06-02 10:29:00] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 125 cols
[2025-06-02 10:29:00] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:29:00] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 10:29:00] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2025-06-02 10:29:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:29:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-02 10:29:00] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2025-06-02 10:29:00] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2025-06-02 10:29:00] [INFO ] Invariant cache hit.
[2025-06-02 10:29:00] [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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:29:06] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:29:06] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:29:06] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:29:06] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:29:06] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 1/435 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 180 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 335/514 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:29:55] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:29:55] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/435 variables, and 516 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 43/44 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 125/129 places, 336/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60632 ms. Remains : 125/129 places, 336/347 transitions.
[2025-06-02 10:30:00] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:30:00] [INFO ] Flatten gal took : 16 ms
[2025-06-02 10:30:00] [INFO ] Input system was already deterministic with 336 transitions.
[2025-06-02 10:30:00] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:30:00] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:30:00] [INFO ] Time to serialize gal into /tmp/CTLFireability8815746825477445916.gal : 3 ms
[2025-06-02 10:30:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10269057960728550482.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/CTLFireability8815746825477445916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10269057960728550482.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19492e+07,2.89292,68084,2,2855,5,202918,6,0,835,212947,0


Converting to forward existential form...Done !
original formula: (EF(((((((EF(((p3==1)&&(p109==1))) * (p7==1)) * (p54==1)) + AX(EG((p111==0)))) + (((p8==1)&&(p102==1))||(((p7==0)||(p113==0))&&((p8==0)||...503
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,TRUE) * (((((E(TRUE U ((p3==1)&&(p109==1))) * (p7==1)) * (p54==1)) + !(EX(!(EG((p111==0))))...1076
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...706
Detected timeout of ITS tools.
[2025-06-02 10:30:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:30:30] [INFO ] Applying decomposition
[2025-06-02 10:30:30] [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/graph1888730932184689237.txt' '-o' '/tmp/graph1888730932184689237.bin' '-w' '/tmp/graph1888730932184689237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1888730932184689237.bin' '-l' '-1' '-v' '-w' '/tmp/graph1888730932184689237.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:30:30] [INFO ] Decomposing Gal with order
[2025-06-02 10:30:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:30:31] [INFO ] Removed a total of 537 redundant transitions.
[2025-06-02 10:30:31] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:30:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 6 ms.
[2025-06-02 10:30:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1307566215433036376.gal : 3 ms
[2025-06-02 10:30:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13291513537779823532.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/CTLFireability1307566215433036376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13291513537779823532.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.19492e+07,7.50688,169100,2770,186,231926,3892,695,938015,88,29449,0


Converting to forward existential form...Done !
original formula: (EF(((((((EF(((i0.u0.p3==1)&&(i5.i2.u44.p109==1))) * (i3.u2.p7==1)) * (i3.u18.p54==1)) + AX(EG((i5.i2.u37.p111==0)))) + (((i3.u2.p8==1)&&...775
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,TRUE) * (((((E(TRUE U ((i0.u0.p3==1)&&(i5.i2.u44.p109==1))) * (i3.u2.p7==1)) * (i3.u18.p54=...1539
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t61, t66, t71, t76, t80, t88, t89, t90, t91, t94, t139, t14...862
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 321
Applied a total of 23 rules in 8 ms. Remains 119 /129 variables (removed 10) and now considering 321/347 (removed 26) transitions.
[2025-06-02 10:31:01] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 119 cols
[2025-06-02 10:31:01] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:31:01] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 10:31:01] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2025-06-02 10:31:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:31:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:31:01] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2025-06-02 10:31:01] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
[2025-06-02 10:31:01] [INFO ] Invariant cache hit.
[2025-06-02 10:31:01] [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/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:31:06] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:31:06] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:31:06] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:31:07] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:31:07] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:31:07] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/413 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:31:16] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 1/414 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 174 constraints, problems are : Problem set: 0 solved, 320 unsolved in 26198 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 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, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 294/413 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 41/173 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 320/493 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:31:38] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/414 variables, and 494 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 119/119 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56304ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 56305ms
Starting structural reductions in LTL mode, iteration 1 : 119/129 places, 321/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56727 ms. Remains : 119/129 places, 321/347 transitions.
[2025-06-02 10:31:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:31:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:31:57] [INFO ] Input system was already deterministic with 321 transitions.
[2025-06-02 10:31:57] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:31:57] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:31:57] [INFO ] Time to serialize gal into /tmp/CTLFireability12829036708622578440.gal : 2 ms
[2025-06-02 10:31:57] [INFO ] Time to serialize properties into /tmp/CTLFireability11926531304168498118.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/CTLFireability12829036708622578440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11926531304168498118.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16984e+07,9.84222,204032,2,9074,5,538341,6,0,796,694155,0


Converting to forward existential form...Done !
original formula: EX((AG(((AF(((p8==0)||(p37==0))) + ((p7==1)&&(p114==1))) + ((p3==1)&&(p123==1)))) + AG(((p57==1) + EX((((p3==1)&&(p93==1))||((p3==1)&&(p4...167
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(((!(EG(!(((p8==0)||(p37==0))))) + ((p7==1)&&(p114==1))) + ((p3==1)&&(p123==1)))))))] ...266
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...675
Detected timeout of ITS tools.
[2025-06-02 10:32:27] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:32:27] [INFO ] Applying decomposition
[2025-06-02 10:32:27] [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/graph8064887468232261788.txt' '-o' '/tmp/graph8064887468232261788.bin' '-w' '/tmp/graph8064887468232261788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8064887468232261788.bin' '-l' '-1' '-v' '-w' '/tmp/graph8064887468232261788.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:32:27] [INFO ] Decomposing Gal with order
[2025-06-02 10:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:32:27] [INFO ] Removed a total of 486 redundant transitions.
[2025-06-02 10:32:27] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:32:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 6 ms.
[2025-06-02 10:32:28] [INFO ] Time to serialize gal into /tmp/CTLFireability8633198332414168105.gal : 3 ms
[2025-06-02 10:32:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2657709167874406759.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/CTLFireability8633198332414168105.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2657709167874406759.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,1.16984e+07,12.0936,233188,2183,307,278800,4307,656,1.24759e+06,122,38568,0


Converting to forward existential form...Done !
original formula: EX((AG(((AF(((i2.u2.p8==0)||(i2.u12.p37==0))) + ((i2.u2.p7==1)&&(i5.i1.u37.p114==1))) + ((i0.u0.p3==1)&&(i0.u0.p123==1)))) + AG(((i4.u20....247
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(((!(EG(!(((i2.u2.p8==0)||(i2.u12.p37==0))))) + ((i2.u2.p7==1)&&(i5.i1.u37.p114==1))) ...346
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t79, t84, t91, t94, t133, t134, t135, t137, ...825
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
(forward)formula 0,0,18.1692,233188,1,0,278800,6839,3331,1.24759e+06,603,38568,787233
FORMULA FireWire-PT-10-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 336
Applied a total of 11 rules in 2 ms. Remains 125 /129 variables (removed 4) and now considering 336/347 (removed 11) transitions.
[2025-06-02 10:32:46] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
// Phase 1: matrix 310 rows 125 cols
[2025-06-02 10:32:46] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:32:46] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 10:32:46] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2025-06-02 10:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:32:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-02 10:32:46] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2025-06-02 10:32:46] [INFO ] Flow matrix only has 310 transitions (discarded 26 similar events)
[2025-06-02 10:32:46] [INFO ] Invariant cache hit.
[2025-06-02 10:32:46] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:32:52] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:32:52] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:32:52] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:32:52] [INFO ] Deduced a trap composed of 42 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 10:32:52] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:32:54] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/137 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 1/435 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (OVERLAPS) 0/435 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 182 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 309/434 variables, 125/137 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 44/181 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 335/516 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:33:29] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/435 variables, and 517 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 125/125 constraints, ReadFeed: 44/45 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 125/129 places, 336/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60586 ms. Remains : 125/129 places, 336/347 transitions.
[2025-06-02 10:33:46] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:33:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:33:46] [INFO ] Input system was already deterministic with 336 transitions.
[2025-06-02 10:33:46] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:33:46] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:33:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1831597361068548966.gal : 1 ms
[2025-06-02 10:33:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12006509858338292595.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/CTLFireability1831597361068548966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12006509858338292595.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,3.32277,68656,2,2820,5,202226,6,0,835,209509,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) * A(((E(AX(!(((p10==1)&&(p86==1)))) U EF((((p8==1)&&(p29==1))||((p7==1)&&(p30==1))))) * A(AG(((p8==1)&&(p114==1))) U !(((p8==1...362
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * ((([((FwdU(Init,!(((E(TRUE U ((p6==1)&&(p38==1))) * !((!(E(TRUE U !(((p9==1)&...2187
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...712
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 10:34:16] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:34:16] [INFO ] Applying decomposition
[2025-06-02 10:34:16] [INFO ] Flatten gal took : 10 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/graph10761337329068693977.txt' '-o' '/tmp/graph10761337329068693977.bin' '-w' '/tmp/graph10761337329068693977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10761337329068693977.bin' '-l' '-1' '-v' '-w' '/tmp/graph10761337329068693977.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:34:17] [INFO ] Decomposing Gal with order
[2025-06-02 10:34:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:34:17] [INFO ] Removed a total of 537 redundant transitions.
[2025-06-02 10:34:17] [INFO ] Flatten gal took : 23 ms
[2025-06-02 10:34:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 7 ms.
[2025-06-02 10:34:17] [INFO ] Time to serialize gal into /tmp/CTLFireability6941283150386410738.gal : 12 ms
[2025-06-02 10:34:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18050285701982800236.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/CTLFireability6941283150386410738.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18050285701982800236.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18216e+07,7.06642,149880,2795,180,211619,3966,709,772040,87,30243,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) * A(((E(AX(!(((i1.i0.u3.p10==1)&&(i0.u29.p86==1)))) U EF((((i2.u2.p8==1)&&(i2.u10.p29==1))||((i2.u2.p7==1)&&(i2.u10.p30==1))))...541
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * ((([((FwdU(Init,!(((E(TRUE U ((i5.i1.u37.p6==1)&&(i2.u11.p38==1))) * !((!(E(T...3086
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t55, t56, t61, t66, t71, t76, t80, t88, t89, t90, t91, t94,...880
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 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 1
Fast SCC detection found an SCC at level 2
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 323
Applied a total of 21 rules in 6 ms. Remains 120 /129 variables (removed 9) and now considering 323/347 (removed 24) transitions.
[2025-06-02 10:34:47] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
// Phase 1: matrix 297 rows 120 cols
[2025-06-02 10:34:47] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:34:47] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 10:34:47] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2025-06-02 10:34:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:34:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-06-02 10:34:47] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2025-06-02 10:34:47] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2025-06-02 10:34:47] [INFO ] Invariant cache hit.
[2025-06-02 10:34:47] [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/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:34:52] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:34:52] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:34:53] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:34:53] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:34:53] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 296/416 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 1/417 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 173 constraints, problems are : Problem set: 0 solved, 322 unsolved in 29486 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 296/416 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 322/494 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:35:31] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:35:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:35:35] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/417 variables, and 497 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 41/42 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59641ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 59642ms
Starting structural reductions in LTL mode, iteration 1 : 120/129 places, 323/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60054 ms. Remains : 120/129 places, 323/347 transitions.
[2025-06-02 10:35:47] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:35:47] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:35:47] [INFO ] Input system was already deterministic with 323 transitions.
[2025-06-02 10:35:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:35:47] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:35:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14748090137605345274.gal : 2 ms
[2025-06-02 10:35:47] [INFO ] Time to serialize properties into /tmp/CTLFireability11468131647324061259.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/CTLFireability14748090137605345274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11468131647324061259.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17193e+07,1.70759,43252,2,2860,5,109317,6,0,802,113510,0


Converting to forward existential form...Done !
original formula: (EG(((p31==1) + E(!(A((p105==1) U (p105==1))) U A(!(((p10==1)&&(p84==1))) U (((p72==1)&&(p130==1))&&((p8==1)&&(p37==1))))))) + (EG(((p5==...233
=> equivalent forward existential formula: ([FwdG(Init,((p31==1) + E(!(!((E(!((p105==1)) U (!((p105==1)) * !((p105==1)))) + EG(!((p105==1)))))) U !((E(!(((...570
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t17, t19, t23, t24, t26, t27, t29, t31, t35, t36, t38...676
Detected timeout of ITS tools.
[2025-06-02 10:36:17] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:36:17] [INFO ] Applying decomposition
[2025-06-02 10:36:17] [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/graph1518894285875237124.txt' '-o' '/tmp/graph1518894285875237124.bin' '-w' '/tmp/graph1518894285875237124.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1518894285875237124.bin' '-l' '-1' '-v' '-w' '/tmp/graph1518894285875237124.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:36:17] [INFO ] Decomposing Gal with order
[2025-06-02 10:36:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:36:17] [INFO ] Removed a total of 512 redundant transitions.
[2025-06-02 10:36:17] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:36:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 6 ms.
[2025-06-02 10:36:17] [INFO ] Time to serialize gal into /tmp/CTLFireability12942938263224351637.gal : 4 ms
[2025-06-02 10:36:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16995850295760030271.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/CTLFireability12942938263224351637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16995850295760030271.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,1.17193e+07,14.0771,263448,2810,170,402302,1673,673,997826,86,12843,0


Converting to forward existential form...Done !
original formula: (EG(((i2.u11.p31==1) + E(!(A((i6.i0.u37.p105==1) U (i6.i0.u37.p105==1))) U A(!(((i1.i0.u3.p10==1)&&(i0.u29.p84==1))) U (((i5.u23.p72==1)&...350
=> equivalent forward existential formula: ([FwdG(Init,((i2.u11.p31==1) + E(!(!((E(!((i6.i0.u37.p105==1)) U (!((i6.i0.u37.p105==1)) * !((i6.i0.u37.p105==1)...791
Reverse transition relation is NOT exact ! Due to transitions t6, t39, t41, t42, t45, t46, t48, t56, t61, t66, t67, t71, t76, t80, t91, t94, t133, t134, t1...818
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 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 : 129/129 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 125 transition count 339
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 125 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 125 transition count 336
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 124 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 123 transition count 331
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 123 transition count 331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 122 transition count 328
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 122 transition count 328
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 121 transition count 326
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 121 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 120 transition count 323
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 120 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 119 transition count 321
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 119 transition count 321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 118 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 118 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 117 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 117 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 116 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 115 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 114 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 113 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 307
Applied a total of 35 rules in 13 ms. Remains 113 /129 variables (removed 16) and now considering 307/347 (removed 40) transitions.
[2025-06-02 10:36:47] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
// Phase 1: matrix 281 rows 113 cols
[2025-06-02 10:36:47] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:36:47] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-02 10:36:47] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 10:36:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:36:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-02 10:36:47] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-02 10:36:47] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2025-06-02 10:36:47] [INFO ] Invariant cache hit.
[2025-06-02 10:36:47] [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/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:36:51] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:36:51] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:36:51] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:36:52] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 163 constraints, problems are : Problem set: 0 solved, 306 unsolved in 25349 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/468 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:37:33] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
(t4 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 0)
(t3 1)
(t4 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/394 variables, and 469 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55448ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 55449ms
Starting structural reductions in LTL mode, iteration 1 : 113/129 places, 307/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55863 ms. Remains : 113/129 places, 307/347 transitions.
[2025-06-02 10:37:43] [INFO ] Flatten gal took : 13 ms
[2025-06-02 10:37:43] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:37:43] [INFO ] Input system was already deterministic with 307 transitions.
[2025-06-02 10:37:43] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:37:43] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:37:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5606729319875181387.gal : 3 ms
[2025-06-02 10:37:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7246879429662442070.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/CTLFireability5606729319875181387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7246879429662442070.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1577e+07,9.06241,184892,2,6965,5,477294,6,0,758,637251,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,9.07404,184892,1,0,6,477294,7,1,1161,637251,1
FORMULA FireWire-PT-10-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-02 10:37:52] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:37:52] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:37:52] [INFO ] Applying decomposition
[2025-06-02 10:37:52] [INFO ] Flatten gal took : 10 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/graph8737435980903788024.txt' '-o' '/tmp/graph8737435980903788024.bin' '-w' '/tmp/graph8737435980903788024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8737435980903788024.bin' '-l' '-1' '-v' '-w' '/tmp/graph8737435980903788024.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:37:52] [INFO ] Decomposing Gal with order
[2025-06-02 10:37:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:37:52] [INFO ] Removed a total of 569 redundant transitions.
[2025-06-02 10:37:52] [INFO ] Flatten gal took : 21 ms
[2025-06-02 10:37:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 5 ms.
[2025-06-02 10:37:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15284064603879157142.gal : 3 ms
[2025-06-02 10:37:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12676535137686553332.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/CTLFireability15284064603879157142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12676535137686553332.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26692e+07,5.23005,115012,1880,88,183947,1207,589,445242,81,5554,0


Converting to forward existential form...Done !
original formula: AX(!(E(AX(!((((i1.u0.p3==1)&&(i1.u29.p87==1))&&(i4.u19.p59==1)))) U A(AF(((i1.u0.p3==1)&&(i3.u11.p34==1))) U EF(((i1.u0.p3==1)&&(i0.u44.p...168
=> equivalent forward existential formula: [((FwdU(EY(Init),!(EX(!(!((((i1.u0.p3==1)&&(i1.u29.p87==1))&&(i4.u19.p59==1))))))) * !(EG(!(E(TRUE U ((i1.u0.p3=...346
Reverse transition relation is NOT exact ! Due to transitions t40, t43, t46, t47, t49, t57, t62, t67, t72, t77, t89, t90, t91, t92, t95, t97, t140, t142, t...816
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
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 6
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
Fast SCC detection found a local SCC at level 1
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 6
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,0,61.6654,1110480,1,0,1.70352e+06,2040,3275,4.35502e+06,300,9117,3804999
FORMULA FireWire-PT-10-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(AX(AG(((i0.u3.p9==1)&&(i2.u15.p47==1))))) + EF(EG((((i2.u1.p4==1)&&(i0.u6.p18==1))&&((i1.u0.p3==0)||(i3.u11.p19==0))))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U EG((((i2.u1.p4==1)&&(i0.u6.p18==1))&&((i1.u0.p3==0)||(i3.u11.p19==0))))))),!(!(EX(!(!(E...214
(forward)formula 1,0,71.9478,1243216,1,0,1.87175e+06,2118,3311,4.60583e+06,302,9813,4619370
FORMULA FireWire-PT-10-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(E(A((AG(((i7.u4.p6==1)&&(i4.u18.p56==1))) + !(((i2.u1.p5==1)&&(i6.u24.p100==1)))) U ((i3.u2.p8==1)&&(i7.u35.p104==1))) U AG(EF(((i7.u4...184
=> equivalent forward existential formula: [FwdG(Init,E(!((E(!(((i3.u2.p8==1)&&(i7.u35.p104==1))) U (!((!(E(TRUE U !(((i7.u4.p6==1)&&(i4.u18.p56==1))))) + ...352
(forward)formula 2,0,81.8351,1488976,1,0,2.26235e+06,2361,3370,5.45053e+06,302,11200,5557633
FORMULA FireWire-PT-10-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG((AG((EF(((i3.u2.p8==1)&&(i7.u35.p104==1))) + A(((i1.u0.p3==1)&&(i4.u19.p60==1)) U ((i2.u1.p4==1)&&(i2.u15.p46==1))))) + A(((i0.u3.p11...262
=> equivalent forward existential formula: [(FwdU((Init * EG((!(E(TRUE U !((E(TRUE U ((i3.u2.p8==1)&&(i7.u35.p104==1))) + !((E(!(((i2.u1.p4==1)&&(i2.u15.p4...516
(forward)formula 3,0,94.9123,1766224,1,0,2.67408e+06,2416,3487,6.33765e+06,305,11642,6579472
FORMULA FireWire-PT-10-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(((((((EF(((i1.u0.p3==1)&&(i7.u45.p109==1))) * (i3.u2.p7==1)) * (i4.u17.p54==1)) + AX(EG((i7.u37.p111==0)))) + (((i3.u2.p8==1)&&(i7.u3...742
=> equivalent forward existential formula: (([((FwdU((FwdU(Init,TRUE) * (((((E(TRUE U ((i1.u0.p3==1)&&(i7.u45.p109==1))) * (i3.u2.p7==1)) * (i4.u17.p54==1)...1488
(forward)formula 4,1,107.959,1977080,1,0,2.98692e+06,2435,3623,6.92768e+06,309,11891,7373245
FORMULA FireWire-PT-10-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(FALSE) * A(((E(AX(!(((i0.u3.p10==1)&&(i1.u29.p86==1)))) U EF((((i3.u2.p8==1)&&(i3.u10.p29==1))||((i3.u2.p7==1)&&(i3.u10.p30==1))))) *...521
=> equivalent forward existential formula: ([(EY(Init) * !(FALSE))] = FALSE * ((([((FwdU(Init,!(((E(TRUE U ((i7.u4.p6==1)&&(i3.u11.p38==1))) * !((!(E(TRUE ...2968
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 6
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 5,0,166.843,2204408,1,0,3.33307e+06,2497,1436,7.69894e+06,182,12436,2683264
FORMULA FireWire-PT-10-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(((i3.u11.p31==1) + E(!(A((i7.u45.p105==1) U (i7.u45.p105==1))) U A(!(((i0.u3.p10==1)&&(i1.u28.p84==1))) U (((i5.i0.u23.p72==1)&&(i7.u...335
=> equivalent forward existential formula: ([FwdG(Init,((i3.u11.p31==1) + E(!(!((E(!((i7.u45.p105==1)) U (!((i7.u45.p105==1)) * !((i7.u45.p105==1)))) + EG(...770
(forward)formula 6,1,214.666,2204408,1,0,3.33307e+06,2497,2064,7.69894e+06,205,12436,6951792
FORMULA FireWire-PT-10-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1748860888050

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

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 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 ;