Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 160K 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 MedleyA-PT-11-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-11-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-11-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748857905865

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 09:51:48] [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 09:51:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:51:48] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2025-06-02 09:51:48] [INFO ] Transformed 150 places.
[2025-06-02 09:51:48] [INFO ] Transformed 478 transitions.
[2025-06-02 09:51:48] [INFO ] Found NUPN structural information;
[2025-06-02 09:51:48] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 89 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 125 transition count 435
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 125 transition count 435
Applied a total of 50 rules in 38 ms. Remains 125 /150 variables (removed 25) and now considering 435/469 (removed 34) transitions.
[2025-06-02 09:51:48] [INFO ] Flow matrix only has 363 transitions (discarded 72 similar events)
// Phase 1: matrix 363 rows 125 cols
[2025-06-02 09:51:48] [INFO ] Computed 23 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:51:49] [INFO ] Implicit Places using invariants in 382 ms returned []
[2025-06-02 09:51:49] [INFO ] Flow matrix only has 363 transitions (discarded 72 similar events)
[2025-06-02 09:51:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:51:49] [INFO ] State equation strengthened by 171 read => feed constraints.
[2025-06-02 09:51:49] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2025-06-02 09:51:49] [INFO ] Flow matrix only has 363 transitions (discarded 72 similar events)
[2025-06-02 09:51:49] [INFO ] Invariant cache hit.
[2025-06-02 09:51:49] [INFO ] State equation strengthened by 171 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, 14/14 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/125 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:55] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:55] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:55] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:55] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:56] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:56] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:56] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:56] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:56] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:56] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:56] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:57] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:57] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:57] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:57] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:57] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:57] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:58] [INFO ] Deduced a trap composed of 25 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 09:51:58] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:51:58] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 20/43 constraints. Problems are: Problem set: 108 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:00] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:00] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:00] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:00] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:02] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:02] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 6/49 constraints. Problems are: Problem set: 108 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:02] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:02] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/51 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 363/488 variables, 125/176 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 171/347 constraints. Problems are: Problem set: 108 solved, 326 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/347 constraints. Problems are: Problem set: 108 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 347 constraints, problems are : Problem set: 108 solved, 326 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/125 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 326 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 14/14 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 9/23 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 28/51 constraints. Problems are: Problem set: 108 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:23] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:24] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/53 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 363/488 variables, 125/178 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 171/349 constraints. Problems are: Problem set: 108 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 326/675 constraints. Problems are: Problem set: 108 solved, 326 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:45] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:45] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 677 constraints, problems are : Problem set: 108 solved, 326 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/125 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 326/434 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60836ms problems are : Problem set: 108 solved, 326 unsolved
Search for dead transitions found 108 dead transitions in 60868ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 125/150 places, 327/469 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 327/327 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61819 ms. Remains : 125/150 places, 327/469 transitions.
Support contains 89 out of 125 places after structural reductions.
[2025-06-02 09:52:50] [INFO ] Flatten gal took : 115 ms
[2025-06-02 09:52:50] [INFO ] Flatten gal took : 61 ms
[2025-06-02 09:52:51] [INFO ] Input system was already deterministic with 327 transitions.
RANDOM walk for 40000 steps (3119 resets) in 2944 ms. (13 steps per ms) remains 51/78 properties
BEST_FIRST walk for 4003 steps (49 resets) in 52 ms. (75 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (54 resets) in 43 ms. (90 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (49 resets) in 43 ms. (90 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (44 resets) in 60 ms. (65 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (49 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (51 resets) in 32 ms. (121 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (54 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (51 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (50 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (56 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (39 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (52 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (56 resets) in 58 ms. (67 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (49 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (47 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (51 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4004 steps (57 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (54 resets) in 21 ms. (182 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (50 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (56 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (52 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (47 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (53 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (50 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (54 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (54 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (47 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (48 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (49 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (55 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (45 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (50 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (47 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (49 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (49 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (51 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (54 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (52 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (50 resets) in 23 ms. (166 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (51 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (59 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
// Phase 1: matrix 327 rows 125 cols
[2025-06-02 09:52:52] [INFO ] Computed 23 invariants in 6 ms
[2025-06-02 09:52:52] [INFO ] State equation strengthened by 135 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/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp76 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/99 variables, 9/9 constraints. Problems are: Problem set: 7 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 43 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 3 (OVERLAPS) 24/123 variables, 14/23 constraints. Problems are: Problem set: 18 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/23 constraints. Problems are: Problem set: 18 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 325/448 variables, 123/146 constraints. Problems are: Problem set: 18 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 135/281 constraints. Problems are: Problem set: 18 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/281 constraints. Problems are: Problem set: 18 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 4/452 variables, 2/283 constraints. Problems are: Problem set: 18 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/283 constraints. Problems are: Problem set: 18 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/452 variables, 0/283 constraints. Problems are: Problem set: 18 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 283 constraints, problems are : Problem set: 18 solved, 32 unsolved in 2951 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 125/125 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 32 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 32 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/86 variables, 7/7 constraints. Problems are: Problem set: 19 solved, 31 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:55] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/8 constraints. Problems are: Problem set: 19 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/8 constraints. Problems are: Problem set: 19 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 4/90 variables, 2/10 constraints. Problems are: Problem set: 19 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 19 solved, 31 unsolved
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 6 (OVERLAPS) 30/120 variables, 13/23 constraints. Problems are: Problem set: 21 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:56] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:56] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:57] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:57] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 4/27 constraints. Problems are: Problem set: 21 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/27 constraints. Problems are: Problem set: 21 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 3/123 variables, 1/28 constraints. Problems are: Problem set: 21 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:57] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:57] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 2/30 constraints. Problems are: Problem set: 21 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/30 constraints. Problems are: Problem set: 21 solved, 29 unsolved
At refinement iteration 12 (OVERLAPS) 325/448 variables, 123/153 constraints. Problems are: Problem set: 21 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 135/288 constraints. Problems are: Problem set: 21 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/448 variables, 12/300 constraints. Problems are: Problem set: 21 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:52:59] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 448/452 variables, and 301 constraints, problems are : Problem set: 21 solved, 29 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 123/125 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 12/50 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8032ms problems are : Problem set: 21 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 327/327 transitions.
Graph (complete) has 629 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 325
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 111 transition count 297
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 110 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 110 transition count 293
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 27 place count 109 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 29 place count 108 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 41 place count 108 transition count 288
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 108 transition count 286
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 105 transition count 286
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 68 place count 105 transition count 286
Applied a total of 68 rules in 112 ms. Remains 105 /125 variables (removed 20) and now considering 286/327 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 105/125 places, 286/327 transitions.
RANDOM walk for 40000 steps (3360 resets) in 726 ms. (55 steps per ms) remains 18/29 properties
BEST_FIRST walk for 4003 steps (65 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (67 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (63 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (65 resets) in 28 ms. (138 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4002 steps (71 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (69 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (72 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (71 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (59 resets) in 14 ms. (266 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4002 steps (56 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (56 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (67 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (60 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (54 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (68 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (53 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
// Phase 1: matrix 286 rows 105 cols
[2025-06-02 09:53:01] [INFO ] Computed 21 invariants in 3 ms
[2025-06-02 09:53:01] [INFO ] State equation strengthened by 128 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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 49/81 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/85 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 18/103 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2/105 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 286/391 variables, 105/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 128/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/391 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 254 constraints, problems are : Problem set: 0 solved, 16 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 49/81 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/85 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 18/103 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2/105 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 286/391 variables, 105/126 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 128/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 16/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:04] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:04] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/391 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 272 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4942 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 128/128 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6092ms problems are : Problem set: 0 solved, 16 unsolved
Finished Parikh walk after 7339 steps, including 318 resets, run visited all 2 properties in 25 ms. (steps per millisecond=293 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 16 properties in 1270 ms.
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-CTLFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-CTLFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 09:53:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-02 09:53:08] [INFO ] Flatten gal took : 27 ms
[2025-06-02 09:53:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-11-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-CTLFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-CTLFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 09:53:08] [INFO ] Flatten gal took : 27 ms
[2025-06-02 09:53:08] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 60 out of 125 places (down from 72) after GAL structural reductions.
Computed a total of 20 stabilizing places and 128 stable transitions
Graph (complete) has 810 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Graph (complete) has 810 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 3 places
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 103 transition count 276
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 103 transition count 276
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 44 place count 94 transition count 230
Iterating global reduction 0 with 9 rules applied. Total rules applied 53 place count 94 transition count 230
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 56 place count 91 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 59 place count 91 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 90 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 90 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 87 transition count 211
Applied a total of 70 rules in 43 ms. Remains 87 /125 variables (removed 38) and now considering 211/327 (removed 116) transitions.
// Phase 1: matrix 211 rows 87 cols
[2025-06-02 09:53:08] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:53:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 09:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:53:08] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-02 09:53:08] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:53:09] [INFO ] Redundant transitions in 16 ms returned []
Running 210 sub problems to find dead transitions.
[2025-06-02 09:53:09] [INFO ] Invariant cache hit.
[2025-06-02 09:53:09] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:11] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:11] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:11] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:11] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:12] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:12] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 211/298 variables, 87/113 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 106/219 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/298 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 219 constraints, problems are : Problem set: 0 solved, 210 unsolved in 12722 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 211/298 variables, 87/113 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 106/219 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 210/429 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:53:38] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 6 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/298 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 430 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 87/87 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42902ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 42908ms
Starting structural reductions in SI_CTL mode, iteration 1 : 87/125 places, 211/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43317 ms. Remains : 87/125 places, 211/327 transitions.
[2025-06-02 09:53:51] [INFO ] Flatten gal took : 32 ms
[2025-06-02 09:53:51] [INFO ] Flatten gal took : 29 ms
[2025-06-02 09:53:52] [INFO ] Input system was already deterministic with 211 transitions.
[2025-06-02 09:53:52] [INFO ] Flatten gal took : 29 ms
[2025-06-02 09:53:52] [INFO ] Flatten gal took : 25 ms
[2025-06-02 09:53:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5950391451596758900.gal : 17 ms
[2025-06-02 09:53:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16387629331903007321.ctl : 7 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/CTLFireability5950391451596758900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16387629331903007321.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.
Detected timeout of ITS tools.
[2025-06-02 09:54:22] [INFO ] Flatten gal took : 15 ms
[2025-06-02 09:54:22] [INFO ] Applying decomposition
[2025-06-02 09:54:22] [INFO ] Flatten gal took : 13 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/graph18404093029907265139.txt' '-o' '/tmp/graph18404093029907265139.bin' '-w' '/tmp/graph18404093029907265139.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18404093029907265139.bin' '-l' '-1' '-v' '-w' '/tmp/graph18404093029907265139.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:54:22] [INFO ] Decomposing Gal with order
[2025-06-02 09:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:54:22] [INFO ] Removed a total of 368 redundant transitions.
[2025-06-02 09:54:22] [INFO ] Flatten gal took : 82 ms
[2025-06-02 09:54:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 16 ms.
[2025-06-02 09:54:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12745485651524754765.gal : 6 ms
[2025-06-02 09:54:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9131306166265307667.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/CTLFireability12745485651524754765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9131306166265307667.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44409e+08,12.0874,240268,3435,124,336404,629,317,1.31901e+06,109,3962,0


Converting to forward existential form...Done !
original formula: AF((AG(((((i3.i1.u12.p97==0)||(i3.i1.u19.p131==0))||((i4.u23.p133==0)||(i4.u22.p142==0)))||((u11.p53==0)||(u11.p86==0)))) + (i3.i1.u17.p1...163
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((((i3.i1.u12.p97==0)||(i3.i1.u19.p131==0))||((i4.u23.p133==0)||(i4.u22.p142==0)))||(...220
Reverse transition relation is NOT exact ! Due to transitions t109, t113, t136, t176, t188, t206, u11.t20, u11.t21, u11.t22, u11.t23, u11.t24, u11.t25, u11...1023
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 327
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 107 transition count 285
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 107 transition count 285
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 100 transition count 250
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 100 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 97 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 97 transition count 238
Applied a total of 54 rules in 13 ms. Remains 97 /125 variables (removed 28) and now considering 238/327 (removed 89) transitions.
// Phase 1: matrix 238 rows 97 cols
[2025-06-02 09:54:52] [INFO ] Computed 21 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:54:52] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-02 09:54:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:54:52] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 09:54:53] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2025-06-02 09:54:53] [INFO ] Invariant cache hit.
[2025-06-02 09:54:53] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:55] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:55] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:55] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:56] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:56] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:56] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:57] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:57] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:54:58] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 238/335 variables, 97/127 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 112/239 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 0/335 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 239 constraints, problems are : Problem set: 0 solved, 237 unsolved in 16940 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 238/335 variables, 97/127 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 112/239 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 237/476 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:17] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:55:37] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 7 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/335 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 478 constraints, problems are : Problem set: 0 solved, 237 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 97/97 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47142ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 47144ms
Starting structural reductions in LTL mode, iteration 1 : 97/125 places, 238/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47699 ms. Remains : 97/125 places, 238/327 transitions.
[2025-06-02 09:55:40] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:55:40] [INFO ] Flatten gal took : 14 ms
[2025-06-02 09:55:40] [INFO ] Input system was already deterministic with 238 transitions.
[2025-06-02 09:55:40] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:55:40] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:55:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2717197273221970562.gal : 3 ms
[2025-06-02 09:55:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3304345774468024216.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/CTLFireability2717197273221970562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3304345774468024216.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.
Detected timeout of ITS tools.
[2025-06-02 09:56:10] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:56:10] [INFO ] Applying decomposition
[2025-06-02 09:56:10] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13643519351885550933.txt' '-o' '/tmp/graph13643519351885550933.bin' '-w' '/tmp/graph13643519351885550933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13643519351885550933.bin' '-l' '-1' '-v' '-w' '/tmp/graph13643519351885550933.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:56:10] [INFO ] Decomposing Gal with order
[2025-06-02 09:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:56:10] [INFO ] Removed a total of 468 redundant transitions.
[2025-06-02 09:56:10] [INFO ] Flatten gal took : 39 ms
[2025-06-02 09:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 9 ms.
[2025-06-02 09:56:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9560688042058458893.gal : 4 ms
[2025-06-02 09:56:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5785353844857683184.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/CTLFireability9560688042058458893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5785353844857683184.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.43598e+09,27.3445,434108,3146,123,552160,1281,367,2.23826e+06,109,7875,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Graph (complete) has 810 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 105 transition count 276
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 105 transition count 276
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 44 place count 96 transition count 230
Iterating global reduction 0 with 9 rules applied. Total rules applied 53 place count 96 transition count 230
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 57 place count 92 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 92 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 63 place count 91 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 91 transition count 210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 88 transition count 207
Applied a total of 72 rules in 39 ms. Remains 88 /125 variables (removed 37) and now considering 207/327 (removed 120) transitions.
// Phase 1: matrix 207 rows 88 cols
[2025-06-02 09:56:40] [INFO ] Computed 22 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:56:40] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-02 09:56:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:56:40] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-02 09:56:41] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:56:41] [INFO ] Redundant transitions in 16 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-02 09:56:41] [INFO ] Invariant cache hit.
[2025-06-02 09:56:41] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:43] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:43] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:56:43] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/295 variables, 88/114 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 105/219 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 219 constraints, problems are : Problem set: 0 solved, 206 unsolved in 10097 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 88/88 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 207/295 variables, 88/114 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 105/219 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 206/425 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (OVERLAPS) 0/295 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 425 constraints, problems are : Problem set: 0 solved, 206 unsolved in 19319 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 88/88 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29535ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 29536ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/125 places, 207/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29961 ms. Remains : 88/125 places, 207/327 transitions.
[2025-06-02 09:57:10] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:57:10] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:57:10] [INFO ] Input system was already deterministic with 207 transitions.
[2025-06-02 09:57:10] [INFO ] Flatten gal took : 16 ms
[2025-06-02 09:57:10] [INFO ] Flatten gal took : 15 ms
[2025-06-02 09:57:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15946601331887776481.gal : 4 ms
[2025-06-02 09:57:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9638519799824073371.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/CTLFireability15946601331887776481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9638519799824073371.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.
Detected timeout of ITS tools.
[2025-06-02 09:57:40] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:57:40] [INFO ] Applying decomposition
[2025-06-02 09:57:40] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11149731344103349105.txt' '-o' '/tmp/graph11149731344103349105.bin' '-w' '/tmp/graph11149731344103349105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11149731344103349105.bin' '-l' '-1' '-v' '-w' '/tmp/graph11149731344103349105.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:57:40] [INFO ] Decomposing Gal with order
[2025-06-02 09:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:57:40] [INFO ] Removed a total of 480 redundant transitions.
[2025-06-02 09:57:40] [INFO ] Flatten gal took : 34 ms
[2025-06-02 09:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 10 ms.
[2025-06-02 09:57:41] [INFO ] Time to serialize gal into /tmp/CTLFireability12869634868052681619.gal : 4 ms
[2025-06-02 09:57:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17262580336922911813.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/CTLFireability12869634868052681619.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17262580336922911813.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,4.81334e+08,18.6331,361292,2579,32,482945,124,393,2.0415e+06,33,431,0


Converting to forward existential form...Done !
original formula: AF(AG(((EG((((i0.i1.u2.p16==1)&&(i0.i1.u3.p19==1))||((i2.u18.p104==1)&&(i2.u19.p107==1)))) + (((i0.i0.u0.p9==1)&&(i0.i1.u4.p21==1))&&((i4...281
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((EG((((i0.i1.u2.p16==1)&&(i0.i1.u3.p19==1))||((i2.u18.p104==1)&&(i2.u19.p107==1)))) +...338
Reverse transition relation is NOT exact ! Due to transitions t152, t154, t204, t206, i0.t197, i0.t195, i0.t189, i0.t187, i0.t47, i0.i0.t40, i0.i0.t41, i0....957
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 4
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Graph (complete) has 810 edges and 125 vertex of which 123 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 102 transition count 275
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 102 transition count 275
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 44 place count 93 transition count 229
Iterating global reduction 0 with 9 rules applied. Total rules applied 53 place count 93 transition count 229
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 57 place count 89 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 89 transition count 213
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 63 place count 88 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 88 transition count 209
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 85 transition count 206
Applied a total of 72 rules in 27 ms. Remains 85 /125 variables (removed 40) and now considering 206/327 (removed 121) transitions.
// Phase 1: matrix 206 rows 85 cols
[2025-06-02 09:58:11] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:58:11] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 09:58:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:58:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-02 09:58:11] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:58:11] [INFO ] Redundant transitions in 3 ms returned []
Running 197 sub problems to find dead transitions.
[2025-06-02 09:58:11] [INFO ] Invariant cache hit.
[2025-06-02 09:58:11] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:13] [INFO ] Deduced a trap composed of 25 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 09:58:13] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:14] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:14] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 206/291 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 145 constraints, problems are : Problem set: 0 solved, 197 unsolved in 12613 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 206/291 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 197/342 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 342 constraints, problems are : Problem set: 0 solved, 197 unsolved in 14455 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27158ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 27159ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/125 places, 206/327 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27469 ms. Remains : 85/125 places, 206/327 transitions.
[2025-06-02 09:58:38] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:58:38] [INFO ] Flatten gal took : 7 ms
[2025-06-02 09:58:38] [INFO ] Input system was already deterministic with 206 transitions.
[2025-06-02 09:58:38] [INFO ] Flatten gal took : 19 ms
[2025-06-02 09:58:38] [INFO ] Flatten gal took : 11 ms
[2025-06-02 09:58:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14920576028390325837.gal : 7 ms
[2025-06-02 09:58:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5232080996666328476.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14920576028390325837.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5232080996666328476.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 30886 steps (3014 resets) in 228 ms. (134 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-11-CTLFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 122 transition count 327
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 104 transition count 277
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 104 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 95 transition count 231
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 95 transition count 231
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 91 transition count 215
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 91 transition count 215
Applied a total of 65 rules in 10 ms. Remains 91 /125 variables (removed 34) and now considering 215/327 (removed 112) transitions.
// Phase 1: matrix 215 rows 91 cols
[2025-06-02 09:58:38] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:58:38] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 09:58:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:58:38] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-02 09:58:39] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-02 09:58:39] [INFO ] Invariant cache hit.
[2025-06-02 09:58:39] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:42] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:42] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12991 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:58:59] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 433 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43081ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 43082ms
Starting structural reductions in LTL mode, iteration 1 : 91/125 places, 215/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43443 ms. Remains : 91/125 places, 215/327 transitions.
[2025-06-02 09:59:22] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:59:22] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:59:22] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-02 09:59:22] [INFO ] Flatten gal took : 12 ms
[2025-06-02 09:59:22] [INFO ] Flatten gal took : 13 ms
[2025-06-02 09:59:22] [INFO ] Time to serialize gal into /tmp/CTLFireability594502241704192290.gal : 4 ms
[2025-06-02 09:59:22] [INFO ] Time to serialize properties into /tmp/CTLFireability16423910116245018299.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/CTLFireability594502241704192290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16423910116245018299.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.
Detected timeout of ITS tools.
[2025-06-02 09:59:52] [INFO ] Flatten gal took : 8 ms
[2025-06-02 09:59:52] [INFO ] Applying decomposition
[2025-06-02 09:59:52] [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/graph2801583768801976902.txt' '-o' '/tmp/graph2801583768801976902.bin' '-w' '/tmp/graph2801583768801976902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2801583768801976902.bin' '-l' '-1' '-v' '-w' '/tmp/graph2801583768801976902.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:59:52] [INFO ] Decomposing Gal with order
[2025-06-02 09:59:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:59:52] [INFO ] Removed a total of 422 redundant transitions.
[2025-06-02 09:59:52] [INFO ] Flatten gal took : 36 ms
[2025-06-02 09:59:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 25 ms.
[2025-06-02 09:59:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11922371469632904758.gal : 4 ms
[2025-06-02 09:59:52] [INFO ] Time to serialize properties into /tmp/CTLFireability1439442300953011208.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/CTLFireability11922371469632904758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1439442300953011208.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,8.86411e+08,26.1551,470056,2658,74,624768,316,295,2.71965e+06,75,1775,0


Converting to forward existential form...Done !
original formula: EF(EG(EX((((i0.i1.u0.p9==0)||(i0.i1.u6.p43==0))||((i3.u22.p133==0)||(i3.u26.p144==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),EX((((i0.i1.u0.p9==0)||(i0.i1.u6.p43==0))||((i3.u22.p133==0)||(i3.u26.p144==0)))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions i0.t212, i0.t210, i0.t208, i0.t206, i0.t53, i0.i0.t58, i0.i0.t213, i0.i0.u1.t44, i0.i0.u1.t63...1074
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 122 transition count 327
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 105 transition count 283
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 105 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 97 transition count 243
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 97 transition count 243
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 93 transition count 227
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 93 transition count 227
Applied a total of 61 rules in 8 ms. Remains 93 /125 variables (removed 32) and now considering 227/327 (removed 100) transitions.
// Phase 1: matrix 227 rows 93 cols
[2025-06-02 10:00:22] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:00:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 10:00:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:00:22] [INFO ] State equation strengthened by 109 read => feed constraints.
[2025-06-02 10:00:22] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2025-06-02 10:00:22] [INFO ] Invariant cache hit.
[2025-06-02 10:00:22] [INFO ] State equation strengthened by 109 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:25] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:25] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:26] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:26] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:26] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:26] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 227/320 variables, 93/119 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 109/228 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 228 constraints, problems are : Problem set: 0 solved, 226 unsolved in 11557 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:36] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/320 variables, 93/120 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 109/229 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 226/455 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:54] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:54] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 5 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/320 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 457 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41696ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 41698ms
Starting structural reductions in LTL mode, iteration 1 : 93/125 places, 227/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42090 ms. Remains : 93/125 places, 227/327 transitions.
[2025-06-02 10:01:04] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:01:04] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:01:04] [INFO ] Input system was already deterministic with 227 transitions.
[2025-06-02 10:01:04] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:01:04] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:01:04] [INFO ] Time to serialize gal into /tmp/CTLFireability475143138297042639.gal : 2 ms
[2025-06-02 10:01:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9154614631968017153.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/CTLFireability475143138297042639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9154614631968017153.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-02 10:01:34] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:01:34] [INFO ] Applying decomposition
[2025-06-02 10:01:34] [INFO ] Flatten gal took : 7 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/graph17792607657390703517.txt' '-o' '/tmp/graph17792607657390703517.bin' '-w' '/tmp/graph17792607657390703517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17792607657390703517.bin' '-l' '-1' '-v' '-w' '/tmp/graph17792607657390703517.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:01:34] [INFO ] Decomposing Gal with order
[2025-06-02 10:01:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:01:34] [INFO ] Removed a total of 442 redundant transitions.
[2025-06-02 10:01:34] [INFO ] Flatten gal took : 22 ms
[2025-06-02 10:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2025-06-02 10:01:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17530033824686658077.gal : 3 ms
[2025-06-02 10:01:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13933298613415307095.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/CTLFireability17530033824686658077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13933298613415307095.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.03258e+09,26.9284,415428,3018,114,558002,796,361,2.36178e+06,95,5945,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 122 transition count 327
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 104 transition count 277
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 104 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 95 transition count 231
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 95 transition count 231
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 91 transition count 215
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 91 transition count 215
Applied a total of 65 rules in 6 ms. Remains 91 /125 variables (removed 34) and now considering 215/327 (removed 112) transitions.
// Phase 1: matrix 215 rows 91 cols
[2025-06-02 10:02:04] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:02:04] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-02 10:02:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:02:05] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-02 10:02:05] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-02 10:02:05] [INFO ] Invariant cache hit.
[2025-06-02 10:02:05] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:07] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:07] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 218 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9829 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/306 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 105/218 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 214/432 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:02:22] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 433 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30006 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39915ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39916ms
Starting structural reductions in LTL mode, iteration 1 : 91/125 places, 215/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40255 ms. Remains : 91/125 places, 215/327 transitions.
[2025-06-02 10:02:45] [INFO ] Flatten gal took : 8 ms
[2025-06-02 10:02:45] [INFO ] Flatten gal took : 12 ms
[2025-06-02 10:02:45] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-02 10:02:45] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:02:45] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:02:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1164899978626457363.gal : 2 ms
[2025-06-02 10:02:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1956287680760284831.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/CTLFireability1164899978626457363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1956287680760284831.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,8.86411e+08,29.7575,560808,2,52533,5,1.79901e+06,6,0,574,3.27027e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 10:03:15] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:03:15] [INFO ] Applying decomposition
[2025-06-02 10:03:15] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1333507009308743724.txt' '-o' '/tmp/graph1333507009308743724.bin' '-w' '/tmp/graph1333507009308743724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1333507009308743724.bin' '-l' '-1' '-v' '-w' '/tmp/graph1333507009308743724.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:03:15] [INFO ] Decomposing Gal with order
[2025-06-02 10:03:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:03:15] [INFO ] Removed a total of 469 redundant transitions.
[2025-06-02 10:03:15] [INFO ] Flatten gal took : 18 ms
[2025-06-02 10:03:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2025-06-02 10:03:15] [INFO ] Time to serialize gal into /tmp/CTLFireability285315556030436985.gal : 3 ms
[2025-06-02 10:03:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15040456330062709020.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/CTLFireability285315556030436985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15040456330062709020.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,8.86411e+08,25.2483,464936,2534,27,627523,125,299,2.71582e+06,36,526,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t212, i0.t210, i0.t208, i0.t206, i0.t53, i0.i0.t58, i0.i0.t213, i0.i0.u1.t44, i0.i0.u1.t63...1080
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 122 transition count 327
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 106 transition count 284
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 106 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 100 transition count 253
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 100 transition count 253
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 97 transition count 241
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 97 transition count 241
Applied a total of 53 rules in 6 ms. Remains 97 /125 variables (removed 28) and now considering 241/327 (removed 86) transitions.
// Phase 1: matrix 241 rows 97 cols
[2025-06-02 10:03:45] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:03:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 10:03:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:03:45] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-02 10:03:45] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2025-06-02 10:03:45] [INFO ] Invariant cache hit.
[2025-06-02 10:03:45] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:49] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:49] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:49] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:49] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:50] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:50] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:50] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:50] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:03:51] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/338 variables, 97/126 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 239 constraints, problems are : Problem set: 0 solved, 240 unsolved in 15343 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/338 variables, 97/126 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 113/239 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 240/479 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:10] [INFO ] Deduced a trap composed of 23 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:04:14] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:22] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:04:22] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/338 variables, and 483 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45457ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 45458ms
Starting structural reductions in LTL mode, iteration 1 : 97/125 places, 241/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45819 ms. Remains : 97/125 places, 241/327 transitions.
[2025-06-02 10:04:31] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:04:31] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:04:31] [INFO ] Input system was already deterministic with 241 transitions.
[2025-06-02 10:04:31] [INFO ] Flatten gal took : 7 ms
[2025-06-02 10:04:31] [INFO ] Flatten gal took : 7 ms
[2025-06-02 10:04:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9893880301833268151.gal : 2 ms
[2025-06-02 10:04:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7730392565423652839.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/CTLFireability9893880301833268151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7730392565423652839.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.
Detected timeout of ITS tools.
[2025-06-02 10:05:01] [INFO ] Flatten gal took : 7 ms
[2025-06-02 10:05:01] [INFO ] Applying decomposition
[2025-06-02 10:05:01] [INFO ] Flatten gal took : 7 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/graph14047156034226208026.txt' '-o' '/tmp/graph14047156034226208026.bin' '-w' '/tmp/graph14047156034226208026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14047156034226208026.bin' '-l' '-1' '-v' '-w' '/tmp/graph14047156034226208026.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:05:01] [INFO ] Decomposing Gal with order
[2025-06-02 10:05:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:05:01] [INFO ] Removed a total of 459 redundant transitions.
[2025-06-02 10:05:01] [INFO ] Flatten gal took : 29 ms
[2025-06-02 10:05:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 4 ms.
[2025-06-02 10:05:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9655131996009024522.gal : 2 ms
[2025-06-02 10:05:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5372241546966169379.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/CTLFireability9655131996009024522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5372241546966169379.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 122 transition count 327
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 110 transition count 288
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 110 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 105 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 105 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 103 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 103 transition count 256
Applied a total of 41 rules in 6 ms. Remains 103 /125 variables (removed 22) and now considering 256/327 (removed 71) transitions.
// Phase 1: matrix 256 rows 103 cols
[2025-06-02 10:05:31] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:05:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 10:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:05:31] [INFO ] State equation strengthened by 115 read => feed constraints.
[2025-06-02 10:05:31] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2025-06-02 10:05:31] [INFO ] Invariant cache hit.
[2025-06-02 10:05:31] [INFO ] State equation strengthened by 115 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:34] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:34] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:34] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:34] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:34] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:35] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:35] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:35] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:35] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:35] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:36] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:36] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:37] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:37] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:37] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:38] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:38] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 256/359 variables, 103/141 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 115/256 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:48] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:05:48] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/359 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 12 (OVERLAPS) 0/359 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 258 constraints, problems are : Problem set: 0 solved, 255 unsolved in 26218 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 256/359 variables, 103/143 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 115/258 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 255/513 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:06:12] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 514 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 103/103 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56329ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 56329ms
Starting structural reductions in LTL mode, iteration 1 : 103/125 places, 256/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56661 ms. Remains : 103/125 places, 256/327 transitions.
[2025-06-02 10:06:28] [INFO ] Flatten gal took : 7 ms
[2025-06-02 10:06:28] [INFO ] Flatten gal took : 7 ms
[2025-06-02 10:06:28] [INFO ] Input system was already deterministic with 256 transitions.
[2025-06-02 10:06:28] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:06:28] [INFO ] Flatten gal took : 7 ms
[2025-06-02 10:06:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3977472046289751510.gal : 2 ms
[2025-06-02 10:06:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7789384401189519171.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/CTLFireability3977472046289751510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7789384401189519171.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.
Detected timeout of ITS tools.
[2025-06-02 10:06:58] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:06:58] [INFO ] Applying decomposition
[2025-06-02 10:06:58] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11516514675604526324.txt' '-o' '/tmp/graph11516514675604526324.bin' '-w' '/tmp/graph11516514675604526324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11516514675604526324.bin' '-l' '-1' '-v' '-w' '/tmp/graph11516514675604526324.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:06:58] [INFO ] Decomposing Gal with order
[2025-06-02 10:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:06:58] [INFO ] Removed a total of 423 redundant transitions.
[2025-06-02 10:06:58] [INFO ] Flatten gal took : 27 ms
[2025-06-02 10:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 5 ms.
[2025-06-02 10:06:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16024267695920773536.gal : 3 ms
[2025-06-02 10:06:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3241100368610079567.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/CTLFireability16024267695920773536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3241100368610079567.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 122 transition count 327
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 105 transition count 279
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 105 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 97 transition count 238
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 97 transition count 238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 94 transition count 226
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 94 transition count 226
Applied a total of 59 rules in 6 ms. Remains 94 /125 variables (removed 31) and now considering 226/327 (removed 101) transitions.
// Phase 1: matrix 226 rows 94 cols
[2025-06-02 10:07:28] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:28] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-02 10:07:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:07:28] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-02 10:07:28] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 10:07:28] [INFO ] Invariant cache hit.
[2025-06-02 10:07:28] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:30] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:31] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:07:31] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/320 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 225 constraints, problems are : Problem set: 0 solved, 225 unsolved in 11535 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/320 variables, 94/117 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 225/450 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 450 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41624ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 41625ms
Starting structural reductions in LTL mode, iteration 1 : 94/125 places, 226/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41929 ms. Remains : 94/125 places, 226/327 transitions.
[2025-06-02 10:08:10] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:08:10] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:08:10] [INFO ] Input system was already deterministic with 226 transitions.
[2025-06-02 10:08:10] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:08:10] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:08:10] [INFO ] Time to serialize gal into /tmp/CTLFireability12798758596953998985.gal : 2 ms
[2025-06-02 10:08:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6055074775865316270.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/CTLFireability12798758596953998985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6055074775865316270.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.
Detected timeout of ITS tools.
[2025-06-02 10:08:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:08:40] [INFO ] Applying decomposition
[2025-06-02 10:08:40] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15388648307544653592.txt' '-o' '/tmp/graph15388648307544653592.bin' '-w' '/tmp/graph15388648307544653592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15388648307544653592.bin' '-l' '-1' '-v' '-w' '/tmp/graph15388648307544653592.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:08:40] [INFO ] Decomposing Gal with order
[2025-06-02 10:08:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:08:40] [INFO ] Removed a total of 491 redundant transitions.
[2025-06-02 10:08:40] [INFO ] Flatten gal took : 16 ms
[2025-06-02 10:08:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 3 ms.
[2025-06-02 10:08:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11189628130768920947.gal : 2 ms
[2025-06-02 10:08:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16809606208942803254.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/CTLFireability11189628130768920947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16809606208942803254.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.23639e+09,24.9188,443540,2541,74,560051,621,314,2.38828e+06,52,3851,0


Converting to forward existential form...Done !
original formula: EF((((i1.u7.p40==1)||((i2.i0.u12.p67==1)&&(i2.i1.u13.p70==1))) + (((AX(FALSE) * (i1.u0.p9==1)) * ((i1.u6.p43==1)&&(i3.i1.u16.p97==1))) * ...257
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * ((i1.u7.p40==1)||((i2.i0.u12.p67==1)&&(i2.i1.u13.p70==1))))] != FALSE + [((((FwdU(Init,TRUE...346
(forward)formula 0,1,25.0239,443540,1,0,560051,621,330,2.38828e+06,57,3851,3212
FORMULA MedleyA-PT-11-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 327/327 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 327
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 105 transition count 277
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 105 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 96 transition count 231
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 96 transition count 231
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 92 transition count 215
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 92 transition count 215
Applied a total of 64 rules in 5 ms. Remains 92 /125 variables (removed 33) and now considering 215/327 (removed 112) transitions.
// Phase 1: matrix 215 rows 92 cols
[2025-06-02 10:09:05] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:09:05] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 10:09:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:09:05] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-06-02 10:09:05] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-06-02 10:09:05] [INFO ] Invariant cache hit.
[2025-06-02 10:09:05] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:09] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:09] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/307 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 220 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12605 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/307 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 105/220 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 214/434 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:09:27] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 435 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42688ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 42689ms
Starting structural reductions in LTL mode, iteration 1 : 92/125 places, 215/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42957 ms. Remains : 92/125 places, 215/327 transitions.
[2025-06-02 10:09:48] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:09:48] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:09:48] [INFO ] Input system was already deterministic with 215 transitions.
[2025-06-02 10:09:48] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:09:48] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:09:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17206280415371650511.gal : 2 ms
[2025-06-02 10:09:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7123965481600794704.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/CTLFireability17206280415371650511.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7123965481600794704.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,8.86411e+08,28.2683,553608,2,54559,5,1.81906e+06,6,0,576,3.03518e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 10:10:18] [INFO ] Flatten gal took : 6 ms
[2025-06-02 10:10:18] [INFO ] Applying decomposition
[2025-06-02 10:10:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1100703220643854880.txt' '-o' '/tmp/graph1100703220643854880.bin' '-w' '/tmp/graph1100703220643854880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1100703220643854880.bin' '-l' '-1' '-v' '-w' '/tmp/graph1100703220643854880.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:10:18] [INFO ] Decomposing Gal with order
[2025-06-02 10:10:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:10:18] [INFO ] Removed a total of 477 redundant transitions.
[2025-06-02 10:10:18] [INFO ] Flatten gal took : 16 ms
[2025-06-02 10:10:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2025-06-02 10:10:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3343367524547428171.gal : 2 ms
[2025-06-02 10:10:18] [INFO ] Time to serialize properties into /tmp/CTLFireability4275748896658677243.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/CTLFireability3343367524547428171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4275748896658677243.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,8.86411e+08,6.30145,123876,2664,39,180418,186,328,539265,41,629,0


Converting to forward existential form...Done !
original formula: A(!(E(AG((E(((i3.u18.p105==1)&&(i3.u19.p108==1)) U (((i0.i1.u0.p9==1)&&(i0.i1.u7.p43==1))&&((i5.u24.p133==1)&&(i5.u28.p144==1)))) + AX(((...346
=> equivalent forward existential formula: [((Init * !(EG(!((((i5.u25.p7==1)&&(i5.u28.p10==1))&&((i1.u8.p53==1)&&(i2.u10.p59==1))))))) * !(E(!((((i5.u25.p7...581
Reverse transition relation is NOT exact ! Due to transitions t11, t32, t161, t163, t165, t167, t195, t197, t199, t201, i0.t212, i0.t210, i0.t208, i0.t206,...936
Detected timeout of ITS tools.
[2025-06-02 10:10:48] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:10:48] [INFO ] Flatten gal took : 10 ms
[2025-06-02 10:10:48] [INFO ] Applying decomposition
[2025-06-02 10:10:48] [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/graph4622893202386094129.txt' '-o' '/tmp/graph4622893202386094129.bin' '-w' '/tmp/graph4622893202386094129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4622893202386094129.bin' '-l' '-1' '-v' '-w' '/tmp/graph4622893202386094129.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:10:48] [INFO ] Decomposing Gal with order
[2025-06-02 10:10:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:10:48] [INFO ] Removed a total of 575 redundant transitions.
[2025-06-02 10:10:48] [INFO ] Flatten gal took : 25 ms
[2025-06-02 10:10:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 94 labels/synchronizations in 3 ms.
[2025-06-02 10:10:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8363360963165499652.gal : 3 ms
[2025-06-02 10:10:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7739317251204946856.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/CTLFireability8363360963165499652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7739317251204946856.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 9 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.0231e+10,523.139,3592028,38016,6824,4.18528e+06,116761,502,2.04658e+07,239,3.27499e+06,0


Converting to forward existential form...Done !
original formula: AF((AG(((((i5.u12.p97==0)||(i5.u19.p131==0))||((i6.u20.p133==0)||(i6.u23.p142==0)))||((i3.u6.p53==0)||(i3.u11.p86==0)))) + (i5.u17.p113==...159
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((((i5.u12.p97==0)||(i5.u19.p131==0))||((i6.u20.p133==0)||(i6.u23.p142==0)))||((i3.u6...216
Reverse transition relation is NOT exact ! Due to transitions t28, t67, t106, t127, t134, t139, t142, t157, t160, t178, t180, t182, t183, t203, t209, t215,...1664
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2025-06-02 10:29:07] [INFO ] Applying decomposition
[2025-06-02 10:29:07] [INFO ] Flatten gal took : 9 ms
[2025-06-02 10:29:07] [INFO ] Decomposing Gal with order
[2025-06-02 10:29:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:29:07] [INFO ] Removed a total of 679 redundant transitions.
[2025-06-02 10:29:07] [INFO ] Flatten gal took : 25 ms
[2025-06-02 10:29:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 4 ms.
[2025-06-02 10:29:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14120032946769281364.gal : 3 ms
[2025-06-02 10:29:07] [INFO ] Time to serialize properties into /tmp/CTLFireability1589940080235107790.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/CTLFireability14120032946769281364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1589940080235107790.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 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="MedleyA-PT-11"
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 MedleyA-PT-11, 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 r128-smll-174876524100178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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