Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.7K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 11:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:37 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 83K 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-H06T0R-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H06T0R-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749319585045

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-H06T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 18:06:26] [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:06:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:06:26] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-06-07 18:06:26] [INFO ] Transformed 399 places.
[2025-06-07 18:06:26] [INFO ] Transformed 528 transitions.
[2025-06-07 18:06:26] [INFO ] Found NUPN structural information;
[2025-06-07 18:06:26] [INFO ] Parsed PT model containing 399 places and 528 transitions and 1345 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 92 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 528/528 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 321 transition count 450
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 321 transition count 450
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 190 place count 287 transition count 416
Iterating global reduction 0 with 34 rules applied. Total rules applied 224 place count 287 transition count 416
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 234 place count 277 transition count 402
Iterating global reduction 0 with 10 rules applied. Total rules applied 244 place count 277 transition count 402
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 247 place count 277 transition count 399
Applied a total of 247 rules in 85 ms. Remains 277 /399 variables (removed 122) and now considering 399/528 (removed 129) transitions.
// Phase 1: matrix 399 rows 277 cols
[2025-06-07 18:06:26] [INFO ] Computed 20 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:06:26] [INFO ] Implicit Places using invariants in 277 ms returned []
[2025-06-07 18:06:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:06:27] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2025-06-07 18:06:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 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:06:32] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:32] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:32] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:32] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:32] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:32] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:32] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:32] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:33] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:33] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:33] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:33] [INFO ] Deduced a trap composed of 27 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:06:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:33] [INFO ] Deduced a trap composed of 47 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:06:33] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 15/35 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:06:35] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:35] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:35] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (OVERLAPS) 399/676 variables, 277/315 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 315 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 18/18 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/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 399/676 variables, 277/315 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 398/713 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:07:03] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:03] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:03] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:04] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:04] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:04] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:04] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:04] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:04] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:04] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:05] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:05] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:05] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:06] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:06] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:06] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:06] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 17/730 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:07:10] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:10] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:10] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:10] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:12] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 5/735 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:07:19] [INFO ] Deduced a trap along path composed of 11 places in 45 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 736 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 277/399 places, 399/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60776 ms. Remains : 277/399 places, 399/528 transitions.
Support contains 92 out of 277 places after structural reductions.
[2025-06-07 18:07:27] [INFO ] Flatten gal took : 46 ms
[2025-06-07 18:07:27] [INFO ] Flatten gal took : 26 ms
[2025-06-07 18:07:27] [INFO ] Input system was already deterministic with 399 transitions.
Support contains 89 out of 277 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (168 resets) in 1038 ms. (38 steps per ms) remains 2/62 properties
BEST_FIRST walk for 40003 steps (12 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 109 ms. (363 steps per ms) remains 1/2 properties
[2025-06-07 18:07:28] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/277 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/676 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/676 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/676 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 258/277 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:28] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:28] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 399/676 variables, 277/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/676 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 686ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 100 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 6 ms.
[2025-06-07 18:07:28] [INFO ] Flatten gal took : 17 ms
[2025-06-07 18:07:28] [INFO ] Flatten gal took : 28 ms
[2025-06-07 18:07:28] [INFO ] Input system was already deterministic with 399 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Graph (trivial) has 253 edges and 277 vertex of which 36 / 277 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 246 transition count 302
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 92 rules applied. Total rules applied 154 place count 185 transition count 271
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 168 place count 171 transition count 271
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 168 place count 171 transition count 262
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 186 place count 162 transition count 262
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 215 place count 133 transition count 221
Iterating global reduction 3 with 29 rules applied. Total rules applied 244 place count 133 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 248 place count 133 transition count 217
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 248 place count 133 transition count 210
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 262 place count 126 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 264 place count 124 transition count 202
Iterating global reduction 4 with 2 rules applied. Total rules applied 266 place count 124 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 268 place count 124 transition count 200
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 372 place count 72 transition count 148
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 378 place count 66 transition count 125
Iterating global reduction 5 with 6 rules applied. Total rules applied 384 place count 66 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 390 place count 66 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 392 place count 64 transition count 117
Applied a total of 392 rules in 121 ms. Remains 64 /277 variables (removed 213) and now considering 117/399 (removed 282) transitions.
[2025-06-07 18:07:29] [INFO ] Flow matrix only has 78 transitions (discarded 39 similar events)
// Phase 1: matrix 78 rows 64 cols
[2025-06-07 18:07:29] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-07 18:07:29] [INFO ] Flow matrix only has 78 transitions (discarded 39 similar events)
[2025-06-07 18:07:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:29] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:07:29] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-07 18:07:29] [INFO ] Flow matrix only has 78 transitions (discarded 39 similar events)
[2025-06-07 18:07: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/60 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 4/64 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/141 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/141 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/142 variables, and 84 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1643 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 4/64 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/141 variables, 64/84 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 76/160 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/142 variables, and 160 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1529 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3182ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3182ms
Starting structural reductions in SI_CTL mode, iteration 1 : 64/277 places, 117/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3520 ms. Remains : 64/277 places, 117/399 transitions.
[2025-06-07 18:07:32] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:07:32] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:07:32] [INFO ] Input system was already deterministic with 117 transitions.
[2025-06-07 18:07:32] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:07:32] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:07:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9951006897751580460.gal : 2 ms
[2025-06-07 18:07:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3145820665638656091.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/CTLFireability9951006897751580460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3145820665638656091.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,4.89776e+09,0.028553,4432,2,109,5,1569,6,0,370,919,0


Converting to forward existential form...Done !
original formula: AG((EF(((((p21==1)&&(p109==1))||(p13==1))||(p139==0))) * (AG((p132==1)) + (AF((p362==0)) * ((p21==0)||(p116==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((((p21==1)&&(p109==1))||(p13==1))||(p139==0)))))] = FALSE * ([FwdG((FwdU(Init,T...306
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.045774,4688,1,0,10,4867,17,3,1698,1599,6
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Graph (trivial) has 223 edges and 277 vertex of which 26 / 277 are part of one of the 4 SCC in 1 ms
Free SCC test removed 22 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 254 transition count 317
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 86 rules applied. Total rules applied 142 place count 199 transition count 286
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 19 rules applied. Total rules applied 161 place count 184 transition count 282
Reduce places removed 4 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 6 rules applied. Total rules applied 167 place count 180 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 179 transition count 280
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 168 place count 179 transition count 270
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 188 place count 169 transition count 270
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 217 place count 140 transition count 228
Iterating global reduction 5 with 29 rules applied. Total rules applied 246 place count 140 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 250 place count 140 transition count 224
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 250 place count 140 transition count 219
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 260 place count 135 transition count 219
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 261 place count 134 transition count 216
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 134 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 134 transition count 215
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 361 place count 85 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 362 place count 85 transition count 165
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 364 place count 83 transition count 159
Iterating global reduction 8 with 2 rules applied. Total rules applied 366 place count 83 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 368 place count 83 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 370 place count 81 transition count 155
Applied a total of 370 rules in 51 ms. Remains 81 /277 variables (removed 196) and now considering 155/399 (removed 244) transitions.
[2025-06-07 18:07:32] [INFO ] Flow matrix only has 133 transitions (discarded 22 similar events)
// Phase 1: matrix 133 rows 81 cols
[2025-06-07 18:07:32] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:32] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-07 18:07:32] [INFO ] Flow matrix only has 133 transitions (discarded 22 similar events)
[2025-06-07 18:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:07:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 18:07:32] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:07:32] [INFO ] Redundant transitions in 4 ms returned []
Running 121 sub problems to find dead transitions.
[2025-06-07 18:07:32] [INFO ] Flow matrix only has 133 transitions (discarded 22 similar events)
[2025-06-07 18:07:32] [INFO ] Invariant cache hit.
[2025-06-07 18:07:32] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 11/81 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:33] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 132/213 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/214 variables, and 104 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3054 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 81/81 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 11/81 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 132/213 variables, 81/102 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 121/225 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:07:37] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/214 variables, and 226 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3910 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 81/81 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6980ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 6981ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/277 places, 155/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7155 ms. Remains : 81/277 places, 155/399 transitions.
[2025-06-07 18:07:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:07:39] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:07:39] [INFO ] Input system was already deterministic with 155 transitions.
[2025-06-07 18:07:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:07:39] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:07:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13010783477797976344.gal : 2 ms
[2025-06-07 18:07:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8378746846841566431.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/CTLFireability13010783477797976344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8378746846841566431.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.9303e+11,0.026051,4756,2,276,5,2831,6,0,476,1930,0


Converting to forward existential form...Done !
original formula: AG((!(E(((((p279==1)&&(p346==1))||(p354==1))||(((p59==1)&&(p147==1))||(!((p139==1)||(p145==1))))) U ((p78==1)&&(p128==1)))) + (E((p23!=1)...278
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(!(E(((((p279==1)&&(p346==1))||(p354==1))||(((p59==1)&&(p147==1))||(!((p139==1)||(p145==1...499
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t37, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/...174
Hit Full ! (commute/partial/dont) 153/0/2
(forward)formula 0,0,26.6857,744624,1,0,591,2.68978e+06,341,307,3332,6.78077e+06,666
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Graph (trivial) has 267 edges and 277 vertex of which 41 / 277 are part of one of the 7 SCC in 1 ms
Free SCC test removed 34 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 242 transition count 295
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 95 rules applied. Total rules applied 159 place count 179 transition count 263
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 175 place count 164 transition count 262
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 178 place count 163 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 162 transition count 260
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 179 place count 162 transition count 253
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 193 place count 155 transition count 253
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 224 place count 124 transition count 206
Iterating global reduction 5 with 31 rules applied. Total rules applied 255 place count 124 transition count 206
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 260 place count 124 transition count 201
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 260 place count 124 transition count 193
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 276 place count 116 transition count 193
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 278 place count 114 transition count 185
Iterating global reduction 6 with 2 rules applied. Total rules applied 280 place count 114 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 282 place count 114 transition count 183
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 382 place count 64 transition count 133
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 388 place count 58 transition count 110
Iterating global reduction 7 with 6 rules applied. Total rules applied 394 place count 58 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 400 place count 58 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 402 place count 56 transition count 102
Applied a total of 402 rules in 43 ms. Remains 56 /277 variables (removed 221) and now considering 102/399 (removed 297) transitions.
[2025-06-07 18:08:06] [INFO ] Flow matrix only has 56 transitions (discarded 46 similar events)
// Phase 1: matrix 56 rows 56 cols
[2025-06-07 18:08:06] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-07 18:08:06] [INFO ] Flow matrix only has 56 transitions (discarded 46 similar events)
[2025-06-07 18:08:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:06] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:08:06] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2025-06-07 18:08:06] [INFO ] Flow matrix only has 56 transitions (discarded 46 similar events)
[2025-06-07 18:08:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/111 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 76 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 2/56 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 60/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 136 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2125ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2125ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/277 places, 102/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2280 ms. Remains : 56/277 places, 102/399 transitions.
[2025-06-07 18:08:08] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:08:08] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:08:08] [INFO ] Input system was already deterministic with 102 transitions.
RANDOM walk for 385 steps (11 resets) in 9 ms. (38 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 18:08:09] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:08:09] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:08:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13531500325308324035.gal : 1 ms
[2025-06-07 18:08:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14451629730207069960.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/ReachabilityCardinality13531500325308324035.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14451629730207069960.prop' '--nowitness' '--gen-order' 'FOLLOW'
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 : 277/277 places, 399/399 transitions.
Graph (trivial) has 260 edges and 277 vertex of which 41 / 277 are part of one of the 7 SCC in 1 ms
Free SCC test removed 34 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 242 transition count 297
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 95 rules applied. Total rules applied 157 place count 181 transition count 263
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 173 place count 165 transition count 263
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 173 place count 165 transition count 255
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 189 place count 157 transition count 255
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 220 place count 126 transition count 208
Iterating global reduction 3 with 31 rules applied. Total rules applied 251 place count 126 transition count 208
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 256 place count 126 transition count 203
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 256 place count 126 transition count 197
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 268 place count 120 transition count 197
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 270 place count 118 transition count 189
Iterating global reduction 4 with 2 rules applied. Total rules applied 272 place count 118 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 274 place count 118 transition count 187
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 376 place count 67 transition count 136
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 380 place count 63 transition count 122
Iterating global reduction 5 with 4 rules applied. Total rules applied 384 place count 63 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 388 place count 63 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 390 place count 61 transition count 116
Applied a total of 390 rules in 24 ms. Remains 61 /277 variables (removed 216) and now considering 116/399 (removed 283) transitions.
[2025-06-07 18:08:09] [INFO ] Flow matrix only has 70 transitions (discarded 46 similar events)
// Phase 1: matrix 70 rows 61 cols
[2025-06-07 18:08:09] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-07 18:08:09] [INFO ] Flow matrix only has 70 transitions (discarded 46 similar events)
[2025-06-07 18:08:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:09] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:08:09] [INFO ] Redundant transitions in 3 ms returned []
Running 74 sub problems to find dead transitions.
[2025-06-07 18:08:09] [INFO ] Flow matrix only has 70 transitions (discarded 46 similar events)
[2025-06-07 18:08:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 3/61 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 69/130 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/131 variables, and 81 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 3/61 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 69/130 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 74/155 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/131 variables, and 155 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2796ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2796ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/277 places, 116/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2956 ms. Remains : 61/277 places, 116/399 transitions.
[2025-06-07 18:08:12] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:08:12] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:08:12] [INFO ] Input system was already deterministic with 116 transitions.
[2025-06-07 18:08:12] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:08:12] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:08:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3874152984959808539.gal : 1 ms
[2025-06-07 18:08:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16915998651883421782.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/CTLFireability3874152984959808539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16915998651883421782.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.04073e+09,0.015863,4584,2,103,5,1156,6,0,356,640,0


Converting to forward existential form...Done !
original formula: AF(E((p146==1) U EF(((p171==1)||((p158==1)&&(p192==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E((p146==1) U E(TRUE U ((p171==1)||((p158==1)&&(p192==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 110/0/6
(forward)formula 0,1,0.06242,5736,1,0,11,10188,27,4,1834,6496,10
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Graph (trivial) has 267 edges and 277 vertex of which 41 / 277 are part of one of the 7 SCC in 0 ms
Free SCC test removed 34 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 242 transition count 296
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 96 rules applied. Total rules applied 159 place count 180 transition count 262
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 175 place count 164 transition count 262
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 175 place count 164 transition count 254
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 191 place count 156 transition count 254
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 222 place count 125 transition count 207
Iterating global reduction 3 with 31 rules applied. Total rules applied 253 place count 125 transition count 207
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 258 place count 125 transition count 202
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 258 place count 125 transition count 194
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 274 place count 117 transition count 194
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 276 place count 115 transition count 186
Iterating global reduction 4 with 2 rules applied. Total rules applied 278 place count 115 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 280 place count 115 transition count 184
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 380 place count 65 transition count 134
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 386 place count 59 transition count 111
Iterating global reduction 5 with 6 rules applied. Total rules applied 392 place count 59 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 398 place count 59 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 400 place count 57 transition count 103
Applied a total of 400 rules in 26 ms. Remains 57 /277 variables (removed 220) and now considering 103/399 (removed 296) transitions.
[2025-06-07 18:08:12] [INFO ] Flow matrix only has 57 transitions (discarded 46 similar events)
// Phase 1: matrix 57 rows 57 cols
[2025-06-07 18:08:12] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-07 18:08:12] [INFO ] Flow matrix only has 57 transitions (discarded 46 similar events)
[2025-06-07 18:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:12] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:08:12] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-07 18:08:12] [INFO ] Flow matrix only has 57 transitions (discarded 46 similar events)
[2025-06-07 18:08: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/55 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 56/113 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 77 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/57 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 56/113 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 61/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 138 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2192ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2192ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/277 places, 103/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2325 ms. Remains : 57/277 places, 103/399 transitions.
[2025-06-07 18:08:14] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:08:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:08:14] [INFO ] Input system was already deterministic with 103 transitions.
RANDOM walk for 597 steps (15 resets) in 5 ms. (99 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 18:08:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:08:14] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:08:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15544966489440358483.gal : 2 ms
[2025-06-07 18:08:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17316494921510269126.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/ReachabilityCardinality15544966489440358483.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17316494921510269126.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 236 transition count 348
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 236 transition count 348
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 87 place count 236 transition count 343
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 110 place count 213 transition count 313
Iterating global reduction 1 with 23 rules applied. Total rules applied 133 place count 213 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 137 place count 213 transition count 309
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 149 place count 201 transition count 281
Iterating global reduction 2 with 12 rules applied. Total rules applied 161 place count 201 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 167 place count 201 transition count 275
Applied a total of 167 rules in 11 ms. Remains 201 /277 variables (removed 76) and now considering 275/399 (removed 124) transitions.
// Phase 1: matrix 275 rows 201 cols
[2025-06-07 18:08:14] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:14] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 18:08:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:08:14] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2025-06-07 18:08:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 275/476 variables, 201/221 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 0/476 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 221 constraints, problems are : Problem set: 0 solved, 274 unsolved in 13363 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 275/476 variables, 201/221 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 274/495 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:33] [INFO ] Deduced a trap along path composed of 10 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:33] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:36] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:36] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:37] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:37] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:37] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 5/502 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:40] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:43] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:08:43] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 505 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43397ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 43397ms
Starting structural reductions in LTL mode, iteration 1 : 201/277 places, 275/399 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43593 ms. Remains : 201/277 places, 275/399 transitions.
[2025-06-07 18:08:58] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:08:58] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:08:58] [INFO ] Input system was already deterministic with 275 transitions.
[2025-06-07 18:08:58] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:08:58] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:08:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1763527088270828821.gal : 2 ms
[2025-06-07 18:08:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1276484837694012596.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/CTLFireability1763527088270828821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1276484837694012596.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.5372e+19,0.09544,7564,2,1233,5,17995,6,0,1081,13928,0


Converting to forward existential form...Done !
original formula: EG((AX(((((p62==1)||((p219==1)&&(p290==1)))&&((p24==1)||((p257==1)&&(p268==1))))||(p116==1))) + AG((A(AG((p231==1)) U EX((p74==1))) + AF(...167
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(((((p62==1)||((p219==1)&&(p290==1)))&&((p24==1)||((p257==1)&&(p268==1))))||(p116==1))))) + !(...299
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t43, t44, t48, t54, t58, t64, t68, t74, t75, t79, t85, t88, t90,...363
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,21.5673,682228,1,0,2337,4.00608e+06,593,1311,6973,5.235e+06,2493
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-05 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 : 277/277 places, 399/399 transitions.
Graph (trivial) has 256 edges and 277 vertex of which 38 / 277 are part of one of the 7 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 245 transition count 302
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 92 rules applied. Total rules applied 153 place count 185 transition count 270
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 170 place count 170 transition count 268
Reduce places removed 2 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 4 rules applied. Total rules applied 174 place count 168 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 175 place count 167 transition count 266
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 175 place count 167 transition count 257
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 193 place count 158 transition count 257
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 223 place count 128 transition count 211
Iterating global reduction 5 with 30 rules applied. Total rules applied 253 place count 128 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 258 place count 128 transition count 206
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 258 place count 128 transition count 199
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 272 place count 121 transition count 199
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 274 place count 119 transition count 191
Iterating global reduction 6 with 2 rules applied. Total rules applied 276 place count 119 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 278 place count 119 transition count 189
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 378 place count 69 transition count 139
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 383 place count 64 transition count 119
Iterating global reduction 7 with 5 rules applied. Total rules applied 388 place count 64 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 393 place count 64 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 395 place count 62 transition count 112
Applied a total of 395 rules in 37 ms. Remains 62 /277 variables (removed 215) and now considering 112/399 (removed 287) transitions.
[2025-06-07 18:09:19] [INFO ] Flow matrix only has 68 transitions (discarded 44 similar events)
// Phase 1: matrix 68 rows 62 cols
[2025-06-07 18:09:19] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:09:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-07 18:09:19] [INFO ] Flow matrix only has 68 transitions (discarded 44 similar events)
[2025-06-07 18:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:09:19] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:09:19] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2025-06-07 18:09:19] [INFO ] Flow matrix only has 68 transitions (discarded 44 similar events)
[2025-06-07 18:09:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 67/129 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 67/129 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2589ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2590ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/277 places, 112/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2724 ms. Remains : 62/277 places, 112/399 transitions.
[2025-06-07 18:09:22] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:09:22] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:09:22] [INFO ] Input system was already deterministic with 112 transitions.
[2025-06-07 18:09:22] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:09:22] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:09:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6581659619450631419.gal : 0 ms
[2025-06-07 18:09:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10466633461240989693.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/CTLFireability6581659619450631419.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10466633461240989693.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.0611e+09,0.015073,4492,2,105,5,1201,6,0,356,674,0


Converting to forward existential form...Done !
original formula: EF((EG((((AF((p153==1)) + (p157==1)) * AG((p345==1))) * EF((p200==1)))) * (p86==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p86==1)),(((!(EG(!((p153==1)))) + (p157==1)) * !(E(TRUE U !((p345==1))))) * E(TRUE U (...176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.048937,5388,1,0,11,7195,25,3,1770,3867,11
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 235 transition count 341
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 235 transition count 341
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 91 place count 235 transition count 334
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 111 place count 215 transition count 308
Iterating global reduction 1 with 20 rules applied. Total rules applied 131 place count 215 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 134 place count 215 transition count 305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 146 place count 203 transition count 281
Iterating global reduction 2 with 12 rules applied. Total rules applied 158 place count 203 transition count 281
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 163 place count 203 transition count 276
Applied a total of 163 rules in 13 ms. Remains 203 /277 variables (removed 74) and now considering 276/399 (removed 123) transitions.
// Phase 1: matrix 276 rows 203 cols
[2025-06-07 18:09:22] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:09:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 18:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:09:22] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2025-06-07 18:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:25] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/479 variables, 203/224 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/479 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 224 constraints, problems are : Problem set: 0 solved, 275 unsolved in 15116 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/479 variables, 203/224 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 275/499 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:41] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:44] [INFO ] Deduced a trap along path composed of 9 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:46] [INFO ] Deduced a trap along path composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:47] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:47] [INFO ] Deduced a trap composed of 39 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:09:48] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:48] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:51] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:09:59] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/479 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:02] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:03] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:03] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:03] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:03] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:03] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:04] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:04] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:05] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 9/517 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/479 variables, and 517 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45144ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 45144ms
Starting structural reductions in LTL mode, iteration 1 : 203/277 places, 276/399 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45331 ms. Remains : 203/277 places, 276/399 transitions.
[2025-06-07 18:10:07] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:10:07] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:10:07] [INFO ] Input system was already deterministic with 276 transitions.
[2025-06-07 18:10:08] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:10:08] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:10:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16929294657026084096.gal : 1 ms
[2025-06-07 18:10:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9970071097425391027.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/CTLFireability16929294657026084096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9970071097425391027.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.78177e+19,0.102024,7968,2,1309,5,19400,6,0,1090,16029,0


Converting to forward existential form...Done !
original formula: EX(E(!(E(AG((p61==1)) U E((p195==1) U (p129==1)))) U AF((p368==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(E(!(E(TRUE U !((p61==1)))) U E((p195==1) U (p129==1))))) * !(EG(!((p368==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t21, t26, t27, t31, t36, t40, t45, t46, t50, t56, t60, t65, t69, t74, t75, t79, t85, t89,...374
(forward)formula 0,1,21.3272,685984,1,0,2043,3.48944e+06,594,1095,6792,5.42095e+06,2264
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-07 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 : 277/277 places, 399/399 transitions.
Graph (trivial) has 263 edges and 277 vertex of which 38 / 277 are part of one of the 7 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 245 transition count 301
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 95 rules applied. Total rules applied 157 place count 184 transition count 267
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 174 place count 168 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 167 transition count 266
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 175 place count 167 transition count 258
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 191 place count 159 transition count 258
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 222 place count 128 transition count 211
Iterating global reduction 4 with 31 rules applied. Total rules applied 253 place count 128 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 258 place count 128 transition count 206
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 258 place count 128 transition count 198
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 274 place count 120 transition count 198
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 276 place count 118 transition count 190
Iterating global reduction 5 with 2 rules applied. Total rules applied 278 place count 118 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 280 place count 118 transition count 188
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 378 place count 69 transition count 139
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 384 place count 63 transition count 116
Iterating global reduction 6 with 6 rules applied. Total rules applied 390 place count 63 transition count 116
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 63 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 398 place count 61 transition count 108
Applied a total of 398 rules in 27 ms. Remains 61 /277 variables (removed 216) and now considering 108/399 (removed 291) transitions.
[2025-06-07 18:10:29] [INFO ] Flow matrix only has 63 transitions (discarded 45 similar events)
// Phase 1: matrix 63 rows 61 cols
[2025-06-07 18:10:29] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-07 18:10:29] [INFO ] Flow matrix only has 63 transitions (discarded 45 similar events)
[2025-06-07 18:10:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:10:29] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2025-06-07 18:10:29] [INFO ] Flow matrix only has 63 transitions (discarded 45 similar events)
[2025-06-07 18:10: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/58 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 3/61 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 62/123 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/124 variables, and 81 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1151 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 3/61 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 62/123 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 66/147 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/124 variables, and 147 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2367ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2369ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/277 places, 108/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2507 ms. Remains : 61/277 places, 108/399 transitions.
[2025-06-07 18:10:32] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:10:32] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:32] [INFO ] Input system was already deterministic with 108 transitions.
[2025-06-07 18:10:32] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:32] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10974645144972540085.gal : 1 ms
[2025-06-07 18:10:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9897010909067978506.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/CTLFireability10974645144972540085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9897010909067978506.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.75499e+09,0.014517,4468,2,103,5,1183,6,0,347,704,0


Converting to forward existential form...Done !
original formula: E(!((EF((p34==1)) + (p42==1))) U !(EF((p84==1))))
=> equivalent forward existential formula: [(FwdU(Init,!((E(TRUE U (p34==1)) + (p42==1)))) * !(E(TRUE U (p84==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.051196,5620,1,0,14,10330,20,6,1574,7262,12
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Graph (trivial) has 252 edges and 277 vertex of which 37 / 277 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 245 transition count 301
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 94 rules applied. Total rules applied 155 place count 185 transition count 267
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 171 place count 169 transition count 267
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 171 place count 169 transition count 258
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 189 place count 160 transition count 258
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 217 place count 132 transition count 214
Iterating global reduction 3 with 28 rules applied. Total rules applied 245 place count 132 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 250 place count 132 transition count 209
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 250 place count 132 transition count 204
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 260 place count 127 transition count 204
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 262 place count 125 transition count 196
Iterating global reduction 4 with 2 rules applied. Total rules applied 264 place count 125 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 266 place count 125 transition count 194
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 370 place count 73 transition count 142
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 373 place count 70 transition count 132
Iterating global reduction 5 with 3 rules applied. Total rules applied 376 place count 70 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 379 place count 70 transition count 129
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 381 place count 68 transition count 127
Applied a total of 381 rules in 37 ms. Remains 68 /277 variables (removed 209) and now considering 127/399 (removed 272) transitions.
[2025-06-07 18:10:32] [INFO ] Flow matrix only has 80 transitions (discarded 47 similar events)
// Phase 1: matrix 80 rows 68 cols
[2025-06-07 18:10:32] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-07 18:10:32] [INFO ] Flow matrix only has 80 transitions (discarded 47 similar events)
[2025-06-07 18:10:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:32] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:10:32] [INFO ] Redundant transitions in 0 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-07 18:10:32] [INFO ] Flow matrix only has 80 transitions (discarded 47 similar events)
[2025-06-07 18:10: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/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 5/68 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 79/147 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/148 variables, and 88 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1737 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 5/68 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 79/147 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 91/179 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:34] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:34] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/148 variables, and 181 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2526 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4277ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4277ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/277 places, 127/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4433 ms. Remains : 68/277 places, 127/399 transitions.
[2025-06-07 18:10:36] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:10:36] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:10:36] [INFO ] Input system was already deterministic with 127 transitions.
[2025-06-07 18:10:36] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:36] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:10:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10587446177556086836.gal : 1 ms
[2025-06-07 18:10:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6738158227173190287.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/CTLFireability10587446177556086836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6738158227173190287.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.3101e+10,0.020499,4544,2,121,5,1240,6,0,393,688,0


Converting to forward existential form...Done !
original formula: EF((((p190==1) * EG((p300==0))) * (AF(((p59==1)&&(p128==1))) + (AG((p318==0)) * (((p177==0)||(p208==0))||(p361==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((p190==1) * EG((p300==0)))) * !(EG(!(((p59==1)&&(p128==1))))))] != FALSE + [(((FwdU(Init,...270
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 114/0/13
Hit Full ! (commute/partial/dont) 125/0/2
(forward)formula 0,1,0.182889,11584,1,0,19,41419,29,10,2014,39672,15
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 235 transition count 341
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 235 transition count 341
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 91 place count 235 transition count 334
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 110 place count 216 transition count 313
Iterating global reduction 1 with 19 rules applied. Total rules applied 129 place count 216 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 216 transition count 312
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 143 place count 203 transition count 283
Iterating global reduction 2 with 13 rules applied. Total rules applied 156 place count 203 transition count 283
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 162 place count 203 transition count 277
Applied a total of 162 rules in 11 ms. Remains 203 /277 variables (removed 74) and now considering 277/399 (removed 122) transitions.
// Phase 1: matrix 277 rows 203 cols
[2025-06-07 18:10:36] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 18:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:10:36] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-07 18:10: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/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 277/480 variables, 203/223 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 0/480 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 223 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13623 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 277/480 variables, 203/223 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 276/499 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:56] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:57] [INFO ] Deduced a trap along path composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:10:59] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:02] [INFO ] Deduced a trap composed of 31 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:11:02] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:04] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:07] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:10] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:15] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:11:20] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 509 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 43665ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 43666ms
Starting structural reductions in LTL mode, iteration 1 : 203/277 places, 277/399 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43886 ms. Remains : 203/277 places, 277/399 transitions.
[2025-06-07 18:11:20] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:11:20] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:11:20] [INFO ] Input system was already deterministic with 277 transitions.
[2025-06-07 18:11:20] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:11:20] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:11:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7993230245217681914.gal : 1 ms
[2025-06-07 18:11:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13782934741722767711.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/CTLFireability7993230245217681914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13782934741722767711.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.85044e+19,0.108629,8224,2,1389,5,20531,6,0,1091,18144,0


Converting to forward existential form...Done !
original formula: AF(EG((AF(EX((p98==1))) + ((E((p57==1) U (p165==1)) * A((p376==1) U (p58==1))) * ((p67==1)||((p69==0)&&((p357==0)||(p369==0))))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EG(!(EX((p98==1))))) + ((E((p57==1) U (p165==1)) * !((E(!((p58==1)) U (!((p376==1)) * !((p58=...245
Reverse transition relation is NOT exact ! Due to transitions t5, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...375
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-07 18:11:50] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:11:50] [INFO ] Applying decomposition
[2025-06-07 18:11:50] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8861479508134341594.txt' '-o' '/tmp/graph8861479508134341594.bin' '-w' '/tmp/graph8861479508134341594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8861479508134341594.bin' '-l' '-1' '-v' '-w' '/tmp/graph8861479508134341594.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:11:50] [INFO ] Decomposing Gal with order
[2025-06-07 18:11:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:11:50] [INFO ] Removed a total of 197 redundant transitions.
[2025-06-07 18:11:50] [INFO ] Flatten gal took : 97 ms
[2025-06-07 18:11:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2025-06-07 18:11:50] [INFO ] Time to serialize gal into /tmp/CTLFireability8467289564966762174.gal : 4 ms
[2025-06-07 18:11:50] [INFO ] Time to serialize properties into /tmp/CTLFireability7423767762457734755.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/CTLFireability8467289564966762174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7423767762457734755.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.85044e+19,0.150624,11048,1867,18,14209,314,433,16505,54,545,0


Converting to forward existential form...Done !
original formula: AF(EG((AF(EX((i5.u13.p98==1))) + ((E((i3.u7.p57==1) U (i9.u26.p165==1)) * A((i19.u61.p376==1) U (i3.u7.p58==1))) * ((i4.u8.p67==1)||((i4....211
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EG(!(EX((i5.u13.p98==1))))) + ((E((i3.u7.p57==1) U (i9.u26.p165==1)) * !((E(!((i3.u7.p58==1))...319
Reverse transition relation is NOT exact ! Due to transitions t5, t25, t44, t73, t112, t165, i1.t201, i2.t192, i3.t182, i4.t170, i5.t160, i5.t156, i6.t148,...544
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 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 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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 233 transition count 339
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 233 transition count 339
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 95 place count 233 transition count 332
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 116 place count 212 transition count 305
Iterating global reduction 1 with 21 rules applied. Total rules applied 137 place count 212 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 140 place count 212 transition count 302
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 153 place count 199 transition count 275
Iterating global reduction 2 with 13 rules applied. Total rules applied 166 place count 199 transition count 275
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 171 place count 199 transition count 270
Applied a total of 171 rules in 6 ms. Remains 199 /277 variables (removed 78) and now considering 270/399 (removed 129) transitions.
// Phase 1: matrix 270 rows 199 cols
[2025-06-07 18:12:21] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:12:21] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-07 18:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:12:21] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-07 18:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 270/469 variables, 199/219 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 0/469 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 469/469 variables, and 219 constraints, problems are : Problem set: 0 solved, 269 unsolved in 12677 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (OVERLAPS) 270/469 variables, 199/219 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 269/488 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:39] [INFO ] Deduced a trap along path composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:42] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:42] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:45] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:45] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:47] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:48] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:48] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:49] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:12:53] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/469 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 469/469 variables, and 498 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42702ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 42702ms
Starting structural reductions in LTL mode, iteration 1 : 199/277 places, 270/399 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42902 ms. Remains : 199/277 places, 270/399 transitions.
[2025-06-07 18:13:03] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:13:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:13:03] [INFO ] Input system was already deterministic with 270 transitions.
[2025-06-07 18:13:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:13:04] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:13:04] [INFO ] Time to serialize gal into /tmp/CTLFireability15643683097540463364.gal : 1 ms
[2025-06-07 18:13:04] [INFO ] Time to serialize properties into /tmp/CTLFireability15395309723368145585.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/CTLFireability15643683097540463364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15395309723368145585.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18444e+19,0.096333,7644,2,1254,5,18272,6,0,1068,14584,0


Converting to forward existential form...Done !
original formula: EF((!(A((p298!=1) U (!(A(((p357==1)&&(p366==1)) U (p104==1))) + EX((p347==1))))) * (p38==0)))
=> equivalent forward existential formula: ([((((FwdU((FwdU(Init,TRUE) * (p38==0)),!((!(!((E(!((p104==1)) U (!(((p357==1)&&(p366==1))) * !((p104==1)))) + E...486
Reverse transition relation is NOT exact ! Due to transitions t5, t25, t26, t30, t33, t38, t42, t47, t48, t52, t58, t62, t67, t71, t76, t77, t81, t87, t91,...363
(forward)formula 0,1,9.95772,338996,1,0,1447,2.029e+06,575,709,6419,2.49782e+06,1641
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-11 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 : 277/277 places, 399/399 transitions.
Graph (trivial) has 253 edges and 277 vertex of which 34 / 277 are part of one of the 6 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 248 transition count 302
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 97 rules applied. Total rules applied 161 place count 185 transition count 268
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 179 place count 169 transition count 266
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 167 transition count 266
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 181 place count 167 transition count 257
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 199 place count 158 transition count 257
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 231 place count 126 transition count 209
Iterating global reduction 4 with 32 rules applied. Total rules applied 263 place count 126 transition count 209
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 269 place count 126 transition count 203
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 269 place count 126 transition count 196
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 283 place count 119 transition count 196
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 285 place count 117 transition count 188
Iterating global reduction 5 with 2 rules applied. Total rules applied 287 place count 117 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 289 place count 117 transition count 186
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 387 place count 68 transition count 137
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 391 place count 64 transition count 121
Iterating global reduction 6 with 4 rules applied. Total rules applied 395 place count 64 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 399 place count 64 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 401 place count 62 transition count 115
Applied a total of 401 rules in 24 ms. Remains 62 /277 variables (removed 215) and now considering 115/399 (removed 284) transitions.
[2025-06-07 18:13:14] [INFO ] Flow matrix only has 70 transitions (discarded 45 similar events)
// Phase 1: matrix 70 rows 62 cols
[2025-06-07 18:13:14] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:14] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 18:13:14] [INFO ] Flow matrix only has 70 transitions (discarded 45 similar events)
[2025-06-07 18:13:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:14] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:13:14] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2025-06-07 18:13:14] [INFO ] Flow matrix only has 70 transitions (discarded 45 similar events)
[2025-06-07 18:13:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 5/62 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:14] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 69/131 variables, 62/83 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/132 variables, and 83 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 5/62 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 69/131 variables, 62/83 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 74/157 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:16] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/132 variables, and 158 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1822 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3267ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3267ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/277 places, 115/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3394 ms. Remains : 62/277 places, 115/399 transitions.
[2025-06-07 18:13:17] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:13:17] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:13:17] [INFO ] Input system was already deterministic with 115 transitions.
[2025-06-07 18:13:17] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:13:17] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:13:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11260492990123784190.gal : 0 ms
[2025-06-07 18:13:17] [INFO ] Time to serialize properties into /tmp/CTLFireability893905348734991308.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/CTLFireability11260492990123784190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability893905348734991308.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.67332e+09,0.016133,4564,2,170,5,1797,6,0,359,1113,0


Converting to forward existential form...Done !
original formula: AF(AG(((((p97==0)||(p150==0))||((p338==0)||(p369==0)))||((p79==0)&&(p323==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((p97==0)||(p150==0))||((p338==0)||(p369==0)))||((p79==0)&&(p323==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...169
(forward)formula 0,0,0.124855,8660,1,0,244,26943,252,139,2311,27983,281
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-12 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 : 277/277 places, 399/399 transitions.
Graph (trivial) has 265 edges and 277 vertex of which 40 / 277 are part of one of the 7 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 243 transition count 298
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 96 rules applied. Total rules applied 159 place count 181 transition count 264
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 175 place count 165 transition count 264
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 175 place count 165 transition count 256
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 191 place count 157 transition count 256
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 222 place count 126 transition count 209
Iterating global reduction 3 with 31 rules applied. Total rules applied 253 place count 126 transition count 209
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 258 place count 126 transition count 204
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 258 place count 126 transition count 197
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 272 place count 119 transition count 197
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 274 place count 117 transition count 189
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 117 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 278 place count 117 transition count 187
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 380 place count 66 transition count 136
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 386 place count 60 transition count 113
Iterating global reduction 5 with 6 rules applied. Total rules applied 392 place count 60 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 398 place count 60 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 400 place count 58 transition count 105
Applied a total of 400 rules in 21 ms. Remains 58 /277 variables (removed 219) and now considering 105/399 (removed 294) transitions.
[2025-06-07 18:13:17] [INFO ] Flow matrix only has 56 transitions (discarded 49 similar events)
// Phase 1: matrix 56 rows 58 cols
[2025-06-07 18:13:17] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-07 18:13:17] [INFO ] Flow matrix only has 56 transitions (discarded 49 similar events)
[2025-06-07 18:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:17] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:13:17] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2025-06-07 18:13:17] [INFO ] Flow matrix only has 56 transitions (discarded 49 similar events)
[2025-06-07 18:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/58 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 55/113 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 78 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 3/58 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 55/113 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 63/141 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 141 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2259ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/277 places, 105/399 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2408 ms. Remains : 58/277 places, 105/399 transitions.
[2025-06-07 18:13:20] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:13:20] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:13:20] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-07 18:13:20] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:13:20] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:13:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4429857952281758519.gal : 0 ms
[2025-06-07 18:13:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12822133393806871169.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/CTLFireability4429857952281758519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12822133393806871169.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.14791e+09,0.018165,4392,2,97,5,996,6,0,332,545,0


Converting to forward existential form...Done !
original formula: EF(AG(((p201==1) + EG((p13==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p201==1) + EG((p13==0)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 103/0/2
(forward)formula 0,1,0.090569,7208,1,0,14,17061,24,8,1703,16610,12
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 232 transition count 338
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 232 transition count 338
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 97 place count 232 transition count 331
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 119 place count 210 transition count 303
Iterating global reduction 1 with 22 rules applied. Total rules applied 141 place count 210 transition count 303
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 144 place count 210 transition count 300
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 157 place count 197 transition count 274
Iterating global reduction 2 with 13 rules applied. Total rules applied 170 place count 197 transition count 274
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 175 place count 197 transition count 269
Applied a total of 175 rules in 14 ms. Remains 197 /277 variables (removed 80) and now considering 269/399 (removed 130) transitions.
// Phase 1: matrix 269 rows 197 cols
[2025-06-07 18:13:20] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:20] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-07 18:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:13:20] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-07 18:13:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/466 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 0/466 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 217 constraints, problems are : Problem set: 0 solved, 268 unsolved in 12389 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/466 variables, 197/217 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 268/485 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:37] [INFO ] Deduced a trap along path composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:41] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:41] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:41] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 3/489 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:44] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:44] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:46] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:46] [INFO ] Deduced a trap composed of 37 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:13:47] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:47] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:49] [INFO ] Deduced a trap composed of 31 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:13:49] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:50] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:13:50] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/466 variables, and 499 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42424ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 42424ms
Starting structural reductions in LTL mode, iteration 1 : 197/277 places, 269/399 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42612 ms. Remains : 197/277 places, 269/399 transitions.
[2025-06-07 18:14:02] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:14:02] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:14:02] [INFO ] Input system was already deterministic with 269 transitions.
[2025-06-07 18:14:02] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:14:02] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:14:02] [INFO ] Time to serialize gal into /tmp/CTLFireability12280994558791327346.gal : 1 ms
[2025-06-07 18:14:02] [INFO ] Time to serialize properties into /tmp/CTLFireability9365826169794845678.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/CTLFireability12280994558791327346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9365826169794845678.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.76434e+18,0.104175,7644,2,1219,5,18070,6,0,1059,14339,0


Converting to forward existential form...Done !
original formula: EF(((AX(((p357!=1)||(p366!=1))) * EG((p119!=1))) * EG((p188==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (!(EX(!(((p357!=1)||(p366!=1))))) * EG((p119!=1)))),(p188==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...363
Hit Full ! (commute/partial/dont) 264/0/5
(forward)formula 0,1,10.4121,343168,1,0,1416,1.98295e+06,570,686,6667,2.52433e+06,1613
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 399/399 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 239 transition count 349
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 239 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 81 place count 239 transition count 344
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 99 place count 221 transition count 325
Iterating global reduction 1 with 18 rules applied. Total rules applied 117 place count 221 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 221 transition count 323
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 128 place count 212 transition count 305
Iterating global reduction 2 with 9 rules applied. Total rules applied 137 place count 212 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 212 transition count 302
Applied a total of 140 rules in 6 ms. Remains 212 /277 variables (removed 65) and now considering 302/399 (removed 97) transitions.
// Phase 1: matrix 302 rows 212 cols
[2025-06-07 18:14:13] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:14:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-07 18:14:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:14:13] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2025-06-07 18:14: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/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 302/514 variables, 212/232 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 0/514 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 232 constraints, problems are : Problem set: 0 solved, 301 unsolved in 15882 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (OVERLAPS) 302/514 variables, 212/232 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 301/533 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:34] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:38] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:41] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:41] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:42] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:42] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:45] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:45] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:45] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 3/542 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:48] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:14:53] [INFO ] Deduced a trap composed of 53 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:14:53] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 545 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45913ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 45914ms
Starting structural reductions in LTL mode, iteration 1 : 212/277 places, 302/399 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46109 ms. Remains : 212/277 places, 302/399 transitions.
[2025-06-07 18:14:59] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:14:59] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:14:59] [INFO ] Input system was already deterministic with 302 transitions.
[2025-06-07 18:14:59] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:14:59] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:14:59] [INFO ] Time to serialize gal into /tmp/CTLFireability8468279053205706107.gal : 1 ms
[2025-06-07 18:14:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2004632789842349588.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/CTLFireability8468279053205706107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2004632789842349588.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,4.51989e+19,0.126797,8588,2,1439,5,22094,6,0,1152,18874,0


Converting to forward existential form...Done !
original formula: !(E(((((AF((p241==1)) * AX((p62==1))) + E(((p209==1)||(p123==1)) U (((p78==1)&&(p109==1))&&(p87==1)))) * (((A(((p21==1)&&(p128==1)) U (p3...313
=> equivalent forward existential formula: [(FwdU(Init,((((!(EG(!((p241==1)))) * !(EX(!((p62==1))))) + E(((p209==1)||(p123==1)) U (((p78==1)&&(p109==1))&&(...489
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t25, t29, t34, t38, t40, t46, t49, t56, t57, t61, t66, t70, t76, t80, t87, t88, t92,...381
Detected timeout of ITS tools.
[2025-06-07 18:15:29] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:15:29] [INFO ] Applying decomposition
[2025-06-07 18:15:29] [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/graph5056727684637119345.txt' '-o' '/tmp/graph5056727684637119345.bin' '-w' '/tmp/graph5056727684637119345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5056727684637119345.bin' '-l' '-1' '-v' '-w' '/tmp/graph5056727684637119345.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:15:29] [INFO ] Decomposing Gal with order
[2025-06-07 18:15:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:15:29] [INFO ] Removed a total of 222 redundant transitions.
[2025-06-07 18:15:29] [INFO ] Flatten gal took : 23 ms
[2025-06-07 18:15:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2025-06-07 18:15:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8253053489204346294.gal : 3 ms
[2025-06-07 18:15:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11255029852941639393.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/CTLFireability8253053489204346294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11255029852941639393.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,4.51989e+19,0.177816,11112,1807,27,13434,416,488,18507,77,995,0


Converting to forward existential form...Done !
original formula: !(E(((((AF((i13.u37.p241==1)) * AX((i4.u9.p62==1))) + E(((i11.u31.p209==1)||(i7.u20.p123==1)) U (((i4.u9.p78==1)&&(i6.u16.p109==1))&&(i0....455
=> equivalent forward existential formula: [(FwdU(Init,((((!(EG(!((i13.u37.p241==1)))) * !(EX(!((i4.u9.p62==1))))) + E(((i11.u31.p209==1)||(i7.u20.p123==1)...659
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t56, t87, t119, t163, i0.t168, i1.u3.t211, i2.t201, i3.t191, i4.t181, i6.t153, i6.u1...570
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
(forward)formula 0,1,23.7097,554776,1,0,923436,754,3102,1.77827e+06,409,1743,1348931
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 18:15:53] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:15:53] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:15:53] [INFO ] Applying decomposition
[2025-06-07 18:15:53] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5841477843032303821.txt' '-o' '/tmp/graph5841477843032303821.bin' '-w' '/tmp/graph5841477843032303821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5841477843032303821.bin' '-l' '-1' '-v' '-w' '/tmp/graph5841477843032303821.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:15:53] [INFO ] Decomposing Gal with order
[2025-06-07 18:15:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:15:53] [INFO ] Removed a total of 290 redundant transitions.
[2025-06-07 18:15:53] [INFO ] Flatten gal took : 31 ms
[2025-06-07 18:15:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 6 ms.
[2025-06-07 18:15:53] [INFO ] Time to serialize gal into /tmp/CTLFireability10316860935728077198.gal : 5 ms
[2025-06-07 18:15:53] [INFO ] Time to serialize properties into /tmp/CTLFireability14058266203378159544.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/CTLFireability10316860935728077198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14058266203378159544.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,9.95066e+21,0.239761,13792,2282,43,20436,648,701,28213,90,1594,0


Converting to forward existential form...Done !
original formula: AF(EG((AF(EX((i4.i0.u24.p98==1))) + ((E((i2.u13.p57==1) U (i9.u39.p165==1)) * A((i20.u86.p376==1) U (i2.u13.p58==1))) * ((i3.u15.p67==1)|...221
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EG(!(EX((i4.i0.u24.p98==1))))) + ((E((i2.u13.p57==1) U (i9.u39.p165==1)) * !((E(!((i2.u13.p58...331
Reverse transition relation is NOT exact ! Due to transitions t5, t29, t71, t107, i0.t271, i0.t267, i1.t258, i1.i1.t252, i2.t240, i2.u13.t244, i3.t226, i3....896
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 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 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
(forward)formula 0,0,948.183,3826892,1,0,5.46384e+06,921,1415,1.12074e+07,172,2726,5788950
FORMULA Champagne-PT-H06T0R-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1516869 ms.

BK_STOP 1749321103171

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

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