Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200074.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 Champagne-PT-H07T0R, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.2K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 5.3K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 119K Jun 5 20:08 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 Champagne-PT-H07T0R-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H07T0R-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749321569728

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H07T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 18:39:30] [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-07 18:39:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:39:31] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2025-06-07 18:39:31] [INFO ] Transformed 539 places.
[2025-06-07 18:39:31] [INFO ] Transformed 742 transitions.
[2025-06-07 18:39:31] [INFO ] Found NUPN structural information;
[2025-06-07 18:39:31] [INFO ] Parsed PT model containing 539 places and 742 transitions and 1934 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 115 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 742/742 transitions.
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 100 place count 439 transition count 642
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 439 transition count 642
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 247 place count 392 transition count 595
Iterating global reduction 0 with 47 rules applied. Total rules applied 294 place count 392 transition count 595
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 313 place count 373 transition count 572
Iterating global reduction 0 with 19 rules applied. Total rules applied 332 place count 373 transition count 572
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 338 place count 373 transition count 566
Applied a total of 338 rules in 120 ms. Remains 373 /539 variables (removed 166) and now considering 566/742 (removed 176) transitions.
// Phase 1: matrix 566 rows 373 cols
[2025-06-07 18:39:31] [INFO ] Computed 27 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:39:32] [INFO ] Implicit Places using invariants in 503 ms returned []
[2025-06-07 18:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:39:32] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Running 565 sub problems to find dead transitions.
[2025-06-07 18:39:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:43] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:46] [INFO ] Deduced a trap composed of 72 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-07 18:39:46] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:46] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:46] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:46] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:46] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:46] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:46] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:54] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:54] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:55] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/939 variables, and 66 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 565 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 39/66 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (OVERLAPS) 566/939 variables, 373/439 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/939 variables, 565/1004 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:13] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:14] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:14] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:15] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:15] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:15] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:15] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:16] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:17] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:17] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:17] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:18] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:18] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:18] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:18] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:19] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:19] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:19] [INFO ] Deduced a trap composed of 80 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-07 18:40:20] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:20] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 20/1024 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:26] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 939/939 variables, and 1025 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60234ms problems are : Problem set: 0 solved, 565 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LTL mode, iteration 1 : 373/539 places, 566/742 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61398 ms. Remains : 373/539 places, 566/742 transitions.
Support contains 115 out of 373 places after structural reductions.
[2025-06-07 18:40:32] [INFO ] Flatten gal took : 57 ms
[2025-06-07 18:40:33] [INFO ] Flatten gal took : 30 ms
[2025-06-07 18:40:33] [INFO ] Input system was already deterministic with 566 transitions.
Support contains 112 out of 373 places (down from 115) after GAL structural reductions.
RANDOM walk for 40000 steps (119 resets) in 2047 ms. (19 steps per ms) remains 5/87 properties
BEST_FIRST walk for 40003 steps (10 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
[2025-06-07 18:40:33] [INFO ] Invariant cache hit.
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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 80/86 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 287/373 variables, 22/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 566/939 variables, 373/400 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:34] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:34] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:34] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 5/405 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/939 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 939/939 variables, and 405 constraints, problems are : Problem set: 1 solved, 4 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 303/373 variables, 23/27 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 5/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:34] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:35] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 566/939 variables, 373/407 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 4/411 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/411 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/939 variables, 0/411 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 939/939 variables, and 411 constraints, problems are : Problem set: 1 solved, 4 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1576ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 135 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=19 )
Parikh walk visited 4 properties in 12 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-07 18:40:35] [INFO ] Flatten gal took : 24 ms
[2025-06-07 18:40:35] [INFO ] Flatten gal took : 23 ms
[2025-06-07 18:40:35] [INFO ] Input system was already deterministic with 566 transitions.
Computed a total of 55 stabilizing places and 55 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 317 transition count 492
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 317 transition count 492
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 117 place count 317 transition count 487
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 150 place count 284 transition count 441
Iterating global reduction 1 with 33 rules applied. Total rules applied 183 place count 284 transition count 441
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 186 place count 284 transition count 438
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 207 place count 263 transition count 382
Iterating global reduction 2 with 21 rules applied. Total rules applied 228 place count 263 transition count 382
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 240 place count 263 transition count 370
Applied a total of 240 rules in 24 ms. Remains 263 /373 variables (removed 110) and now considering 370/566 (removed 196) transitions.
// Phase 1: matrix 370 rows 263 cols
[2025-06-07 18:40:35] [INFO ] Computed 27 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:40:36] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-06-07 18:40:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:40:36] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 18:40:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/633 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 0/633 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 290 constraints, problems are : Problem set: 0 solved, 369 unsolved in 23056 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/633 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 369/659 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:08] [INFO ] Deduced a trap along path composed of 9 places in 46 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:14] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:14] [INFO ] Deduced a trap composed of 41 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-07 18:41:14] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/633 variables, 3/663 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:18] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:20] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:23] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:24] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:24] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:24] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 4/669 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/633 variables, and 669 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53115ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 53117ms
Starting structural reductions in LTL mode, iteration 1 : 263/373 places, 370/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53752 ms. Remains : 263/373 places, 370/566 transitions.
[2025-06-07 18:41:29] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:41:29] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:41:29] [INFO ] Input system was already deterministic with 370 transitions.
[2025-06-07 18:41:29] [INFO ] Flatten gal took : 12 ms
[2025-06-07 18:41:29] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:41:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7162625378963310924.gal : 6 ms
[2025-06-07 18:41:29] [INFO ] Time to serialize properties into /tmp/CTLFireability5540116341709022087.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7162625378963310924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5540116341709022087.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,3.07073e+25,0.184021,10292,2,1779,5,33294,6,0,1424,23603,0


Converting to forward existential form...Done !
original formula: EF(((EX((p117==1)) * (p359==1)) * (p446==1)))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * (p446==1)) * (p359==1))) * (p117==1))] != FALSE
(forward)formula 0,1,0.219146,10548,1,0,12,33294,10,3,2216,23603,4
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Graph (trivial) has 339 edges and 373 vertex of which 44 / 373 are part of one of the 8 SCC in 7 ms
Free SCC test removed 36 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 336 transition count 442
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 130 rules applied. Total rules applied 214 place count 253 transition count 395
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 237 place count 231 transition count 394
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 240 place count 230 transition count 392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 241 place count 229 transition count 392
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 241 place count 229 transition count 377
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 271 place count 214 transition count 377
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 312 place count 173 transition count 317
Iterating global reduction 5 with 41 rules applied. Total rules applied 353 place count 173 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 358 place count 173 transition count 312
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 358 place count 173 transition count 302
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 378 place count 163 transition count 302
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 384 place count 157 transition count 271
Iterating global reduction 6 with 6 rules applied. Total rules applied 390 place count 157 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 396 place count 157 transition count 265
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 530 place count 90 transition count 198
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 535 place count 85 transition count 173
Iterating global reduction 7 with 5 rules applied. Total rules applied 540 place count 85 transition count 173
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 545 place count 85 transition count 168
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 547 place count 83 transition count 166
Applied a total of 547 rules in 94 ms. Remains 83 /373 variables (removed 290) and now considering 166/566 (removed 400) transitions.
[2025-06-07 18:41:29] [INFO ] Flow matrix only has 95 transitions (discarded 71 similar events)
// Phase 1: matrix 95 rows 83 cols
[2025-06-07 18:41:29] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 18:41:29] [INFO ] Flow matrix only has 95 transitions (discarded 71 similar events)
[2025-06-07 18:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:41:29] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2025-06-07 18:41:29] [INFO ] Flow matrix only has 95 transitions (discarded 71 similar events)
[2025-06-07 18:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 4/83 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 94/177 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/177 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/178 variables, and 110 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2573 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 4/83 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 94/177 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 110/220 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/178 variables, and 220 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2714 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5304ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 5304ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/373 places, 166/566 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5544 ms. Remains : 83/373 places, 166/566 transitions.
[2025-06-07 18:41:35] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:41:35] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:41:35] [INFO ] Input system was already deterministic with 166 transitions.
[2025-06-07 18:41:35] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:41:35] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:41:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11673159953190029498.gal : 1 ms
[2025-06-07 18:41:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7260425675119975007.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/CTLFireability11673159953190029498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7260425675119975007.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.22428e+12,0.024676,4836,2,140,5,1635,6,0,493,870,0


Converting to forward existential form...Done !
original formula: AG(AF((((p397==0)||(p408==0))&&((((p535==0)||(p451==0))||((p312==0)||(p438==0)))||(p470==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p397==0)||(p408==0))&&((((p535==0)||(p451==0))||((p312==0)||(p438==0)))||(p470==0))))...165
Hit Full ! (commute/partial/dont) 140/0/26
(forward)formula 0,0,0.064888,5604,1,0,8,9189,20,2,2496,4023,8
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Graph (trivial) has 355 edges and 373 vertex of which 51 / 373 are part of one of the 9 SCC in 3 ms
Free SCC test removed 42 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 330 transition count 428
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 137 rules applied. Total rules applied 228 place count 240 transition count 381
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 250 place count 218 transition count 381
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 250 place count 218 transition count 374
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 264 place count 211 transition count 374
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 308 place count 167 transition count 309
Iterating global reduction 3 with 44 rules applied. Total rules applied 352 place count 167 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 358 place count 167 transition count 303
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 358 place count 167 transition count 290
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 384 place count 154 transition count 290
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 391 place count 147 transition count 255
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 147 transition count 255
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 405 place count 147 transition count 248
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 535 place count 82 transition count 183
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 540 place count 77 transition count 158
Iterating global reduction 5 with 5 rules applied. Total rules applied 545 place count 77 transition count 158
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 550 place count 77 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 552 place count 75 transition count 151
Applied a total of 552 rules in 49 ms. Remains 75 /373 variables (removed 298) and now considering 151/566 (removed 415) transitions.
[2025-06-07 18:41:35] [INFO ] Flow matrix only has 73 transitions (discarded 78 similar events)
// Phase 1: matrix 73 rows 75 cols
[2025-06-07 18:41:35] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 18:41:35] [INFO ] Flow matrix only has 73 transitions (discarded 78 similar events)
[2025-06-07 18:41:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:35] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:41:35] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 18:41:35] [INFO ] Flow matrix only has 73 transitions (discarded 78 similar events)
[2025-06-07 18:41:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 72/147 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/148 variables, and 102 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 72/147 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 96/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/148 variables, and 198 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2138 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4156ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4156ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/373 places, 151/566 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4330 ms. Remains : 75/373 places, 151/566 transitions.
[2025-06-07 18:41:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:41:39] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:41:39] [INFO ] Input system was already deterministic with 151 transitions.
RANDOM walk for 85 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 18:41:39] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:41:39] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:41:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15037373238650256464.gal : 1 ms
[2025-06-07 18:41:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12408902234904892044.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15037373238650256464.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12408902234904892044.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Graph (trivial) has 324 edges and 373 vertex of which 44 / 373 are part of one of the 8 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 336 transition count 448
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 118 rules applied. Total rules applied 196 place count 259 transition count 407
Reduce places removed 19 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 24 rules applied. Total rules applied 220 place count 240 transition count 402
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 227 place count 235 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 234 transition count 400
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 228 place count 234 transition count 389
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 250 place count 223 transition count 389
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 291 place count 182 transition count 333
Iterating global reduction 5 with 41 rules applied. Total rules applied 332 place count 182 transition count 333
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 338 place count 182 transition count 327
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 338 place count 182 transition count 316
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 360 place count 171 transition count 316
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 367 place count 164 transition count 281
Iterating global reduction 6 with 7 rules applied. Total rules applied 374 place count 164 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 381 place count 164 transition count 274
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 511 place count 99 transition count 209
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 516 place count 94 transition count 184
Iterating global reduction 7 with 5 rules applied. Total rules applied 521 place count 94 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 526 place count 94 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 528 place count 92 transition count 177
Applied a total of 528 rules in 45 ms. Remains 92 /373 variables (removed 281) and now considering 177/566 (removed 389) transitions.
[2025-06-07 18:41:39] [INFO ] Flow matrix only has 124 transitions (discarded 53 similar events)
// Phase 1: matrix 124 rows 92 cols
[2025-06-07 18:41:39] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-07 18:41:39] [INFO ] Flow matrix only has 124 transitions (discarded 53 similar events)
[2025-06-07 18:41:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:40] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:41:40] [INFO ] Redundant transitions in 5 ms returned []
Running 125 sub problems to find dead transitions.
[2025-06-07 18:41:40] [INFO ] Flow matrix only has 124 transitions (discarded 53 similar events)
[2025-06-07 18:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 7/92 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 123/215 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/215 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/216 variables, and 119 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3215 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 7/92 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 123/215 variables, 92/119 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 125/244 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/216 variables, and 244 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3341 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6569ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6569ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/373 places, 177/566 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6754 ms. Remains : 92/373 places, 177/566 transitions.
[2025-06-07 18:41:46] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:41:46] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:41:46] [INFO ] Input system was already deterministic with 177 transitions.
[2025-06-07 18:41:46] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:41:46] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability9356870369707173239.gal : 1 ms
[2025-06-07 18:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability10640179246727468431.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/CTLFireability9356870369707173239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10640179246727468431.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.09499e+13,0.026871,4904,2,158,5,2291,6,0,539,1255,0


Converting to forward existential form...Done !
original formula: AG((EF(AG((p218==0))) + (((AF(((p137==1)&&(p226==1))) * AF((p127==0))) * (!(E((p293==1) U (p279==1))) * EF((p378==0)))) * (!(E(((p474==1)...213
=> equivalent forward existential formula: ((([FwdG((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p218==0))))))),!(((p137==1)&&(p226==1))))] = FALSE * [FwdG(...667
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.108399,7208,1,0,22,16865,49,4,2746,8386,19
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 318 transition count 490
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 318 transition count 490
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 318 transition count 484
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 146 place count 288 transition count 441
Iterating global reduction 1 with 30 rules applied. Total rules applied 176 place count 288 transition count 441
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 179 place count 288 transition count 438
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 197 place count 270 transition count 388
Iterating global reduction 2 with 18 rules applied. Total rules applied 215 place count 270 transition count 388
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 225 place count 270 transition count 378
Applied a total of 225 rules in 18 ms. Remains 270 /373 variables (removed 103) and now considering 378/566 (removed 188) transitions.
// Phase 1: matrix 378 rows 270 cols
[2025-06-07 18:41:46] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-07 18:41:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:46] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2025-06-07 18:41: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/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 378/648 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (OVERLAPS) 0/648 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 297 constraints, problems are : Problem set: 0 solved, 377 unsolved in 24337 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (OVERLAPS) 378/648 variables, 270/297 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 377/674 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:21] [INFO ] Deduced a trap along path composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:26] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:28] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 648/648 variables, and 677 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54410ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 54411ms
Starting structural reductions in LTL mode, iteration 1 : 270/373 places, 378/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54659 ms. Remains : 270/373 places, 378/566 transitions.
[2025-06-07 18:42:41] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:42:41] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:42:41] [INFO ] Input system was already deterministic with 378 transitions.
[2025-06-07 18:42:41] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:42:41] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:42:41] [INFO ] Time to serialize gal into /tmp/CTLFireability8726526327672443404.gal : 2 ms
[2025-06-07 18:42:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9505143585432311529.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/CTLFireability8726526327672443404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9505143585432311529.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.15818e+25,0.196583,10644,2,1882,5,35118,6,0,1460,25564,0


Converting to forward existential form...Done !
original formula: AG((EG((AG((p273==0)) * EX((p516==0)))) + E((p242!=1) U (!(EF((p67==1))) + AG((p429==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E((p242!=1) U (!(E(TRUE U (p67==1))) + !(E(TRUE U !((p429==1)))))))) * !(EG((!(E(TRUE U !...197
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t61, t66, t70, t75, t76, t80, t86, t90,...441
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-07 18:43:11] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:43:11] [INFO ] Applying decomposition
[2025-06-07 18:43:11] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2140322063787943711.txt' '-o' '/tmp/graph2140322063787943711.bin' '-w' '/tmp/graph2140322063787943711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2140322063787943711.bin' '-l' '-1' '-v' '-w' '/tmp/graph2140322063787943711.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:43:11] [INFO ] Decomposing Gal with order
[2025-06-07 18:43:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:43:11] [INFO ] Removed a total of 260 redundant transitions.
[2025-06-07 18:43:11] [INFO ] Flatten gal took : 55 ms
[2025-06-07 18:43:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2025-06-07 18:43:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14178431747120569385.gal : 6 ms
[2025-06-07 18:43:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12410457637497205349.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/CTLFireability14178431747120569385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12410457637497205349.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.15818e+25,0.092234,7296,674,27,5982,616,591,8307,69,1257,0


Converting to forward existential form...Done !
original formula: AG((EG((AG((i13.i1.u42.p273==0)) * EX((i25.u79.p516==0)))) + E((i12.i0.u36.p242!=1) U (!(EF((i0.u9.p67==1))) + AG((i22.u65.p429==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E((i12.i0.u36.p242!=1) U (!(E(TRUE U (i0.u9.p67==1))) + !(E(TRUE U !((i22.u65.p429==1))))...241
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t44, t75, t114, t156, i0.t240, i1.i1.t272, i2.u6.t263, i3.t253, i4.t230, i5.t220, i6...697
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
(forward)formula 0,0,20.8104,534716,1,0,991144,656,3974,1.94719e+06,415,1561,1152583
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 322 transition count 494
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 322 transition count 494
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 322 transition count 488
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 134 place count 296 transition count 455
Iterating global reduction 1 with 26 rules applied. Total rules applied 160 place count 296 transition count 455
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 162 place count 296 transition count 453
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 177 place count 281 transition count 417
Iterating global reduction 2 with 15 rules applied. Total rules applied 192 place count 281 transition count 417
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 201 place count 281 transition count 408
Applied a total of 201 rules in 16 ms. Remains 281 /373 variables (removed 92) and now considering 408/566 (removed 158) transitions.
// Phase 1: matrix 408 rows 281 cols
[2025-06-07 18:43:32] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:43:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-07 18:43:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:43:33] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2025-06-07 18:43: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/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 408/689 variables, 281/308 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (OVERLAPS) 0/689 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 308 constraints, problems are : Problem set: 0 solved, 407 unsolved in 28075 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 408/689 variables, 281/308 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 407/715 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:10] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:13] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:13] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:14] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:14] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:18] [INFO ] Deduced a trap composed of 31 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-07 18:44:18] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:19] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 3/723 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:25] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 724 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58132ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 58133ms
Starting structural reductions in LTL mode, iteration 1 : 281/373 places, 408/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58476 ms. Remains : 281/373 places, 408/566 transitions.
[2025-06-07 18:44:31] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:44:31] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:44:31] [INFO ] Input system was already deterministic with 408 transitions.
[2025-06-07 18:44:31] [INFO ] Flatten gal took : 18 ms
[2025-06-07 18:44:31] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:44:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2207260424995152123.gal : 2 ms
[2025-06-07 18:44:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6872059162805474650.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/CTLFireability2207260424995152123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6872059162805474650.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.79054e+26,0.272616,12508,2,2155,5,42390,6,0,1534,34816,0


Converting to forward existential form...Done !
original formula: E(EX((!(((EG((p315==1)) + (((p99==1)&&(p169==1))&&(p511==1))) + (p292==1))) + A(((p199==1) + EF((p313==1))) U EF((p266==1))))) U (AG((EG(...215
=> equivalent forward existential formula: [((FwdU(Init,EX((!(((EG((p315==1)) + (((p99==1)&&(p169==1))&&(p511==1))) + (p292==1))) + !((E(!(E(TRUE U (p266==...370
Reverse transition relation is NOT exact ! Due to transitions t6, t28, t29, t33, t39, t42, t46, t49, t50, t54, t60, t64, t69, t73, t78, t79, t83, t89, t93,...471
Detected timeout of ITS tools.
[2025-06-07 18:45:01] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:45:01] [INFO ] Applying decomposition
[2025-06-07 18:45:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16680551100875377167.txt' '-o' '/tmp/graph16680551100875377167.bin' '-w' '/tmp/graph16680551100875377167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16680551100875377167.bin' '-l' '-1' '-v' '-w' '/tmp/graph16680551100875377167.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:45:01] [INFO ] Decomposing Gal with order
[2025-06-07 18:45:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:45:01] [INFO ] Removed a total of 294 redundant transitions.
[2025-06-07 18:45:01] [INFO ] Flatten gal took : 33 ms
[2025-06-07 18:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2025-06-07 18:45:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1826932481552059211.gal : 4 ms
[2025-06-07 18:45:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1200604481719647524.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/CTLFireability1826932481552059211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1200604481719647524.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.79054e+26,0.121082,8716,861,30,8409,691,631,12110,73,1572,0


Converting to forward existential form...Done !
original formula: E(EX((!(((EG((i15.i1.u50.p315==1)) + (((i5.u14.p99==1)&&(i8.u24.p169==1))&&(i25.u85.p511==1))) + (i14.i1.u46.p292==1))) + A(((i9.u26.p199...315
=> equivalent forward existential formula: [((FwdU(Init,EX((!(((EG((i15.i1.u50.p315==1)) + (((i5.u14.p99==1)&&(i8.u24.p169==1))&&(i25.u85.p511==1))) + (i14...486
Reverse transition relation is NOT exact ! Due to transitions t6, t28, t49, t78, t141, t166, t218, i0.i1.u17.t233, i1.t281, i1.u6.t283, i2.i1.u9.t273, i3.u...758
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 325 transition count 497
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 325 transition count 497
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 325 transition count 491
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 128 place count 299 transition count 462
Iterating global reduction 1 with 26 rules applied. Total rules applied 154 place count 299 transition count 462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 155 place count 299 transition count 461
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 168 place count 286 transition count 423
Iterating global reduction 2 with 13 rules applied. Total rules applied 181 place count 286 transition count 423
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 188 place count 286 transition count 416
Applied a total of 188 rules in 15 ms. Remains 286 /373 variables (removed 87) and now considering 416/566 (removed 150) transitions.
// Phase 1: matrix 416 rows 286 cols
[2025-06-07 18:45:31] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:45:31] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-07 18:45:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:45:32] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2025-06-07 18:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:37] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:37] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:37] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:37] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:38] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:38] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:38] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:38] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:38] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:38] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:38] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:38] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:39] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:39] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:39] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:39] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 416/702 variables, 286/329 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/702 variables, and 329 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 416/702 variables, 286/329 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/702 variables, 415/744 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:08] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:08] [INFO ] Deduced a trap composed of 34 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-07 18:46:08] [INFO ] Deduced a trap composed of 60 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-07 18:46:09] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:09] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:09] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:13] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:14] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:15] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 3/753 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:19] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:20] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:20] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:21] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 4/757 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:25] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:25] [INFO ] Deduced a trap composed of 49 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-07 18:46:25] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:29] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 4/761 constraints. Problems are: Problem set: 0 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/702 variables, and 761 constraints, problems are : Problem set: 0 solved, 415 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 415 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in LTL mode, iteration 1 : 286/373 places, 416/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60453 ms. Remains : 286/373 places, 416/566 transitions.
[2025-06-07 18:46:32] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:46:32] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:46:32] [INFO ] Input system was already deterministic with 416 transitions.
[2025-06-07 18:46:32] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:46:32] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:46:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5113075602306998211.gal : 2 ms
[2025-06-07 18:46:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14110451402278731027.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/CTLFireability5113075602306998211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14110451402278731027.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,2.86138e+26,0.298619,15144,2,2665,5,58142,6,0,1562,46833,0


Converting to forward existential form...Done !
original formula: (AX((((EX((EF((p206==1)) * (E((p259==1) U (p349==1)) + AF((p197==1))))) + EX((p317==1))) + (((p512==0)&&((((p423==0)||(p359==0))||((p411=...487
=> equivalent forward existential formula: ([((((EY(Init) * !(((p474==1)&&(p479==1)))) * !((((p512==0)&&((((p423==0)||(p359==0))||((p411==0)||(p397==0)))||...773
Reverse transition relation is NOT exact ! Due to transitions t7, t17, t28, t29, t33, t40, t43, t49, t50, t51, t55, t60, t61, t65, t70, t71, t75, t81, t82,...516
Detected timeout of ITS tools.
[2025-06-07 18:47:02] [INFO ] Flatten gal took : 12 ms
[2025-06-07 18:47:02] [INFO ] Applying decomposition
[2025-06-07 18:47:02] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3000109879204034797.txt' '-o' '/tmp/graph3000109879204034797.bin' '-w' '/tmp/graph3000109879204034797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3000109879204034797.bin' '-l' '-1' '-v' '-w' '/tmp/graph3000109879204034797.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:47:02] [INFO ] Decomposing Gal with order
[2025-06-07 18:47:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:47:02] [INFO ] Removed a total of 290 redundant transitions.
[2025-06-07 18:47:02] [INFO ] Flatten gal took : 19 ms
[2025-06-07 18:47:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 7 ms.
[2025-06-07 18:47:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6730341119079589926.gal : 3 ms
[2025-06-07 18:47:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7825208804811949535.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/CTLFireability6730341119079589926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7825208804811949535.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,2.86138e+26,0.119028,8836,747,35,8620,888,668,15347,88,1944,0


Converting to forward existential form...Done !
original formula: (AX((((EX((EF((i11.u30.p206==1)) * (E((i12.u39.p259==1) U (i18.u53.p349==1)) + AF((i10.u29.p197==1))))) + EX((i15.u45.p317==1))) + (((i24...736
=> equivalent forward existential formula: ([((((EY(Init) * !(((i22.u71.p474==1)&&(i22.u74.p479==1)))) * !((((i24.u79.p512==0)&&((((i16.u66.p423==0)||(i18....1082
Reverse transition relation is NOT exact ! Due to transitions t28, t50, t60, t81, t102, t124, t145, t197, t228, t273, i0.i1.u15.t243, i1.t287, i2.t278, i3....853
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 325 transition count 506
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 325 transition count 506
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 325 transition count 502
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 129 place count 296 transition count 463
Iterating global reduction 1 with 29 rules applied. Total rules applied 158 place count 296 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 160 place count 296 transition count 461
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 180 place count 276 transition count 409
Iterating global reduction 2 with 20 rules applied. Total rules applied 200 place count 276 transition count 409
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 210 place count 276 transition count 399
Applied a total of 210 rules in 24 ms. Remains 276 /373 variables (removed 97) and now considering 399/566 (removed 167) transitions.
// Phase 1: matrix 399 rows 276 cols
[2025-06-07 18:47:32] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:47:32] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-07 18:47:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:47:32] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2025-06-07 18:47:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:38] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:38] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:38] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:38] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:38] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:38] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:39] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:39] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:39] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:39] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:39] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:39] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:39] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 399/675 variables, 276/316 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/675 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 316 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (OVERLAPS) 1/276 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/276 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 399/675 variables, 276/316 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 398/714 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:08] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:09] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:10] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 3/717 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:17] [INFO ] Deduced a trap along path composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:26] [INFO ] Deduced a trap composed of 52 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-07 18:48:27] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:27] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:27] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:27] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:48:27] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 6/724 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/675 variables, and 724 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 276/276 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 276/373 places, 399/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60396 ms. Remains : 276/373 places, 399/566 transitions.
[2025-06-07 18:48:32] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:48:32] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:48:32] [INFO ] Input system was already deterministic with 399 transitions.
[2025-06-07 18:48:32] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:48:32] [INFO ] Flatten gal took : 23 ms
[2025-06-07 18:48:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3596619385265582791.gal : 2 ms
[2025-06-07 18:48:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4964174720491949577.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/CTLFireability3596619385265582791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4964174720491949577.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.14123e+26,0.289276,15172,2,2616,5,60146,6,0,1505,47572,0


Converting to forward existential form...Done !
original formula: (EF(((p317==1)&&(p367==1))) * (AX((EX(EF((p146==1))) + (AX(A((p217==1) U (p115==1))) * AX((p346==0))))) + ((EG((EF((p404==0)) * E((p125==...245
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((p317==1)&&(p367==1)))))] = FALSE * ([(((Init * !(!(EX(!((EX(E(TRUE U (p146==1))) + (!(EX(...590
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t54, t55, t59, t64, t68, t73, t74, t75, t79, t85,...499
Detected timeout of ITS tools.
[2025-06-07 18:49:02] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:49:02] [INFO ] Applying decomposition
[2025-06-07 18:49:02] [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/graph11359937176122417409.txt' '-o' '/tmp/graph11359937176122417409.bin' '-w' '/tmp/graph11359937176122417409.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11359937176122417409.bin' '-l' '-1' '-v' '-w' '/tmp/graph11359937176122417409.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:49:03] [INFO ] Decomposing Gal with order
[2025-06-07 18:49:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:49:03] [INFO ] Removed a total of 280 redundant transitions.
[2025-06-07 18:49:03] [INFO ] Flatten gal took : 16 ms
[2025-06-07 18:49:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-07 18:49:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9661697646906640500.gal : 3 ms
[2025-06-07 18:49:03] [INFO ] Time to serialize properties into /tmp/CTLFireability18367669782078773496.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/CTLFireability9661697646906640500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18367669782078773496.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.14123e+26,0.139144,9632,1134,37,11082,775,654,13804,79,1889,0


Converting to forward existential form...Done !
original formula: (EF(((i16.u45.p317==1)&&(i20.u55.p367==1))) * (AX((EX(EF((i8.u22.p146==1))) + (AX(A((i11.u30.p217==1) U (i5.u14.p115==1))) * AX((i19.u53....343
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((i16.u45.p317==1)&&(i20.u55.p367==1)))))] = FALSE * ([(((Init * !(!(EX(!((EX(E(TRUE U (i8....746
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t44, t54, t74, t95, t119, t139, t158, t189, t263, i0.u9.t248, i0.u10.t244, i1.t277, ...784
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,1,8.57017,298144,1,0,640268,846,4264,869447,409,1976,888206
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 326 transition count 510
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 326 transition count 510
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 98 place count 326 transition count 506
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 126 place count 298 transition count 465
Iterating global reduction 1 with 28 rules applied. Total rules applied 154 place count 298 transition count 465
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 157 place count 298 transition count 462
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 175 place count 280 transition count 421
Iterating global reduction 2 with 18 rules applied. Total rules applied 193 place count 280 transition count 421
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 203 place count 280 transition count 411
Applied a total of 203 rules in 11 ms. Remains 280 /373 variables (removed 93) and now considering 411/566 (removed 155) transitions.
// Phase 1: matrix 411 rows 280 cols
[2025-06-07 18:49:11] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:49:11] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-07 18:49:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:49:12] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2025-06-07 18:49:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 411/691 variables, 280/307 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 0/691 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Real declared 691/691 variables, and 307 constraints, problems are : Problem set: 0 solved, 410 unsolved in 27330 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 411/691 variables, 280/307 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 410/717 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:50] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:56] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:56] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:57] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:49:57] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 4/722 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:03] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:50:04] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/691 variables, and 724 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 57387ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 57388ms
Starting structural reductions in LTL mode, iteration 1 : 280/373 places, 411/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57759 ms. Remains : 280/373 places, 411/566 transitions.
[2025-06-07 18:50:09] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:50:09] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:50:09] [INFO ] Input system was already deterministic with 411 transitions.
[2025-06-07 18:50:09] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:50:09] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:50:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16204605917867490311.gal : 1 ms
[2025-06-07 18:50:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7114107051567391462.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/CTLFireability16204605917867490311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7114107051567391462.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.54985e+26,18.9284,476908,2,58252,5,2.52448e+06,6,0,1533,1.82261e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-07 18:50:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:50:39] [INFO ] Applying decomposition
[2025-06-07 18:50:39] [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/graph12873310422230880806.txt' '-o' '/tmp/graph12873310422230880806.bin' '-w' '/tmp/graph12873310422230880806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12873310422230880806.bin' '-l' '-1' '-v' '-w' '/tmp/graph12873310422230880806.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:50:39] [INFO ] Decomposing Gal with order
[2025-06-07 18:50:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:50:39] [INFO ] Removed a total of 305 redundant transitions.
[2025-06-07 18:50:39] [INFO ] Flatten gal took : 17 ms
[2025-06-07 18:50:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2025-06-07 18:50:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3480988358846241315.gal : 3 ms
[2025-06-07 18:50:39] [INFO ] Time to serialize properties into /tmp/CTLFireability4186025177437041226.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/CTLFireability3480988358846241315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4186025177437041226.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.54985e+26,0.292375,16532,6000,20,24321,373,617,15504,53,814,0


Converting to forward existential form...Done !
original formula: ((EX(((i8.u26.p148==1) + ((EX(((i3.u11.p61==0)||(i10.u36.p191==0))) * (i7.u24.p137==1)) * ((i10.u36.p188==1)&&((i18.u63.p354==1)||(i17.u6...421
=> equivalent forward existential formula: ([(EY(((Init * !(E((i9.i0.u30.p180==1) U (i25.i0.u87.p478==1)))) * !(EX(((i8.u26.p148==1) + ((EX(((i3.u11.p61==0...1374
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t45, t75, t118, t157, t217, i1.t282, i2.t273, i3.t263, i4.t251, i4.u13.t253, i5.t242...741
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
(forward)formula 0,1,5.51414,227348,1,0,532130,373,4077,617028,259,814,1281237
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 322 transition count 494
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 322 transition count 494
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 322 transition count 488
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 137 place count 293 transition count 450
Iterating global reduction 1 with 29 rules applied. Total rules applied 166 place count 293 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 168 place count 293 transition count 448
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 187 place count 274 transition count 398
Iterating global reduction 2 with 19 rules applied. Total rules applied 206 place count 274 transition count 398
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 217 place count 274 transition count 387
Applied a total of 217 rules in 12 ms. Remains 274 /373 variables (removed 99) and now considering 387/566 (removed 179) transitions.
// Phase 1: matrix 387 rows 274 cols
[2025-06-07 18:50:45] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:50:45] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-06-07 18:50:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:50:45] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2025-06-07 18:50: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/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 387/661 variables, 274/301 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 0/661 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 301 constraints, problems are : Problem set: 0 solved, 386 unsolved in 25093 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (OVERLAPS) 387/661 variables, 274/301 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 386/687 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:20] [INFO ] Deduced a trap along path composed of 9 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-07 18:51:20] [INFO ] Deduced a trap along path composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 2/689 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:38] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:51:38] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 8 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/661 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 691 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 55142ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 55143ms
Starting structural reductions in LTL mode, iteration 1 : 274/373 places, 387/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55440 ms. Remains : 274/373 places, 387/566 transitions.
[2025-06-07 18:51:40] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:51:40] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:51:40] [INFO ] Input system was already deterministic with 387 transitions.
[2025-06-07 18:51:40] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:51:40] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:51:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9489993877204129210.gal : 2 ms
[2025-06-07 18:51:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13012164960593122700.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/CTLFireability9489993877204129210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13012164960593122700.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.31795e+25,0.218427,11588,2,2026,5,39502,6,0,1485,30511,0


Converting to forward existential form...Done !
original formula: EX(E(E(!((AG((p288==1)) * (p64!=1))) U (p155!=1)) U (E((((p7==1)||(p192==1))||((p437==1)||(p493==1))) U AX((p7==1))) * EX(EG((p308==1))))...157
=> equivalent forward existential formula: [FwdG(EY((FwdU(EY(Init),E(!((!(E(TRUE U !((p288==1)))) * (p64!=1))) U (p155!=1))) * E((((p7==1)||(p192==1))||((p...219
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t29, t36, t40, t45, t46, t50, t56, t60, t65, t69, t74, t75, t79, t85, t89, t95,...453
(forward)formula 0,0,3.55608,115864,1,0,711,625369,814,342,9820,548523,873
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 320 transition count 498
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 320 transition count 498
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 111 place count 320 transition count 493
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 141 place count 290 transition count 453
Iterating global reduction 1 with 30 rules applied. Total rules applied 171 place count 290 transition count 453
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 290 transition count 451
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 192 place count 271 transition count 402
Iterating global reduction 2 with 19 rules applied. Total rules applied 211 place count 271 transition count 402
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 221 place count 271 transition count 392
Applied a total of 221 rules in 39 ms. Remains 271 /373 variables (removed 102) and now considering 392/566 (removed 174) transitions.
// Phase 1: matrix 392 rows 271 cols
[2025-06-07 18:51:44] [INFO ] Computed 27 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:51:44] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-06-07 18:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:51:44] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2025-06-07 18:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 392/663 variables, 271/298 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 0/663 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 298 constraints, problems are : Problem set: 0 solved, 391 unsolved in 26339 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 392/663 variables, 271/298 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 391/689 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:18] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 1/690 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:24] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:31] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:31] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:32] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:35] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:36] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:36] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:37] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:52:38] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 699 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56386ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 56386ms
Starting structural reductions in LTL mode, iteration 1 : 271/373 places, 392/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56735 ms. Remains : 271/373 places, 392/566 transitions.
[2025-06-07 18:52:41] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:52:41] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:52:41] [INFO ] Input system was already deterministic with 392 transitions.
[2025-06-07 18:52:41] [INFO ] Flatten gal took : 12 ms
[2025-06-07 18:52:41] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:52:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6601307902731855915.gal : 2 ms
[2025-06-07 18:52:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13690257003476959296.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/CTLFireability6601307902731855915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13690257003476959296.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.70783e+25,0.199835,10900,2,1898,5,36025,6,0,1478,26651,0


Converting to forward existential form...Done !
original formula: AG(((EG((p233==0)) + AX((p484==0))) * (!(E(((AF((p216==1)) + (p497==1)) + (p217==1)) U ((p279==1)&&(p332==1)))) + A((AG((p340==1)) + ((p8...189
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !(EG((p233==0))))) * !((p484==0)))] = FALSE * [(FwdU((FwdU(Init,TRUE) * !(!((E(!((p406=...342
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t38, t42, t47, t48, t52, t58, t62, t67, t71, t76, t79, t80, t84, t90,...447
Detected timeout of ITS tools.
[2025-06-07 18:53:11] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:53:11] [INFO ] Applying decomposition
[2025-06-07 18:53:11] [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/graph15047346977495963446.txt' '-o' '/tmp/graph15047346977495963446.bin' '-w' '/tmp/graph15047346977495963446.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15047346977495963446.bin' '-l' '-1' '-v' '-w' '/tmp/graph15047346977495963446.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:53:11] [INFO ] Decomposing Gal with order
[2025-06-07 18:53:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:53:11] [INFO ] Removed a total of 285 redundant transitions.
[2025-06-07 18:53:11] [INFO ] Flatten gal took : 14 ms
[2025-06-07 18:53:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2025-06-07 18:53:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11991294998489130412.gal : 2 ms
[2025-06-07 18:53:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9861916872084641483.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/CTLFireability11991294998489130412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9861916872084641483.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.70783e+25,0.190228,12012,1738,30,14941,562,600,26146,73,1156,0


Converting to forward existential form...Done !
original formula: AG(((EG((i12.u30.p233==0)) + AX((i25.u70.p484==0))) * (!(E(((AF((i11.u28.p216==1)) + (i25.u72.p497==1)) + (i11.u28.p217==1)) U ((i14.u38....275
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !(EG((i12.u30.p233==0))))) * !((i25.u70.p484==0)))] = FALSE * [(FwdU((FwdU(Init,TRUE) *...444
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t47, t79, t119, t169, i0.t273, i1.u6.t264, i2.t254, i3.t244, i4.t234, i5.u14.t224, i...699
Using 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 a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
(forward)formula 0,0,4.9371,167788,1,0,334726,839,4053,416030,427,1944,541148
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 316 transition count 488
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 316 transition count 488
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 316 transition count 482
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 152 place count 284 transition count 441
Iterating global reduction 1 with 32 rules applied. Total rules applied 184 place count 284 transition count 441
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 186 place count 284 transition count 439
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 207 place count 263 transition count 383
Iterating global reduction 2 with 21 rules applied. Total rules applied 228 place count 263 transition count 383
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 240 place count 263 transition count 371
Applied a total of 240 rules in 14 ms. Remains 263 /373 variables (removed 110) and now considering 371/566 (removed 195) transitions.
// Phase 1: matrix 371 rows 263 cols
[2025-06-07 18:53:16] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:53:16] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-07 18:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:53:16] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-07 18:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/634 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 0/634 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 634/634 variables, and 290 constraints, problems are : Problem set: 0 solved, 370 unsolved in 23568 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/634 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 370/660 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:49] [INFO ] Deduced a trap along path composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:54] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:55] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:55] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:55] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 4/665 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:53:59] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:01] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:54:06] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/634 variables, and 668 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53622ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 53623ms
Starting structural reductions in LTL mode, iteration 1 : 263/373 places, 371/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53874 ms. Remains : 263/373 places, 371/566 transitions.
[2025-06-07 18:54:10] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:54:10] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:54:10] [INFO ] Input system was already deterministic with 371 transitions.
[2025-06-07 18:54:10] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:54:10] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:54:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7171592532287450696.gal : 2 ms
[2025-06-07 18:54:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9703895611904436569.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/CTLFireability7171592532287450696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9703895611904436569.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,3.07022e+25,0.179715,10348,2,1779,5,33362,6,0,1425,23641,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(AX(EX(((p180==1)&&(p309==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(EX(!(EX(((p180==1)&&(p309==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...435
(forward)formula 0,0,3.49978,114388,1,0,679,611291,764,330,8720,582106,822
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Graph (trivial) has 351 edges and 373 vertex of which 51 / 373 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 330 transition count 431
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 134 rules applied. Total rules applied 222 place count 243 transition count 384
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 244 place count 221 transition count 384
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 244 place count 221 transition count 373
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 266 place count 210 transition count 373
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 310 place count 166 transition count 308
Iterating global reduction 3 with 44 rules applied. Total rules applied 354 place count 166 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 360 place count 166 transition count 302
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 360 place count 166 transition count 290
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 384 place count 154 transition count 290
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 391 place count 147 transition count 255
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 147 transition count 255
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 405 place count 147 transition count 248
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 535 place count 82 transition count 183
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 539 place count 78 transition count 163
Iterating global reduction 5 with 4 rules applied. Total rules applied 543 place count 78 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 547 place count 78 transition count 159
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 549 place count 76 transition count 157
Applied a total of 549 rules in 38 ms. Remains 76 /373 variables (removed 297) and now considering 157/566 (removed 409) transitions.
[2025-06-07 18:54:13] [INFO ] Flow matrix only has 77 transitions (discarded 80 similar events)
// Phase 1: matrix 77 rows 76 cols
[2025-06-07 18:54:13] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:54:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 18:54:13] [INFO ] Flow matrix only has 77 transitions (discarded 80 similar events)
[2025-06-07 18:54:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:54:13] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:54:13] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-07 18:54:13] [INFO ] Flow matrix only has 77 transitions (discarded 80 similar events)
[2025-06-07 18:54:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 76/152 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/153 variables, and 103 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2152 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 76/152 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 101/204 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/153 variables, and 204 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2253 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4415ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 4416ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/373 places, 157/566 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4585 ms. Remains : 76/373 places, 157/566 transitions.
[2025-06-07 18:54:18] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:54:18] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:54:18] [INFO ] Input system was already deterministic with 157 transitions.
RANDOM walk for 219 steps (3 resets) in 7 ms. (27 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 18:54:18] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:54:18] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:54:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10826095721814527243.gal : 1 ms
[2025-06-07 18:54:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5793242573149416979.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10826095721814527243.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5793242573149416979.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Graph (trivial) has 335 edges and 373 vertex of which 44 / 373 are part of one of the 8 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 336 transition count 440
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 130 rules applied. Total rules applied 216 place count 251 transition count 395
Reduce places removed 21 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 24 rules applied. Total rules applied 240 place count 230 transition count 392
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 244 place count 227 transition count 391
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 244 place count 227 transition count 380
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 266 place count 216 transition count 380
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 307 place count 175 transition count 319
Iterating global reduction 4 with 41 rules applied. Total rules applied 348 place count 175 transition count 319
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 353 place count 175 transition count 314
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 353 place count 175 transition count 304
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 373 place count 165 transition count 304
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 380 place count 158 transition count 269
Iterating global reduction 5 with 7 rules applied. Total rules applied 387 place count 158 transition count 269
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 394 place count 158 transition count 262
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 526 place count 92 transition count 196
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 531 place count 87 transition count 171
Iterating global reduction 6 with 5 rules applied. Total rules applied 536 place count 87 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 541 place count 87 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 543 place count 85 transition count 164
Applied a total of 543 rules in 38 ms. Remains 85 /373 variables (removed 288) and now considering 164/566 (removed 402) transitions.
[2025-06-07 18:54:18] [INFO ] Flow matrix only has 103 transitions (discarded 61 similar events)
// Phase 1: matrix 103 rows 85 cols
[2025-06-07 18:54:18] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:54:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 18:54:18] [INFO ] Flow matrix only has 103 transitions (discarded 61 similar events)
[2025-06-07 18:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:54:18] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:54:18] [INFO ] Redundant transitions in 1 ms returned []
Running 112 sub problems to find dead transitions.
[2025-06-07 18:54:18] [INFO ] Flow matrix only has 103 transitions (discarded 61 similar events)
[2025-06-07 18:54:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 102/187 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/188 variables, and 112 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2642 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 4/85 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 102/187 variables, 85/112 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 112/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/188 variables, and 224 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2817 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 85/85 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5470ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 5471ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/373 places, 164/566 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5648 ms. Remains : 85/373 places, 164/566 transitions.
[2025-06-07 18:54:24] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:54:24] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:54:24] [INFO ] Input system was already deterministic with 164 transitions.
[2025-06-07 18:54:24] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:54:24] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:54:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14357255784290663833.gal : 1 ms
[2025-06-07 18:54:24] [INFO ] Time to serialize properties into /tmp/CTLFireability7046938229821864770.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/CTLFireability14357255784290663833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7046938229821864770.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81597e+12,0.033677,4824,2,144,5,2591,6,0,499,1580,0


Converting to forward existential form...Done !
original formula: EF(((A(!(EG((p279==1))) U EG(A(((p497==1)&&(p506==1)) U (p79==1)))) * (p344==1)) * ((AF((p214==1)) + EF((p196==0))) + (p517==0))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!((E(!(EG(!((E(!((p79==1)) U (!(((p497==1)&&(p506==1))) * !((p79==1)))) + EG(!((p79==1))...1169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 162/0/2
Hit Full ! (commute/partial/dont) 158/0/6
Hit Full ! (commute/partial/dont) 158/0/6
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.07094,118636,1,0,250,454489,49,208,2751,875788,213
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 316 transition count 488
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 316 transition count 488
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 316 transition count 482
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 152 place count 284 transition count 441
Iterating global reduction 1 with 32 rules applied. Total rules applied 184 place count 284 transition count 441
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 186 place count 284 transition count 439
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 207 place count 263 transition count 383
Iterating global reduction 2 with 21 rules applied. Total rules applied 228 place count 263 transition count 383
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 240 place count 263 transition count 371
Applied a total of 240 rules in 19 ms. Remains 263 /373 variables (removed 110) and now considering 371/566 (removed 195) transitions.
// Phase 1: matrix 371 rows 263 cols
[2025-06-07 18:54:28] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:54:28] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-07 18:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:54:28] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2025-06-07 18:54:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/634 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (OVERLAPS) 0/634 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 634/634 variables, and 290 constraints, problems are : Problem set: 0 solved, 370 unsolved in 23700 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (OVERLAPS) 371/634 variables, 263/290 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 370/660 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:01] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:06] [INFO ] Deduced a trap composed of 30 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-07 18:55:07] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:07] [INFO ] Deduced a trap composed of 47 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-07 18:55:08] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 4/665 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:11] [INFO ] Deduced a trap composed of 31 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-07 18:55:13] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/634 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:18] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/634 variables, 1/668 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/634 variables, and 668 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53759ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 53760ms
Starting structural reductions in LTL mode, iteration 1 : 263/373 places, 371/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54028 ms. Remains : 263/373 places, 371/566 transitions.
[2025-06-07 18:55:22] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:55:22] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:55:22] [INFO ] Input system was already deterministic with 371 transitions.
[2025-06-07 18:55:22] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:55:22] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:55:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6845864194406206079.gal : 1 ms
[2025-06-07 18:55:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13600141511211475027.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/CTLFireability6845864194406206079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13600141511211475027.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,3.07022e+25,0.185389,10348,2,1779,5,33362,6,0,1425,23641,0


Converting to forward existential form...Done !
original formula: EF(AX(AX(((p180==1)&&(p306==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(((p180==1)&&(p306==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...435
(forward)formula 0,1,2.04063,70076,1,0,610,423671,759,321,8535,294769,753
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 373/373 places, 566/566 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 316 transition count 488
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 316 transition count 488
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 120 place count 316 transition count 482
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 153 place count 283 transition count 436
Iterating global reduction 1 with 33 rules applied. Total rules applied 186 place count 283 transition count 436
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 189 place count 283 transition count 433
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 210 place count 262 transition count 377
Iterating global reduction 2 with 21 rules applied. Total rules applied 231 place count 262 transition count 377
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 262 transition count 365
Applied a total of 243 rules in 12 ms. Remains 262 /373 variables (removed 111) and now considering 365/566 (removed 201) transitions.
// Phase 1: matrix 365 rows 262 cols
[2025-06-07 18:55:24] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:55:24] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-07 18:55:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:55:24] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2025-06-07 18:55: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/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 365/627 variables, 262/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 0/627 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 289 constraints, problems are : Problem set: 0 solved, 364 unsolved in 22834 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 365/627 variables, 262/289 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 364/653 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:55:56] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:01] [INFO ] Deduced a trap composed of 31 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-07 18:56:02] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:05] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:06] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/627 variables, 2/658 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:10] [INFO ] Deduced a trap composed of 31 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-07 18:56:10] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:56:10] [INFO ] Deduced a trap composed of 30 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-07 18:56:12] [INFO ] Deduced a trap composed of 45 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-07 18:56:14] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/627 variables, 5/663 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/627 variables, and 663 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52880ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 52881ms
Starting structural reductions in LTL mode, iteration 1 : 262/373 places, 365/566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53150 ms. Remains : 262/373 places, 365/566 transitions.
[2025-06-07 18:56:17] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:56:17] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:56:17] [INFO ] Input system was already deterministic with 365 transitions.
[2025-06-07 18:56:17] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:56:17] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:56:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18239849871816186522.gal : 1 ms
[2025-06-07 18:56:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18318294576539295439.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/CTLFireability18239849871816186522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18318294576539295439.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,2.7632e+25,0.169972,10284,2,1774,5,33142,6,0,1415,23518,0


Converting to forward existential form...Done !
original formula: AG(EX((p22==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p22==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...435
(forward)formula 0,0,1.78789,67508,1,0,600,411428,746,314,8428,276414,737
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-07 18:56:19] [INFO ] Flatten gal took : 14 ms
[2025-06-07 18:56:19] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:56:19] [INFO ] Applying decomposition
[2025-06-07 18:56:19] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6973236339276465788.txt' '-o' '/tmp/graph6973236339276465788.bin' '-w' '/tmp/graph6973236339276465788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6973236339276465788.bin' '-l' '-1' '-v' '-w' '/tmp/graph6973236339276465788.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:56:19] [INFO ] Decomposing Gal with order
[2025-06-07 18:56:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:56:19] [INFO ] Removed a total of 439 redundant transitions.
[2025-06-07 18:56:19] [INFO ] Flatten gal took : 20 ms
[2025-06-07 18:56:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 5 ms.
[2025-06-07 18:56:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14933114400401033558.gal : 3 ms
[2025-06-07 18:56:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9192834349011798095.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/CTLFireability14933114400401033558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9192834349011798095.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 2 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,3.57199e+29,0.279321,15660,2539,42,23402,683,885,33906,84,1687,0


Converting to forward existential form...Done !
original formula: E(EX((!(((EG((i15.u77.p315==1)) + (((i6.u24.p99==1)&&(i9.u42.p169==1))&&(i26.i0.u120.p511==1))) + (i14.i0.u70.p292==1))) + A(((i10.u51.p1...314
=> equivalent forward existential formula: [((FwdU(Init,EX((!(((EG((i15.u77.p315==1)) + (((i6.u24.p99==1)&&(i9.u42.p169==1))&&(i26.i0.u120.p511==1))) + (i1...483
Reverse transition relation is NOT exact ! Due to transitions t72, t102, t186, t306, i0.t199, i0.t192, i0.u65.t187, i1.t310, i1.u25.t312, i2.t370, i2.u4.t3...1157
Using 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
(forward)formula 0,1,632.773,3003188,1,0,4.66892e+06,1050,1879,9.61757e+06,166,2699,2855510
FORMULA Champagne-PT-H07T0R-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX((((EX((EF((i11.u52.p206==1)) * (E((i13.u63.p259==1) U (i18.i0.u85.p349==1)) + AF((i10.u50.p197==1))))) + EX((i15.u77.p317==1))) + (((...757
=> equivalent forward existential formula: ([((((EY(Init) * !(((i19.u113.p474==1)&&(i19.u111.p479==1)))) * !((((i26.i0.u120.p512==0)&&((((i22.i0.u102.p423=...1111
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Using 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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
[2025-06-07 19:21:55] [INFO ] Applying decomposition
[2025-06-07 19:21:55] [INFO ] Flatten gal took : 20 ms
[2025-06-07 19:21:55] [INFO ] Decomposing Gal with order
[2025-06-07 19:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:21:55] [INFO ] Removed a total of 297 redundant transitions.
[2025-06-07 19:21:55] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 197 labels/synchronizations in 8 ms.
[2025-06-07 19:21:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4663799757503683843.gal : 3 ms
[2025-06-07 19:21:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15252796410619712195.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/CTLFireability4663799757503683843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15252796410619712195.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,3.57199e+29,0.314811,15712,790,748,19426,3368,589,54616,244,31332,0


Converting to forward existential form...Done !
original formula: (AX((((EX((EF((i1.i0.i0.u22.p206==1)) * (E((i1.i1.i0.i0.i0.u28.p259==1) U (i1.i1.i1.i0.i0.i0.u37.p349==1)) + AF((i1.i0.i0.i0.u21.p197==1)...1035
=> equivalent forward existential formula: ([((((EY(Init) * !(((i1.i1.i1.i1.i1.i0.u48.p474==1)&&(i1.i1.i1.i1.i1.i0.u48.p479==1)))) * !((((i1.i1.i1.i1.i1.i1...1465
Reverse transition relation is NOT exact ! Due to transitions i0.u13.t292, i0.u13.t296, i0.i0.t306, i0.i0.u12.t310, i0.i0.u12.t312, i0.i0.i0.u11.t322, i0.i...2169

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H07T0R"
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 Champagne-PT-H07T0R, 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 r254-tall-174931339200074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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