Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 82K 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-07-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-07-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-07-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748848038080

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 07:07:20] [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 07:07:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:07:20] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2025-06-02 07:07:20] [INFO ] Transformed 145 places.
[2025-06-02 07:07:20] [INFO ] Transformed 287 transitions.
[2025-06-02 07:07:20] [INFO ] Found NUPN structural information;
[2025-06-02 07:07:20] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 2 transitions.
Support contains 90 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 128 transition count 272
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 128 transition count 272
Applied a total of 28 rules in 54 ms. Remains 128 /143 variables (removed 15) and now considering 272/285 (removed 13) transitions.
// Phase 1: matrix 272 rows 128 cols
[2025-06-02 07:07:21] [INFO ] Computed 10 invariants in 37 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:21] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-06-02 07:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:07:22] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-02 07:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/128 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:28] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:28] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:29] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 9/19 constraints. Problems are: Problem set: 48 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:32] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/24 constraints. Problems are: Problem set: 48 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 48 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 272/400 variables, 128/152 constraints. Problems are: Problem set: 48 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:40] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 1/153 constraints. Problems are: Problem set: 48 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:44] [INFO ] Deduced a trap along path composed of 2 places in 48 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 1/154 constraints. Problems are: Problem set: 48 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:50] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:52] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/400 variables, and 156 constraints, problems are : Problem set: 48 solved, 223 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 48 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 14/24 constraints. Problems are: Problem set: 48 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 48 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 272/400 variables, 128/152 constraints. Problems are: Problem set: 48 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 223/375 constraints. Problems are: Problem set: 48 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:59] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:07:59] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:00] [INFO ] Deduced a trap composed of 33 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:00] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:02] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:02] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 6/381 constraints. Problems are: Problem set: 48 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:11] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:12] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 2/383 constraints. Problems are: Problem set: 48 solved, 223 unsolved
SMT process timed out in 60670ms, After SMT, problems are : Problem set: 48 solved, 223 unsolved
Search for dead transitions found 48 dead transitions in 60720ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 128/143 places, 224/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61730 ms. Remains : 128/143 places, 224/285 transitions.
Support contains 90 out of 128 places after structural reductions.
[2025-06-02 07:08:23] [INFO ] Flatten gal took : 90 ms
[2025-06-02 07:08:23] [INFO ] Flatten gal took : 43 ms
[2025-06-02 07:08:23] [INFO ] Input system was already deterministic with 224 transitions.
Support contains 89 out of 128 places (down from 90) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 100 to 98
RANDOM walk for 40000 steps (1406 resets) in 2853 ms. (14 steps per ms) remains 60/98 properties
BEST_FIRST walk for 4001 steps (32 resets) in 66 ms. (59 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (32 resets) in 53 ms. (74 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (33 resets) in 46 ms. (85 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (32 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (33 resets) in 58 ms. (67 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (33 resets) in 49 ms. (80 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (29 resets) in 22 ms. (174 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (34 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (30 resets) in 18 ms. (210 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (27 resets) in 18 ms. (210 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4002 steps (31 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (32 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (33 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (34 resets) in 57 ms. (69 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (28 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (33 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (33 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (31 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (34 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (34 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (30 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (28 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (31 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (33 resets) in 64 ms. (61 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (30 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (31 resets) in 37 ms. (105 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (30 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (32 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (33 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (30 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (34 resets) in 52 ms. (75 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (31 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (29 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (32 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (30 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (31 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (31 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (33 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (29 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (34 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
// Phase 1: matrix 224 rows 128 cols
[2025-06-02 07:08:25] [INFO ] Computed 10 invariants in 7 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp98 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/88 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 49 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 3 (OVERLAPS) 31/119 variables, 6/10 constraints. Problems are: Problem set: 18 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:25] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 27 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 07:08:26] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/15 constraints. Problems are: Problem set: 18 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:26] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:27] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 7 ms to minimize.
Problem AtomicPropp67 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 4/19 constraints. Problems are: Problem set: 19 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:27] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 1/20 constraints. Problems are: Problem set: 19 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/20 constraints. Problems are: Problem set: 19 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 214/333 variables, 119/139 constraints. Problems are: Problem set: 19 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:28] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 1/140 constraints. Problems are: Problem set: 19 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/140 constraints. Problems are: Problem set: 19 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 15/348 variables, 6/146 constraints. Problems are: Problem set: 19 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:29] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 13 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 1/147 constraints. Problems are: Problem set: 19 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 0/147 constraints. Problems are: Problem set: 19 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 4/352 variables, 3/150 constraints. Problems are: Problem set: 19 solved, 40 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/352 variables, and 150 constraints, problems are : Problem set: 19 solved, 40 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 19 solved, 40 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 40 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/82 variables, 4/4 constraints. Problems are: Problem set: 20 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 20 solved, 39 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 3 (OVERLAPS) 37/119 variables, 6/10 constraints. Problems are: Problem set: 23 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 11/21 constraints. Problems are: Problem set: 23 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:30] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:30] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/23 constraints. Problems are: Problem set: 23 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:31] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 1/24 constraints. Problems are: Problem set: 23 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/24 constraints. Problems are: Problem set: 23 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 214/333 variables, 119/143 constraints. Problems are: Problem set: 23 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 35/178 constraints. Problems are: Problem set: 23 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 1/179 constraints. Problems are: Problem set: 23 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:34] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/352 variables, and 180 constraints, problems are : Problem set: 23 solved, 36 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 119/128 constraints, PredecessorRefiner: 35/59 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10139ms problems are : Problem set: 23 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 224/224 transitions.
Graph (complete) has 397 edges and 128 vertex of which 123 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 123 transition count 206
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 23 place count 117 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 116 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 24 place count 116 transition count 200
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 34 place count 111 transition count 200
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 46 place count 99 transition count 186
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 99 transition count 186
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 78 place count 89 transition count 176
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 90 place count 83 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 94 place count 83 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 119 place count 83 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 121 place count 83 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 123 place count 81 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 123 place count 81 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 125 place count 80 transition count 163
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 128 place count 80 transition count 160
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 131 place count 77 transition count 160
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 136 place count 77 transition count 160
Applied a total of 136 rules in 135 ms. Remains 77 /128 variables (removed 51) and now considering 160/224 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 77/128 places, 160/224 transitions.
RANDOM walk for 40000 steps (4031 resets) in 1265 ms. (31 steps per ms) remains 14/36 properties
BEST_FIRST walk for 40002 steps (1286 resets) in 246 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1039 resets) in 156 ms. (254 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40002 steps (1141 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1061 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1182 resets) in 147 ms. (270 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (1168 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1260 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1024 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1096 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1065 resets) in 77 ms. (512 steps per ms) remains 6/8 properties
// Phase 1: matrix 160 rows 77 cols
[2025-06-02 07:08:36] [INFO ] Computed 8 invariants in 4 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 155/223 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 12/235 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2/237 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 85 constraints, problems are : Problem set: 0 solved, 6 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 27/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 26/68 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 155/223 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:08:37] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 12/235 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 2/237 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/237 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 92 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1642 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2510ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 14366 steps, including 482 resets, run visited all 6 properties in 93 ms. (steps per millisecond=154 )
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 6 properties in 109 ms.
Successfully simplified 24 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-07-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 07:08:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 07:08:38] [INFO ] Flatten gal took : 23 ms
FORMULA MedleyA-PT-07-CTLFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 07:08:38] [INFO ] Flatten gal took : 21 ms
[2025-06-02 07:08:39] [INFO ] Input system was already deterministic with 224 transitions.
Support contains 65 out of 128 places (down from 70) after GAL structural reductions.
Computed a total of 14 stabilizing places and 16 stable transitions
Graph (complete) has 397 edges and 128 vertex of which 123 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Graph (complete) has 397 edges and 128 vertex of which 123 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 122 transition count 204
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 107 transition count 200
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 105 transition count 198
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 40 place count 105 transition count 193
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 100 transition count 193
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 72 place count 78 transition count 164
Iterating global reduction 3 with 22 rules applied. Total rules applied 94 place count 78 transition count 164
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 120 place count 64 transition count 152
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 63 transition count 150
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 63 transition count 150
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 3 with 2 rules applied. Total rules applied 124 place count 62 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 131 place count 62 transition count 142
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 134 place count 62 transition count 139
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 59 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 137 place count 59 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 141 place count 57 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 55 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 54 transition count 134
Applied a total of 146 rules in 65 ms. Remains 54 /128 variables (removed 74) and now considering 134/224 (removed 90) transitions.
// Phase 1: matrix 134 rows 54 cols
[2025-06-02 07:08:39] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:39] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 07:08:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:08:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:08:39] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:08:39] [INFO ] Redundant transitions in 33 ms returned []
Running 124 sub problems to find dead transitions.
[2025-06-02 07:08:39] [INFO ] Invariant cache hit.
[2025-06-02 07:08:39] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 134/188 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 72 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5755 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 134/188 variables, 54/60 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 124/196 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 196 constraints, problems are : Problem set: 0 solved, 124 unsolved in 10272 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16097ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 16099ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/128 places, 134/224 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16429 ms. Remains : 54/128 places, 134/224 transitions.
[2025-06-02 07:08:55] [INFO ] Flatten gal took : 24 ms
[2025-06-02 07:08:55] [INFO ] Flatten gal took : 20 ms
[2025-06-02 07:08:55] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-02 07:08:55] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:08:55] [INFO ] Flatten gal took : 21 ms
[2025-06-02 07:08:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8678339723675601332.gal : 9 ms
[2025-06-02 07:08:55] [INFO ] Time to serialize properties into /tmp/CTLFireability7763294667102122407.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8678339723675601332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7763294667102122407.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06164e+06,0.353262,9596,2,639,5,23178,6,0,339,28067,0


Converting to forward existential form...Done !
original formula: AF(EG((((p20!=1)||(p58!=1))||((p79!=1)||(p95!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((p20!=1)||(p58!=1))||((p79!=1)||(p95!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t28, t29, t122, t124, Intersection with ...236
(forward)formula 0,1,28.2762,672868,1,0,745,4.18485e+06,294,306,3210,3.92528e+06,928
FORMULA MedleyA-PT-07-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 107 transition count 199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 107 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 106 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 106 transition count 197
Applied a total of 44 rules in 11 ms. Remains 106 /128 variables (removed 22) and now considering 197/224 (removed 27) transitions.
// Phase 1: matrix 197 rows 106 cols
[2025-06-02 07:09:24] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 07:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:09:24] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2025-06-02 07:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:27] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:27] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:27] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:27] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:27] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:27] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:28] [INFO ] Deduced a trap composed of 14 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 07:09:28] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:33] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:34] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 126 constraints, problems are : Problem set: 0 solved, 196 unsolved in 20279 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 196/320 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:49] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:49] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:09:53] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 325 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 50374ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 50375ms
Starting structural reductions in LTL mode, iteration 1 : 106/128 places, 197/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50620 ms. Remains : 106/128 places, 197/224 transitions.
[2025-06-02 07:10:14] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:10:14] [INFO ] Flatten gal took : 20 ms
[2025-06-02 07:10:14] [INFO ] Input system was already deterministic with 197 transitions.
[2025-06-02 07:10:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 07:10:14] [INFO ] Flatten gal took : 17 ms
[2025-06-02 07:10:14] [INFO ] Time to serialize gal into /tmp/CTLFireability11768996161863911851.gal : 8 ms
[2025-06-02 07:10:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15328010698277302949.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/CTLFireability11768996161863911851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15328010698277302949.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AX((EG((((p20==0)||(p58==0))||((p79==0)||(p95==0)))) * (((EX((((p20==1)&&(p32==1))&&((p79==1)&&(p117==1)))) * EG((p131==1))) + (p139=...209
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((EG((((p20==0)||(p58==0))||((p79==0)||(p95==0)))) * (((EX((((p20==1)&&(p32==1))&&((p...304
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...499
Detected timeout of ITS tools.
[2025-06-02 07:10:45] [INFO ] Flatten gal took : 20 ms
[2025-06-02 07:10:45] [INFO ] Applying decomposition
[2025-06-02 07:10:45] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1578191097522701969.txt' '-o' '/tmp/graph1578191097522701969.bin' '-w' '/tmp/graph1578191097522701969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1578191097522701969.bin' '-l' '-1' '-v' '-w' '/tmp/graph1578191097522701969.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:10:45] [INFO ] Decomposing Gal with order
[2025-06-02 07:10:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:10:45] [INFO ] Removed a total of 271 redundant transitions.
[2025-06-02 07:10:45] [INFO ] Flatten gal took : 122 ms
[2025-06-02 07:10:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 44 ms.
[2025-06-02 07:10:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16133455725727858098.gal : 19 ms
[2025-06-02 07:10:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2280998671479780531.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/CTLFireability16133455725727858098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2280998671479780531.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.78841e+07,0.693897,21228,471,86,29047,1051,380,98626,91,5142,0


Converting to forward existential form...Done !
original formula: EF((AX((EG((((i3.u3.p20==0)||(i3.u3.p58==0))||((i6.i0.u15.p79==0)||(i5.u19.p95==0)))) * (((EX((((i3.u3.p20==1)&&(i2.u7.p32==1))&&((i6.i0....304
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((EG((((i3.u3.p20==0)||(i3.u3.p58==0))||((i6.i0.u15.p79==0)||(i5.u19.p95==0)))) * (((...399
Reverse transition relation is NOT exact ! Due to transitions t52, t75, i1.u2.t106, i1.u4.t103, i2.t95, i2.t91, i2.t90, i2.u5.t73, i2.u5.t101, i2.u5.t102, ...871
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
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 7
(forward)formula 0,1,21.2365,519464,1,0,729559,4447,2127,2.98564e+06,470,42946,475391
FORMULA MedleyA-PT-07-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 106 transition count 197
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 106 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 195
Applied a total of 46 rules in 13 ms. Remains 105 /128 variables (removed 23) and now considering 195/224 (removed 29) transitions.
// Phase 1: matrix 195 rows 105 cols
[2025-06-02 07:11:06] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:07] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 07:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:11:07] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 07:11:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:10] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:10] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:10] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:10] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:11] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:11] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:11] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:16] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:20] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:23] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/300 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 125 constraints, problems are : Problem set: 0 solved, 194 unsolved in 26895 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:38] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:11:38] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:00] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 5 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/300 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 322 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 56980ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 56981ms
Starting structural reductions in LTL mode, iteration 1 : 105/128 places, 195/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57310 ms. Remains : 105/128 places, 195/224 transitions.
[2025-06-02 07:12:04] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:12:04] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:12:04] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-02 07:12:04] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:12:04] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:12:04] [INFO ] Time to serialize gal into /tmp/CTLFireability11458571295002012029.gal : 3 ms
[2025-06-02 07:12:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12159210620334807804.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/CTLFireability11458571295002012029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12159210620334807804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX((AF(EX(EX(((p99==1)&&(p119==1))))) * (E((p128==1) U AX((p90!=1))) + ((AG((p16==1)) * (p131==0)) * ((AG((p33==1)) + (p39==0)) * (((p20=...197
=> equivalent forward existential formula: ([FwdG(EY(Init),!(EX(EX(((p99==1)&&(p119==1))))))] = FALSE * (([(FwdU((EY(Init) * !(E((p128==1) U !(EX(!((p90!=1...495
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...468
(forward)formula 0,1,7.18985,135388,1,0,526,624901,428,231,4950,624068,537
FORMULA MedleyA-PT-07-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 105 transition count 196
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 104 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 104 transition count 194
Applied a total of 48 rules in 9 ms. Remains 104 /128 variables (removed 24) and now considering 194/224 (removed 30) transitions.
// Phase 1: matrix 194 rows 104 cols
[2025-06-02 07:12:11] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:12:11] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-02 07:12:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:12:11] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 07:12:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:14] [INFO ] Deduced a trap composed of 21 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 07:12:14] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:15] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:15] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:15] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:15] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:21] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:25] [INFO ] Deduced a trap along path composed of 2 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 122 constraints, problems are : Problem set: 0 solved, 193 unsolved in 22979 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:38] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:12:47] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 317 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53068ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 53069ms
Starting structural reductions in LTL mode, iteration 1 : 104/128 places, 194/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53311 ms. Remains : 104/128 places, 194/224 transitions.
[2025-06-02 07:13:04] [INFO ] Flatten gal took : 18 ms
[2025-06-02 07:13:04] [INFO ] Flatten gal took : 16 ms
[2025-06-02 07:13:05] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 07:13:05] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:13:05] [INFO ] Flatten gal took : 14 ms
[2025-06-02 07:13:05] [INFO ] Time to serialize gal into /tmp/CTLFireability2400727937654034644.gal : 3 ms
[2025-06-02 07:13:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14913098555040971251.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/CTLFireability2400727937654034644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14913098555040971251.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: A(!(EX(!(EX((p97==1))))) U (p128==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p128==1))))) * !(E(!((p128==1)) U (!(!(EX(!(EX((p97==1)))))) * !((p128==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...451
Detected timeout of ITS tools.
[2025-06-02 07:13:35] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:13:35] [INFO ] Applying decomposition
[2025-06-02 07:13:35] [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/graph16094295977167444973.txt' '-o' '/tmp/graph16094295977167444973.bin' '-w' '/tmp/graph16094295977167444973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16094295977167444973.bin' '-l' '-1' '-v' '-w' '/tmp/graph16094295977167444973.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:13:35] [INFO ] Decomposing Gal with order
[2025-06-02 07:13:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:13:35] [INFO ] Removed a total of 262 redundant transitions.
[2025-06-02 07:13:35] [INFO ] Flatten gal took : 25 ms
[2025-06-02 07:13:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2025-06-02 07:13:35] [INFO ] Time to serialize gal into /tmp/CTLFireability4673420714876562364.gal : 9 ms
[2025-06-02 07:13:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2750925351582603455.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/CTLFireability4673420714876562364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2750925351582603455.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.55422e+07,0.204712,9536,388,78,10606,757,311,22851,81,2984,0


Converting to forward existential form...Done !
original formula: A(!(EX(!(EX((i5.u17.p97==1))))) U (i7.u26.p128==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i7.u26.p128==1))))) * !(E(!((i7.u26.p128==1)) U (!(!(EX(!(EX((i5.u17.p97==1)))))) * !((i7.u26....178
Reverse transition relation is NOT exact ! Due to transitions t34, t72, i1.u2.t103, i1.u4.t100, i2.t87, i2.u5.t70, i2.u5.t98, i2.u5.t99, i2.u6.t91, i2.u6.t...749
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
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 7
(forward)formula 0,0,10.3851,283824,1,0,415729,3150,1858,1.4379e+06,411,24620,307371
FORMULA MedleyA-PT-07-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 105 transition count 196
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 104 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 104 transition count 194
Applied a total of 48 rules in 6 ms. Remains 104 /128 variables (removed 24) and now considering 194/224 (removed 30) transitions.
[2025-06-02 07:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:13:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 07:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:13:45] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 07:13:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:48] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:48] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:48] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:49] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:49] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:49] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:54] [INFO ] Deduced a trap along path composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:13:58] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 122 constraints, problems are : Problem set: 0 solved, 193 unsolved in 24006 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:13] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:24] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 317 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54100ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 54100ms
Starting structural reductions in LTL mode, iteration 1 : 104/128 places, 194/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54331 ms. Remains : 104/128 places, 194/224 transitions.
[2025-06-02 07:14:40] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:14:40] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:14:40] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 07:14:40] [INFO ] Flatten gal took : 13 ms
[2025-06-02 07:14:40] [INFO ] Flatten gal took : 12 ms
[2025-06-02 07:14:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4116487463477123270.gal : 4 ms
[2025-06-02 07:14:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15234208159888234165.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/CTLFireability4116487463477123270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15234208159888234165.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AX(AF(AX(AG((((p20==1)&&(p32==1))&&((p71==1)&&(p84==1))))))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(!(EX(!(!(E(TRUE U !((((p20==1)&&(p32==1))&&((p71==1)&&(p84==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...451
(forward)formula 0,0,5.56183,114920,1,0,396,490395,416,145,5046,482883,444
FORMULA MedleyA-PT-07-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 107 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 107 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 106 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 106 transition count 196
Applied a total of 44 rules in 5 ms. Remains 106 /128 variables (removed 22) and now considering 196/224 (removed 28) transitions.
// Phase 1: matrix 196 rows 106 cols
[2025-06-02 07:14:45] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:14:46] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-02 07:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:14:46] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 07:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:49] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:49] [INFO ] Deduced a trap composed of 31 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 07:14:49] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:49] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:50] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:50] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:50] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:50] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/302 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:14:55] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:04] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/302 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/302 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 126 constraints, problems are : Problem set: 0 solved, 195 unsolved in 29083 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/302 variables, 106/124 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 195/319 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:19] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:15:20] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 323 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 59175ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 59176ms
Starting structural reductions in LTL mode, iteration 1 : 106/128 places, 196/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59699 ms. Remains : 106/128 places, 196/224 transitions.
[2025-06-02 07:15:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:15:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:15:45] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-02 07:15:45] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:15:45] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:15:45] [INFO ] Time to serialize gal into /tmp/CTLFireability13611738323594754276.gal : 2 ms
[2025-06-02 07:15:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13528892378660023625.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/CTLFireability13611738323594754276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13528892378660023625.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EG((((p20==1)&&(p38==1))&&(p54==1))) + AG((AF((AX((((p20==0)||(p58==0))||((p79==0)||(p95==0)))) * AX((p77==0)))) + EX(((AX((p61==1)) + A...231
=> equivalent forward existential formula: [FwdG((FwdU((Init * !(EG((((p20==1)&&(p38==1))&&(p54==1))))),TRUE) * !(EX(((!(EX(!((p61==1)))) + !((E(!((p106==1...354
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...484
Detected timeout of ITS tools.
[2025-06-02 07:16:15] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:16:15] [INFO ] Applying decomposition
[2025-06-02 07:16:15] [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/graph15953473559827450720.txt' '-o' '/tmp/graph15953473559827450720.bin' '-w' '/tmp/graph15953473559827450720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15953473559827450720.bin' '-l' '-1' '-v' '-w' '/tmp/graph15953473559827450720.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:16:15] [INFO ] Decomposing Gal with order
[2025-06-02 07:16:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:16:15] [INFO ] Removed a total of 303 redundant transitions.
[2025-06-02 07:16:15] [INFO ] Flatten gal took : 20 ms
[2025-06-02 07:16:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 5 ms.
[2025-06-02 07:16:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16911939819330357646.gal : 2 ms
[2025-06-02 07:16:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10724783486993698094.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/CTLFireability16911939819330357646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10724783486993698094.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.79091e+07,0.338844,13368,412,111,16507,795,374,46684,94,4609,0


Converting to forward existential form...Done !
original formula: (EG((((i3.u3.p20==1)&&(i2.u5.p38==1))&&(i3.u13.p54==1))) + AG((AF((AX((((i3.u3.p20==0)||(i3.u3.p58==0))||((i6.u16.p79==0)||(i5.u20.p95==0...329
=> equivalent forward existential formula: [FwdG((FwdU((Init * !(EG((((i3.u3.p20==1)&&(i2.u5.p38==1))&&(i3.u13.p54==1))))),TRUE) * !(EX(((!(EX(!((i0.u14.p6...466
Reverse transition relation is NOT exact ! Due to transitions t34, t73, i1.u2.t105, i1.u4.t101, i2.t94, i2.t93, i2.t92, i2.t89, i2.t88, i2.u5.t96, i2.u5.t9...783
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
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
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 7
(forward)formula 0,1,17.6147,371740,1,0,547255,4316,2540,1.97594e+06,502,38405,386696
FORMULA MedleyA-PT-07-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 106 transition count 197
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 106 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 195
Applied a total of 46 rules in 5 ms. Remains 105 /128 variables (removed 23) and now considering 195/224 (removed 29) transitions.
// Phase 1: matrix 195 rows 105 cols
[2025-06-02 07:16:33] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:16:33] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 07:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:16:33] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-06-02 07:16:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:36] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:36] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:36] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:36] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:36] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:37] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:37] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:40] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:16:45] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 124 constraints, problems are : Problem set: 0 solved, 194 unsolved in 22922 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/316 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:07] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:07] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:12] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:17:19] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 300/300 variables, and 322 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53024ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 53025ms
Starting structural reductions in LTL mode, iteration 1 : 105/128 places, 195/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53328 ms. Remains : 105/128 places, 195/224 transitions.
[2025-06-02 07:17:26] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:17:26] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:17:26] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-02 07:17:26] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:17:26] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:17:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13088802088173358312.gal : 2 ms
[2025-06-02 07:17:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1635787246325827460.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/CTLFireability13088802088173358312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1635787246325827460.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(EX(EF(!((((p79==1)&&(p117==1))&&(p136==1))))) U E((p5==1) U (((p12==1)&&(p25==1))&&(p139==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX(E(TRUE U !((((p79==1)&&(p117==1))&&(p136==1)))))),(p5==1)) * (((p12==1)&&(p25==1))&&(p139==1...168
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t24, t25, t26, t27, t32, t33, t34, t35, t37, t38, t40, t41, t42...468
Detected timeout of ITS tools.
[2025-06-02 07:17:56] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:17:56] [INFO ] Applying decomposition
[2025-06-02 07:17:56] [INFO ] Flatten gal took : 5 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/graph2424843916118363744.txt' '-o' '/tmp/graph2424843916118363744.bin' '-w' '/tmp/graph2424843916118363744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2424843916118363744.bin' '-l' '-1' '-v' '-w' '/tmp/graph2424843916118363744.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:17:57] [INFO ] Decomposing Gal with order
[2025-06-02 07:17:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:17:57] [INFO ] Removed a total of 276 redundant transitions.
[2025-06-02 07:17:57] [INFO ] Flatten gal took : 56 ms
[2025-06-02 07:17:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 9 ms.
[2025-06-02 07:17:57] [INFO ] Time to serialize gal into /tmp/CTLFireability4944351354504044568.gal : 4 ms
[2025-06-02 07:17:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14961957908671784600.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/CTLFireability4944351354504044568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14961957908671784600.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61256e+07,0.370504,10636,455,98,12151,768,353,30645,78,4104,0


Converting to forward existential form...Done !
original formula: E(EX(EF(!((((i6.u16.p79==1)&&(i6.u16.p117==1))&&(i7.i0.u32.p136==1))))) U E((i3.u2.p5==1) U (((i1.u3.p12==1)&&(i1.u5.p25==1))&&(i7.i0.u33...167
=> equivalent forward existential formula: [(FwdU(FwdU(Init,EX(E(TRUE U !((((i6.u16.p79==1)&&(i6.u16.p117==1))&&(i7.i0.u32.p136==1)))))),(i3.u2.p5==1)) * (...220
Reverse transition relation is NOT exact ! Due to transitions t34, t72, i1.u3.t103, i1.u5.t100, i2.t92, i2.t88, i2.t87, i2.u6.t70, i2.u6.t98, i2.u6.t99, i2...785
(forward)formula 0,1,6.98365,166668,1,0,276843,1718,2344,822270,394,11397,326604
FORMULA MedleyA-PT-07-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 106 transition count 198
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 106 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 105 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 105 transition count 196
Applied a total of 46 rules in 5 ms. Remains 105 /128 variables (removed 23) and now considering 196/224 (removed 28) transitions.
// Phase 1: matrix 196 rows 105 cols
[2025-06-02 07:18:04] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:18:04] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 07:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:18:04] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2025-06-02 07:18:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:07] [INFO ] Deduced a trap composed of 21 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 07:18:07] [INFO ] Deduced a trap composed of 32 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 07:18:07] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:07] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:07] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:08] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:08] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:08] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/301 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:12] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:17] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 125 constraints, problems are : Problem set: 0 solved, 195 unsolved in 23771 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/301 variables, 105/123 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 195/318 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:32] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:32] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:18:36] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 323 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53883ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 53884ms
Starting structural reductions in LTL mode, iteration 1 : 105/128 places, 196/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54181 ms. Remains : 105/128 places, 196/224 transitions.
[2025-06-02 07:18:58] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:18:58] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:18:58] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-02 07:18:58] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:18:58] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:18:58] [INFO ] Time to serialize gal into /tmp/CTLFireability8434071061111256053.gal : 2 ms
[2025-06-02 07:18:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16397507111115291290.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/CTLFireability8434071061111256053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16397507111115291290.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AX(((EG((((p20==1)&&(p58==1))&&((p79==1)&&(p91==1)))) + ((p13==1)&&(p26==1))) + (((p20==1)&&(p25==1))&&(p139==1)))) + (p101==1)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(((EG((((p20==1)&&(p58==1))&&((p79==1)&&(p91==1)))) + ((p13==1)&&(p26==1))) + (((p20=...240
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...498
(forward)formula 0,1,7.16801,140640,1,0,501,681639,416,185,5029,642639,555
FORMULA MedleyA-PT-07-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 105 transition count 196
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 105 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 104 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 104 transition count 194
Applied a total of 48 rules in 6 ms. Remains 104 /128 variables (removed 24) and now considering 194/224 (removed 30) transitions.
// Phase 1: matrix 194 rows 104 cols
[2025-06-02 07:19:05] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:19:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-02 07:19:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:19:05] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 07:19:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:08] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:09] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:09] [INFO ] Deduced a trap composed of 14 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 07:19:09] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:09] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:09] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:15] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:19] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 122 constraints, problems are : Problem set: 0 solved, 193 unsolved in 24490 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:34] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:19:45] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/298 variables, and 317 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 54568ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 54569ms
Starting structural reductions in LTL mode, iteration 1 : 104/128 places, 194/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54790 ms. Remains : 104/128 places, 194/224 transitions.
[2025-06-02 07:20:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:20:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:20:00] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 07:20:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:20:00] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:20:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1284233013830291778.gal : 2 ms
[2025-06-02 07:20:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6830611148827971064.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/CTLFireability1284233013830291778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6830611148827971064.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AX(AG((((p97==1)||(p87==1))&&(((p20==0)||(p32==0))||((p79==0)||(p117==0)))))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * !((((p97==1)||(p87==1))&&(((p20==0)||(p32==0))||((p79==0)||(p117==0))))))] = FALSE
(forward)formula 0,0,2.83551,40516,1,0,12,122249,10,2,1256,172700,5
FORMULA MedleyA-PT-07-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 109 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 109 transition count 201
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 108 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 108 transition count 199
Applied a total of 40 rules in 5 ms. Remains 108 /128 variables (removed 20) and now considering 199/224 (removed 25) transitions.
// Phase 1: matrix 199 rows 108 cols
[2025-06-02 07:20:03] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:20:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 07:20:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:20:03] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-02 07:20:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:06] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:06] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:06] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:06] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:07] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/307 variables, 108/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:11] [INFO ] Deduced a trap along path composed of 2 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 125 constraints, problems are : Problem set: 0 solved, 198 unsolved in 17686 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/307 variables, 108/124 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 198/322 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:24] [INFO ] Deduced a trap composed of 32 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 07:20:25] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:29] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:41] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:20:50] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 328 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 47780ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 47780ms
Starting structural reductions in LTL mode, iteration 1 : 108/128 places, 199/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48004 ms. Remains : 108/128 places, 199/224 transitions.
[2025-06-02 07:20:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:20:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:20:51] [INFO ] Input system was already deterministic with 199 transitions.
[2025-06-02 07:20:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:20:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:20:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3045961743248227856.gal : 2 ms
[2025-06-02 07:20:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7745760594070766971.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/CTLFireability3045961743248227856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7745760594070766971.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((A(((!(EX(((p13==1)&&(p26==1)))) + EG((p41==1))) + ((p142==1)&&(p69!=1))) U EX((EX(((p79==1)&&(p114==1))) + AX((((p20==1)&&(p36==1))&&...394
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(EX((EX(((p79==1)&&(p114==1))) + !(EX(!((((p20==1)&&(p36==1))&&((p79==1)&&(p117==1))...705
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...501
Detected timeout of ITS tools.
[2025-06-02 07:21:21] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:21:21] [INFO ] Applying decomposition
[2025-06-02 07:21:21] [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/graph13788856167754076870.txt' '-o' '/tmp/graph13788856167754076870.bin' '-w' '/tmp/graph13788856167754076870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13788856167754076870.bin' '-l' '-1' '-v' '-w' '/tmp/graph13788856167754076870.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:21:21] [INFO ] Decomposing Gal with order
[2025-06-02 07:21:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:21:21] [INFO ] Removed a total of 278 redundant transitions.
[2025-06-02 07:21:21] [INFO ] Flatten gal took : 24 ms
[2025-06-02 07:21:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2025-06-02 07:21:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11197297750822550085.gal : 3 ms
[2025-06-02 07:21:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5635574268903051297.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/CTLFireability11197297750822550085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5635574268903051297.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.94183e+07,0.387065,13936,511,145,16754,1695,346,47464,94,9747,0


Converting to forward existential form...Done !
original formula: EF((A(((!(EX(((i3.u3.p13==1)&&(i2.u5.p26==1)))) + EG((i3.u8.p41==1))) + ((i7.u29.p142==1)&&(i4.u12.p69!=1))) U EX((EX(((i6.u13.p79==1)&&(...572
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(EX((EX(((i6.u13.p79==1)&&(i6.u20.p114==1))) + !(EX(!((((i3.u3.p20==1)&&(i2.u7.p36==...963
Reverse transition relation is NOT exact ! Due to transitions t34, i1.u2.t108, i1.u4.t105, i2.t93, i2.t92, i2.u5.t72, i2.u5.t103, i2.u5.t104, i2.u6.t96, i2...879
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
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
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 7
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
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 SI_CTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Graph (complete) has 397 edges and 128 vertex of which 123 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 122 transition count 208
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 111 transition count 206
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 110 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 28 place count 110 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 38 place count 105 transition count 200
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 60 place count 83 transition count 173
Iterating global reduction 3 with 22 rules applied. Total rules applied 82 place count 83 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 81 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 81 transition count 169
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 105 place count 71 transition count 160
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 3 with 2 rules applied. Total rules applied 107 place count 70 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 116 place count 70 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 120 place count 70 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 124 place count 66 transition count 146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 124 place count 66 transition count 143
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 130 place count 63 transition count 143
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 5 with 2 rules applied. Total rules applied 132 place count 62 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 61 transition count 141
Applied a total of 133 rules in 55 ms. Remains 61 /128 variables (removed 67) and now considering 141/224 (removed 83) transitions.
// Phase 1: matrix 141 rows 61 cols
[2025-06-02 07:21:51] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:21:51] [INFO ] Implicit Places using invariants in 79 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/128 places, 141/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 144 ms. Remains : 60/128 places, 141/224 transitions.
[2025-06-02 07:21:51] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:21:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:21:51] [INFO ] Input system was already deterministic with 141 transitions.
[2025-06-02 07:21:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:21:51] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:21:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13014737810149262620.gal : 1 ms
[2025-06-02 07:21:51] [INFO ] Time to serialize properties into /tmp/CTLFireability18064124216063361716.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/CTLFireability13014737810149262620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18064124216063361716.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.8485e+06,0.96677,20384,2,1276,5,53478,6,0,372,82052,0


Converting to forward existential form...Done !
original formula: E((!(AF((p87==1))) + !(EG((p17!=1)))) U (A((((p20==1)&&(p58==1))&&(p133==1)) U ((!(E((((p20==1)&&(p38==1))&&(p54==1)) U (((p20==1)&&(p38=...287
=> equivalent forward existential formula: [FwdG((FwdU(Init,(!(!(EG(!((p87==1))))) + !(EG((p17!=1))))) * !((E(!(((!(E((((p20==1)&&(p38==1))&&(p54==1)) U ((...636
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t17, t18, t19, t22, t24, t27, t30, ...343
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-02 07:22:21] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:22:21] [INFO ] Applying decomposition
[2025-06-02 07:22:21] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8529355849230227592.txt' '-o' '/tmp/graph8529355849230227592.bin' '-w' '/tmp/graph8529355849230227592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8529355849230227592.bin' '-l' '-1' '-v' '-w' '/tmp/graph8529355849230227592.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:22:22] [INFO ] Decomposing Gal with order
[2025-06-02 07:22:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:22:22] [INFO ] Removed a total of 257 redundant transitions.
[2025-06-02 07:22:22] [INFO ] Flatten gal took : 22 ms
[2025-06-02 07:22:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 5 ms.
[2025-06-02 07:22:22] [INFO ] Time to serialize gal into /tmp/CTLFireability16656411502492491567.gal : 2 ms
[2025-06-02 07:22:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15284460004603784406.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/CTLFireability16656411502492491567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15284460004603784406.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.8485e+06,0.156915,8840,202,72,8530,419,277,24334,81,3882,0


Converting to forward existential form...Done !
original formula: E((!(AF((i2.u8.p87==1))) + !(EG((i0.u0.p17!=1)))) U (A((((i0.u0.p20==1)&&(i1.u3.p58==1))&&(i4.u15.p133==1)) U ((!(E((((i0.u0.p20==1)&&(i0...408
=> equivalent forward existential formula: [FwdG((FwdU(Init,(!(!(EG(!((i2.u8.p87==1))))) + !(EG((i0.u0.p17!=1))))) * !((E(!(((!(E((((i0.u0.p20==1)&&(i0.u1....889
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t49, i0.u0.t50, i0.u1.t31, i0.u1.t47, i0.u1.t132, i0.u1.t133, i1.t44, i1.t42, i1.t39, i...535
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
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
Using saturation style SCC detection
(forward)formula 0,0,7.61172,169224,1,0,265882,2140,1812,719526,414,26939,258073
FORMULA MedleyA-PT-07-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Graph (complete) has 397 edges and 128 vertex of which 123 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 122 transition count 201
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 104 transition count 197
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 102 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 102 transition count 193
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 100 transition count 193
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 71 place count 79 transition count 165
Iterating global reduction 3 with 21 rules applied. Total rules applied 92 place count 79 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 92 place count 79 transition count 163
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 77 transition count 163
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 124 place count 62 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 61 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 61 transition count 148
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 3 with 2 rules applied. Total rules applied 128 place count 60 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 135 place count 60 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 138 place count 60 transition count 137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 57 transition count 137
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 141 place count 57 transition count 135
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 55 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 53 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 52 transition count 132
Applied a total of 150 rules in 62 ms. Remains 52 /128 variables (removed 76) and now considering 132/224 (removed 92) transitions.
// Phase 1: matrix 132 rows 52 cols
[2025-06-02 07:22:29] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:22:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 07:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:22:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-02 07:22:29] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:22:30] [INFO ] Redundant transitions in 20 ms returned []
Running 124 sub problems to find dead transitions.
[2025-06-02 07:22:30] [INFO ] Invariant cache hit.
[2025-06-02 07:22:30] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 132/184 variables, 52/58 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 70 constraints, problems are : Problem set: 0 solved, 124 unsolved in 4783 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 2/52 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 132/184 variables, 52/58 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 124/194 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/184 variables, and 194 constraints, problems are : Problem set: 0 solved, 124 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34853ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 34854ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/128 places, 132/224 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35133 ms. Remains : 52/128 places, 132/224 transitions.
[2025-06-02 07:23:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:23:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:23:04] [INFO ] Input system was already deterministic with 132 transitions.
RANDOM walk for 584 steps (57 resets) in 8 ms. (64 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-07-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 07:23:04] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:23:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:23:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13484240077772213252.gal : 1 ms
[2025-06-02 07:23:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15642676019352326562.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/ReachabilityCardinality13484240077772213252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15642676019352326562.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 110 transition count 202
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 110 transition count 202
Applied a total of 36 rules in 3 ms. Remains 110 /128 variables (removed 18) and now considering 202/224 (removed 22) transitions.
// Phase 1: matrix 202 rows 110 cols
[2025-06-02 07:23:04] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:23:05] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 07:23:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:23:05] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2025-06-02 07:23:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:08] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:08] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:08] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:08] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:09] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:09] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:09] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:09] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/312 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:14] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:15] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 130 constraints, problems are : Problem set: 0 solved, 201 unsolved in 19489 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/312 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 201/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:29] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:29] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:42] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:42] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:44] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:47] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 337 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49578ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 49579ms
Starting structural reductions in LTL mode, iteration 1 : 110/128 places, 202/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49915 ms. Remains : 110/128 places, 202/224 transitions.
[2025-06-02 07:23:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:23:54] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:23:54] [INFO ] Input system was already deterministic with 202 transitions.
[2025-06-02 07:23:54] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:23:54] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:23:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17819230625192625514.gal : 2 ms
[2025-06-02 07:23:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6731406929376879680.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/CTLFireability17819230625192625514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6731406929376879680.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF(((EX((p115==1)) * EG((p80==1))) + EG(((p49==1)||(p104==1))))) * (!(E(AG(((((p79==1)&&(p114==1))||(p94==1))||((((p67==1)&&(p20==1))&&(...291
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((EX((p115==1)) * EG((p80==1))) + EG(((p49==1)||(p104==1)))))))] = FALSE * [FwdG((Init * !(...475
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t35, t37, t38...539
Detected timeout of ITS tools.
[2025-06-02 07:24:24] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:24:24] [INFO ] Applying decomposition
[2025-06-02 07:24:25] [INFO ] Flatten gal took : 12 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/graph7216991342376321857.txt' '-o' '/tmp/graph7216991342376321857.bin' '-w' '/tmp/graph7216991342376321857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7216991342376321857.bin' '-l' '-1' '-v' '-w' '/tmp/graph7216991342376321857.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:24:25] [INFO ] Decomposing Gal with order
[2025-06-02 07:24:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:24:25] [INFO ] Removed a total of 290 redundant transitions.
[2025-06-02 07:24:25] [INFO ] Flatten gal took : 17 ms
[2025-06-02 07:24:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 16 ms.
[2025-06-02 07:24:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11890977613773171055.gal : 2 ms
[2025-06-02 07:24:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14331471919515582043.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/CTLFireability11890977613773171055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14331471919515582043.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.92553e+07,0.456225,17684,590,114,22567,948,386,69581,87,7020,0


Converting to forward existential form...Done !
original formula: (EF(((EX((i6.u26.p115==1)) * EG((i3.i1.u14.p80==1))) + EG(((i2.u11.p49==1)||(i6.u24.p104==1))))) * (!(E(AG(((((i6.u17.p79==1)&&(i6.u26.p1...415
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((EX((i6.u26.p115==1)) * EG((i3.i1.u14.p80==1))) + EG(((i2.u11.p49==1)||(i6.u24.p104==1))))...625
Reverse transition relation is NOT exact ! Due to transitions t66, t77, i0.u2.t111, i0.u4.t107, i1.t98, i1.t95, i1.t94, i1.u5.t75, i1.u5.t105, i1.u5.t106, ...887
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
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 224/224 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 108 transition count 200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 108 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 107 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 107 transition count 198
Applied a total of 42 rules in 5 ms. Remains 107 /128 variables (removed 21) and now considering 198/224 (removed 26) transitions.
// Phase 1: matrix 198 rows 107 cols
[2025-06-02 07:24:55] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:24:55] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 07:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:24:55] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-02 07:24:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 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 07:24:58] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:58] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:58] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:58] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:58] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/122 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 07:25:02] [INFO ] Deduced a trap along path composed of 2 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:04] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 124 constraints, problems are : Problem set: 0 solved, 197 unsolved in 15888 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 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/106 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 197/319 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 07:25:14] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:15] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:15] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:15] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 325 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45955ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 45956ms
Starting structural reductions in LTL mode, iteration 1 : 107/128 places, 198/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46196 ms. Remains : 107/128 places, 198/224 transitions.
[2025-06-02 07:25:41] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:25:41] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:25:41] [INFO ] Input system was already deterministic with 198 transitions.
[2025-06-02 07:25:41] [INFO ] Flatten gal took : 8 ms
[2025-06-02 07:25:41] [INFO ] Flatten gal took : 10 ms
[2025-06-02 07:25:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3910987900463725379.gal : 2 ms
[2025-06-02 07:25:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2116746037012121815.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/CTLFireability3910987900463725379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2116746037012121815.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((EF(EG(EX(EF((p111==1))))) * E((!(AX((p24==1))) + AF(((p48==1)||(((p20==1)&&(p32==1))&&((p71==1)&&(p117==1)))))) U (A((EX((p97==1)) * A(...303
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EG(EX(E(TRUE U (p111==1)))))))] = FALSE * [(Init * !(E((!(!(EX(!((p24==1))))) + !(EG(!(((p...578
Hit Full ! (commute/partial/dont) 191/0/7
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t14, t15, t16, t18, t19, t20, t22, t23, t24, t25, t26, t27, t32, t33, t34, t35, t37...516
Detected timeout of ITS tools.
[2025-06-02 07:26:11] [INFO ] Flatten gal took : 9 ms
[2025-06-02 07:26:11] [INFO ] Applying decomposition
[2025-06-02 07:26:11] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6772324000169335697.txt' '-o' '/tmp/graph6772324000169335697.bin' '-w' '/tmp/graph6772324000169335697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6772324000169335697.bin' '-l' '-1' '-v' '-w' '/tmp/graph6772324000169335697.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:26:11] [INFO ] Decomposing Gal with order
[2025-06-02 07:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:26:11] [INFO ] Removed a total of 323 redundant transitions.
[2025-06-02 07:26:11] [INFO ] Flatten gal took : 15 ms
[2025-06-02 07:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2025-06-02 07:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1868902491764511532.gal : 2 ms
[2025-06-02 07:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2416155117555666689.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/CTLFireability1868902491764511532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2416155117555666689.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.92439e+07,0.304291,13608,459,66,17699,668,355,43615,78,2918,0


Converting to forward existential form...Done !
original formula: ((EF(EG(EX(EF((i6.u24.p111==1))))) * E((!(AX((i1.u5.p24==1))) + AF(((i3.u12.p48==1)||(((i3.u4.p20==1)&&(i2.u7.p32==1))&&((i4.u16.p71==1)&...434
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EG(EX(E(TRUE U (i6.u24.p111==1)))))))] = FALSE * [(Init * !(E((!(!(EX(!((i1.u5.p24==1)))))...773
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
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
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
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 7
Reverse transition relation is NOT exact ! Due to transitions t34, t72, i1.u2.t107, i1.u5.t102, i1.u5.t103, i2.t95, i2.t94, i2.t93, i2.t90, i2.t89, i2.u6.t...868
Detected timeout of ITS tools.
[2025-06-02 07:26:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:26:41] [INFO ] Flatten gal took : 6 ms
[2025-06-02 07:26:41] [INFO ] Applying decomposition
[2025-06-02 07:26:41] [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/graph14850932978944876786.txt' '-o' '/tmp/graph14850932978944876786.bin' '-w' '/tmp/graph14850932978944876786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14850932978944876786.bin' '-l' '-1' '-v' '-w' '/tmp/graph14850932978944876786.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:26:41] [INFO ] Decomposing Gal with order
[2025-06-02 07:26:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:26:41] [INFO ] Removed a total of 363 redundant transitions.
[2025-06-02 07:26:41] [INFO ] Flatten gal took : 18 ms
[2025-06-02 07:26:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 2 ms.
[2025-06-02 07:26:41] [INFO ] Time to serialize gal into /tmp/CTLFireability1501064667805432603.gal : 2 ms
[2025-06-02 07:26:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8342444744015156103.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/CTLFireability1501064667805432603.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8342444744015156103.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 3 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.86375e+07,0.94317,24080,635,95,30540,595,461,97864,89,2880,0


Converting to forward existential form...Done !
original formula: EF((A(((!(EX(((i1.u2.p13==1)&&(i3.u6.p26==1)))) + EG((i4.u10.p41==1))) + ((i9.u35.p142==1)&&(i5.u15.p69!=1))) U EX((EX(((i6.u17.p79==1)&&...575
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(EX((EX(((i6.u17.p79==1)&&(i8.u28.p114==1))) + !(EX(!((((i1.u4.p20==1)&&(i3.u9.p36==...966
Reverse transition relation is NOT exact ! Due to transitions i1.u2.t129, i1.u2.t132, i1.u2.t133, i1.u2.t134, i1.u4.t124, i1.u4.t125, i1.u4.t126, i1.u4.t12...1146
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
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
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
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
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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
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
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
(forward)formula 0,1,31.3482,679696,1,0,1.05924e+06,1754,2842,2.65794e+06,471,8811,996618
FORMULA MedleyA-PT-07-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((EX((i8.u28.p115==1)) * EG((i6.u14.p80==1))) + EG(((i4.u12.p49==1)||(i8.u25.p104==1))))) * (!(E(AG(((((i6.u17.p79==1)&&(i8.u28.p114=...412
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((EX((i8.u28.p115==1)) * EG((i6.u14.p80==1))) + EG(((i4.u12.p49==1)||(i8.u25.p104==1)))))))...622
(forward)formula 1,1,61.8989,1354012,1,0,2.11185e+06,1873,3156,4.95371e+06,481,9741,1965132
FORMULA MedleyA-PT-07-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((EF(EG(EX(EF((i8.u27.p111==1))))) * E((!(AX((i2.u5.p24==1))) + AF(((i4.u11.p48==1)||(((i1.u4.p20==1)&&(i3.u8.p32==1))&&((i5.u15.p71==1)&...434
=> equivalent forward existential formula: (([(Init * !(E(TRUE U EG(EX(E(TRUE U (i8.u27.p111==1)))))))] = FALSE * [(Init * !(E((!(!(EX(!((i2.u5.p24==1)))))...773
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
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
(forward)formula 2,1,131.278,2200192,1,0,3.42613e+06,1999,1349,7.66917e+06,228,10256,651747
FORMULA MedleyA-PT-07-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1748849333701

--------------------
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-07"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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