Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.0K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 13K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:35 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 71K 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-H04T2O-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H04T2O-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749317996964

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-H04T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 17:39:58] [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 17:39:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:39:58] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2025-06-07 17:39:58] [INFO ] Transformed 417 places.
[2025-06-07 17:39:58] [INFO ] Transformed 494 transitions.
[2025-06-07 17:39:58] [INFO ] Found NUPN structural information;
[2025-06-07 17:39:58] [INFO ] Parsed PT model containing 417 places and 494 transitions and 1106 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 106 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 494/494 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 364 transition count 441
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 364 transition count 441
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 136 place count 334 transition count 411
Iterating global reduction 0 with 30 rules applied. Total rules applied 166 place count 334 transition count 411
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 182 place count 318 transition count 395
Iterating global reduction 0 with 16 rules applied. Total rules applied 198 place count 318 transition count 395
Applied a total of 198 rules in 81 ms. Remains 318 /417 variables (removed 99) and now considering 395/494 (removed 99) transitions.
// Phase 1: matrix 395 rows 318 cols
[2025-06-07 17:39:58] [INFO ] Computed 11 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:58] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-07 17:39:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:39:59] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2025-06-07 17:39:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:05] [INFO ] Deduced a trap composed of 84 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 17:40:05] [INFO ] Deduced a trap composed of 57 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 17:40:05] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:06] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:06] [INFO ] Deduced a trap composed of 56 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 17:40:06] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:07] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:07] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:07] [INFO ] Deduced a trap composed of 62 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 17:40:07] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:07] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:08] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (OVERLAPS) 395/713 variables, 318/341 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 713/713 variables, and 341 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/318 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/318 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:31] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/318 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (OVERLAPS) 395/713 variables, 318/342 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 394/736 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:38] [INFO ] Deduced a trap composed of 57 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:38] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:42] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:47] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:47] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:40:48] [INFO ] Deduced a trap composed of 141 places in 77 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 3/742 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/713 variables, and 742 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 318/318 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 318/417 places, 395/494 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60746 ms. Remains : 318/417 places, 395/494 transitions.
Support contains 106 out of 318 places after structural reductions.
[2025-06-07 17:40:59] [INFO ] Flatten gal took : 45 ms
[2025-06-07 17:40:59] [INFO ] Flatten gal took : 19 ms
[2025-06-07 17:40:59] [INFO ] Input system was already deterministic with 395 transitions.
Support contains 105 out of 318 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (124 resets) in 1547 ms. (25 steps per ms) remains 4/80 properties
BEST_FIRST walk for 40004 steps (14 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (18 resets) in 198 ms. (201 steps per ms) remains 3/4 properties
[2025-06-07 17:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp57 is UNSAT
After SMT solving in domain Real declared 95/713 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 3/11 constraints, State Equation: 0/318 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2025-06-07 17:41:00] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:41:00] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:41:00] [INFO ] Input system was already deterministic with 395 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Graph (trivial) has 325 edges and 318 vertex of which 185 / 318 are part of one of the 12 SCC in 2 ms
Free SCC test removed 173 places
Ensure Unique test removed 191 transitions
Reduce isomorphic transitions removed 191 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 144 transition count 155
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 64 rules applied. Total rules applied 113 place count 96 transition count 139
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 124 place count 89 transition count 135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 128 place count 85 transition count 135
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 128 place count 85 transition count 131
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 136 place count 81 transition count 131
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 148 place count 69 transition count 119
Iterating global reduction 4 with 12 rules applied. Total rules applied 160 place count 69 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 161 place count 68 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 68 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 68 transition count 115
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 201 place count 49 transition count 96
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 205 place count 45 transition count 85
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 45 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 45 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 43 transition count 79
Applied a total of 215 rules in 37 ms. Remains 43 /318 variables (removed 275) and now considering 79/395 (removed 316) transitions.
[2025-06-07 17:41:00] [INFO ] Flow matrix only has 54 transitions (discarded 25 similar events)
// Phase 1: matrix 54 rows 43 cols
[2025-06-07 17:41:00] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-07 17:41:00] [INFO ] Flow matrix only has 54 transitions (discarded 25 similar events)
[2025-06-07 17:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:41:00] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-07 17:41:00] [INFO ] Flow matrix only has 54 transitions (discarded 25 similar events)
[2025-06-07 17:41:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 53/96 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/96 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 54 constraints, problems are : Problem set: 0 solved, 48 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 53/96 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 48/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 102 constraints, problems are : Problem set: 0 solved, 48 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1398ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1399ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/318 places, 79/395 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1522 ms. Remains : 43/318 places, 79/395 transitions.
[2025-06-07 17:41:01] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:41:01] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:41:01] [INFO ] Input system was already deterministic with 79 transitions.
[2025-06-07 17:41:01] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:41:01] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:41:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13169676630023648741.gal : 2 ms
[2025-06-07 17:41:01] [INFO ] Time to serialize properties into /tmp/CTLFireability7563437070389725013.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/CTLFireability13169676630023648741.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7563437070389725013.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.4175e+06,0.020869,4276,2,241,5,1537,6,0,242,991,0


Converting to forward existential form...Done !
original formula: EG(A(EF((p333==1)) U (((p149==1)&&(p162==1)) + (EF((p198==1)) * ((p127==1)||(p94==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((((p149==1)&&(p162==1)) + (E(TRUE U (p198==1)) * ((p127==1)||(p94==1))))) U (!(E(TRUE U (p333=...335
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.78721,32760,1,0,135,158497,28,89,1224,211423,93
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 285 transition count 362
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 285 transition count 362
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 84 place count 267 transition count 344
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 267 transition count 344
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 262 transition count 339
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 262 transition count 339
Applied a total of 112 rules in 22 ms. Remains 262 /318 variables (removed 56) and now considering 339/395 (removed 56) transitions.
// Phase 1: matrix 339 rows 262 cols
[2025-06-07 17:41:02] [INFO ] Computed 11 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-07 17:41:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:02] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2025-06-07 17:41:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 339/601 variables, 262/273 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (OVERLAPS) 0/601 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 273 constraints, problems are : Problem set: 0 solved, 338 unsolved in 21381 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (OVERLAPS) 339/601 variables, 262/273 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 338/611 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:33] [INFO ] Deduced a trap along path composed of 23 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:39] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:41:43] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 614 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51433ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 51434ms
Starting structural reductions in LTL mode, iteration 1 : 262/318 places, 339/395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51670 ms. Remains : 262/318 places, 339/395 transitions.
[2025-06-07 17:41:54] [INFO ] Flatten gal took : 13 ms
[2025-06-07 17:41:54] [INFO ] Flatten gal took : 12 ms
[2025-06-07 17:41:54] [INFO ] Input system was already deterministic with 339 transitions.
[2025-06-07 17:41:54] [INFO ] Flatten gal took : 11 ms
[2025-06-07 17:41:54] [INFO ] Flatten gal took : 11 ms
[2025-06-07 17:41:54] [INFO ] Time to serialize gal into /tmp/CTLFireability13486269411837643423.gal : 5 ms
[2025-06-07 17:41:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12178265303634578725.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/CTLFireability13486269411837643423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12178265303634578725.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,9.08947e+14,0.115133,7880,2,1326,5,16013,6,0,1389,14726,0


Converting to forward existential form...Done !
original formula: E((((AX(AF(((p263==1)&&(p287==1)))) + !(AG((p219==1)))) + (!((((p52==1)||(p11==1))||((p278==1)||(p325==1)))) + (EX((p169!=1)) * AG((p302=...271
=> equivalent forward existential formula: [(((FwdU(Init,(((!(EX(!(!(EG(!(((p263==1)&&(p287==1)))))))) + !(!(E(TRUE U !((p219==1)))))) + (!((((p52==1)||(p1...471
Reverse transition relation is NOT exact ! Due to transitions t5, t56, t61, t85, t95, t107, t112, t136, t138, t162, t178, t183, t188, t213, t240, t264, In...252
(forward)formula 0,0,1.29675,46856,1,0,410,206888,702,285,7632,172754,692
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 279 transition count 356
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 279 transition count 356
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 99 place count 258 transition count 335
Iterating global reduction 0 with 21 rules applied. Total rules applied 120 place count 258 transition count 335
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 126 place count 252 transition count 329
Iterating global reduction 0 with 6 rules applied. Total rules applied 132 place count 252 transition count 329
Applied a total of 132 rules in 16 ms. Remains 252 /318 variables (removed 66) and now considering 329/395 (removed 66) transitions.
// Phase 1: matrix 329 rows 252 cols
[2025-06-07 17:41:55] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-07 17:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:41:55] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-07 17:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 329/581 variables, 252/263 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 0/581 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 263 constraints, problems are : Problem set: 0 solved, 328 unsolved in 19781 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 329/581 variables, 252/263 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 328/591 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:42:24] [INFO ] Deduced a trap along path composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:42:28] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 593 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49831ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 49833ms
Starting structural reductions in LTL mode, iteration 1 : 252/318 places, 329/395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50027 ms. Remains : 252/318 places, 329/395 transitions.
[2025-06-07 17:42:45] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:42:45] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:42:45] [INFO ] Input system was already deterministic with 329 transitions.
[2025-06-07 17:42:45] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:42:45] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:42:45] [INFO ] Time to serialize gal into /tmp/CTLFireability560837980323463045.gal : 2 ms
[2025-06-07 17:42:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5795319554636676905.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/CTLFireability560837980323463045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5795319554636676905.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.88513e+14,0.092088,7056,2,1216,5,13112,6,0,1339,10362,0


Converting to forward existential form...Done !
original formula: AX((!(E(E(E(((p226==1)&&(p312==1)) U ((p149==1)&&(p162==1))) U ((p412==1)||((p302==1)&&(p350==1)))) U !(AF((p402==1))))) * EX(EF((p392==1...160
=> equivalent forward existential formula: ([FwdG(FwdU(EY(Init),E(E(((p226==1)&&(p312==1)) U ((p149==1)&&(p162==1))) U ((p412==1)||((p302==1)&&(p350==1))))...232
Reverse transition relation is NOT exact ! Due to transitions t3, t52, t57, t81, t101, t106, t131, t155, t180, t205, t230, t254, Intersection with reachab...229
Hit Full ! (commute/partial/dont) 326/0/3
(forward)formula 0,0,8.12637,273212,1,0,959,1.49681e+06,703,617,8183,1.97012e+06,1205
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Graph (trivial) has 325 edges and 318 vertex of which 173 / 318 are part of one of the 12 SCC in 1 ms
Free SCC test removed 161 places
Ensure Unique test removed 177 transitions
Reduce isomorphic transitions removed 177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 156 transition count 161
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 70 rules applied. Total rules applied 127 place count 100 transition count 147
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 11 rules applied. Total rules applied 138 place count 94 transition count 142
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 143 place count 89 transition count 142
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 143 place count 89 transition count 137
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 153 place count 84 transition count 137
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 166 place count 71 transition count 123
Iterating global reduction 4 with 13 rules applied. Total rules applied 179 place count 71 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 place count 71 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 181 place count 70 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 70 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 183 place count 70 transition count 118
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 223 place count 50 transition count 98
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 226 place count 47 transition count 89
Iterating global reduction 6 with 3 rules applied. Total rules applied 229 place count 47 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 232 place count 47 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 47 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 235 place count 45 transition count 83
Applied a total of 235 rules in 24 ms. Remains 45 /318 variables (removed 273) and now considering 83/395 (removed 312) transitions.
[2025-06-07 17:42:54] [INFO ] Flow matrix only has 61 transitions (discarded 22 similar events)
// Phase 1: matrix 61 rows 45 cols
[2025-06-07 17:42:54] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:54] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-07 17:42:54] [INFO ] Flow matrix only has 61 transitions (discarded 22 similar events)
[2025-06-07 17:42:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:42:54] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-07 17:42:54] [INFO ] Flow matrix only has 61 transitions (discarded 22 similar events)
[2025-06-07 17:42:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 3/45 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 60/105 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 56 constraints, problems are : Problem set: 0 solved, 51 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 3/45 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 60/105 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 51/107 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 107 constraints, problems are : Problem set: 0 solved, 51 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1686ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1686ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/318 places, 83/395 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1791 ms. Remains : 45/318 places, 83/395 transitions.
[2025-06-07 17:42:55] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:42:55] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:42:55] [INFO ] Input system was already deterministic with 83 transitions.
[2025-06-07 17:42:55] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:42:55] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:42:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13309245840601041828.gal : 1 ms
[2025-06-07 17:42:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6058077115033539800.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/CTLFireability13309245840601041828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6058077115033539800.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.7216e+06,0.015123,4240,2,234,5,1638,6,0,255,1082,0


Converting to forward existential form...Done !
original formula: E((p165==1) U A(!(AF((EG((p146==1)) * ((p405==1)||(p88==1))))) U EF(((p75==1)&&(p248==1)))))
=> equivalent forward existential formula: [((FwdU(Init,(p165==1)) * !(EG(!(E(TRUE U ((p75==1)&&(p248==1))))))) * !(E(!(E(TRUE U ((p75==1)&&(p248==1)))) U ...262
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 80/0/3
(forward)formula 0,1,0.622298,29112,1,0,153,143802,39,114,1312,174617,117
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 283 transition count 360
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 283 transition count 360
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 88 place count 265 transition count 342
Iterating global reduction 0 with 18 rules applied. Total rules applied 106 place count 265 transition count 342
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 260 transition count 337
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 260 transition count 337
Applied a total of 116 rules in 14 ms. Remains 260 /318 variables (removed 58) and now considering 337/395 (removed 58) transitions.
// Phase 1: matrix 337 rows 260 cols
[2025-06-07 17:42:56] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:56] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 17:42:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:42:56] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2025-06-07 17:42:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:01] [INFO ] Deduced a trap composed of 70 places in 39 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (OVERLAPS) 337/597 variables, 260/272 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (OVERLAPS) 0/597 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 272 constraints, problems are : Problem set: 0 solved, 336 unsolved in 24255 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/260 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (OVERLAPS) 337/597 variables, 260/272 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 336/608 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:28] [INFO ] Deduced a trap along path composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:43:44] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/597 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/597 variables, and 610 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54310ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 54311ms
Starting structural reductions in LTL mode, iteration 1 : 260/318 places, 337/395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54525 ms. Remains : 260/318 places, 337/395 transitions.
[2025-06-07 17:43:51] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:43:51] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:43:51] [INFO ] Input system was already deterministic with 337 transitions.
[2025-06-07 17:43:51] [INFO ] Flatten gal took : 21 ms
[2025-06-07 17:43:51] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:43:51] [INFO ] Time to serialize gal into /tmp/CTLFireability18106825244528435919.gal : 2 ms
[2025-06-07 17:43:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12294714855626149927.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/CTLFireability18106825244528435919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12294714855626149927.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,8.31744e+14,0.120671,7612,2,1365,5,15090,6,0,1379,12930,0


Converting to forward existential form...Done !
original formula: AG((A(AF((p237==1)) U AF(!(((p376==1)&&(p189==1))))) + (AG((p300==1)) * EF(((E((p124==1) U (p356==1)) * EX((p205==1))) * AF((p232==1)))))...157
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(!((E(!(!(EG(!(!(((p376==1)&&(p189==1))))))) U (!(!(EG(!((p237==1))))) * !(!(EG(!(!(...544
Reverse transition relation is NOT exact ! Due to transitions t5, t52, t56, t61, t85, t105, t110, t137, t155, t163, t183, t188, t213, t238, t262, Intersec...246
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,21.8821,663256,1,0,1874,4.07422e+06,725,1022,8368,4.5102e+06,2330
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 279 transition count 356
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 279 transition count 356
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 99 place count 258 transition count 335
Iterating global reduction 0 with 21 rules applied. Total rules applied 120 place count 258 transition count 335
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 126 place count 252 transition count 329
Iterating global reduction 0 with 6 rules applied. Total rules applied 132 place count 252 transition count 329
Applied a total of 132 rules in 10 ms. Remains 252 /318 variables (removed 66) and now considering 329/395 (removed 66) transitions.
// Phase 1: matrix 329 rows 252 cols
[2025-06-07 17:44:13] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:44:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-07 17:44:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:44:13] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2025-06-07 17:44: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/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 329/581 variables, 252/263 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 0/581 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 581/581 variables, and 263 constraints, problems are : Problem set: 0 solved, 328 unsolved in 19143 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (OVERLAPS) 329/581 variables, 252/263 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 328/591 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:40] [INFO ] Deduced a trap along path composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:44:44] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/581 variables, and 593 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49201ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 49202ms
Starting structural reductions in LTL mode, iteration 1 : 252/318 places, 329/395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49444 ms. Remains : 252/318 places, 329/395 transitions.
[2025-06-07 17:45:02] [INFO ] Flatten gal took : 9 ms
[2025-06-07 17:45:02] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:45:02] [INFO ] Input system was already deterministic with 329 transitions.
[2025-06-07 17:45:02] [INFO ] Flatten gal took : 22 ms
[2025-06-07 17:45:02] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:45:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3450433136440488036.gal : 1 ms
[2025-06-07 17:45:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8754660929209401455.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/CTLFireability3450433136440488036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8754660929209401455.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,5.88513e+14,0.102852,7060,2,1216,5,13112,6,0,1339,10362,0


Converting to forward existential form...Done !
original formula: AG(!(A((EX((p278==1)) + (p139!=1)) U (p355==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((p355==1))))) * !(E(!((p355==1)) U (!((EX((p278==1)) + (p139!=1))) * !((p355==1)))))...165
Reverse transition relation is NOT exact ! Due to transitions t3, t52, t57, t81, t101, t106, t131, t155, t180, t205, t230, t254, Intersection with reachab...229
(forward)formula 0,0,19.4766,596176,1,0,1701,3.36072e+06,683,1007,7388,4.36008e+06,2192
FORMULA Champagne-PT-H04T2O-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 : 318/318 places, 395/395 transitions.
Graph (trivial) has 336 edges and 318 vertex of which 201 / 318 are part of one of the 12 SCC in 2 ms
Free SCC test removed 189 places
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 128 transition count 136
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 64 rules applied. Total rules applied 113 place count 80 transition count 120
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 120 place count 73 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 120 place count 73 transition count 119
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 72 transition count 119
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 134 place count 60 transition count 107
Iterating global reduction 3 with 12 rules applied. Total rules applied 146 place count 60 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 59 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 59 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 59 transition count 103
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 185 place count 41 transition count 85
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 191 place count 35 transition count 66
Iterating global reduction 4 with 6 rules applied. Total rules applied 197 place count 35 transition count 66
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 203 place count 35 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 205 place count 33 transition count 58
Applied a total of 205 rules in 31 ms. Remains 33 /318 variables (removed 285) and now considering 58/395 (removed 337) transitions.
[2025-06-07 17:45:22] [INFO ] Flow matrix only has 32 transitions (discarded 26 similar events)
// Phase 1: matrix 32 rows 33 cols
[2025-06-07 17:45:22] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-07 17:45:22] [INFO ] Flow matrix only has 32 transitions (discarded 26 similar events)
[2025-06-07 17:45:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:45:22] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2025-06-07 17:45:22] [INFO ] Flow matrix only has 32 transitions (discarded 26 similar events)
[2025-06-07 17:45: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/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 3/33 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 31/64 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/64 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/65 variables, and 44 constraints, problems are : Problem set: 0 solved, 29 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 3/33 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 31/64 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/64 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/65 variables, and 73 constraints, problems are : Problem set: 0 solved, 29 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 766ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 767ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/318 places, 58/395 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 869 ms. Remains : 33/318 places, 58/395 transitions.
[2025-06-07 17:45:23] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:45:23] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:45:23] [INFO ] Input system was already deterministic with 58 transitions.
[2025-06-07 17:45:23] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:45:23] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:45:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4693473452411325836.gal : 1 ms
[2025-06-07 17:45:23] [INFO ] Time to serialize properties into /tmp/CTLFireability1600308434355016430.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/CTLFireability4693473452411325836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1600308434355016430.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,139968,0.015916,4188,2,56,5,488,6,0,180,288,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(((p141==1)&&(p77==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(((p141==1)&&(p77==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.024558,4316,1,0,8,2177,22,4,854,1251,10
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 282 transition count 359
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 282 transition count 359
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 91 place count 263 transition count 340
Iterating global reduction 0 with 19 rules applied. Total rules applied 110 place count 263 transition count 340
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 114 place count 259 transition count 336
Iterating global reduction 0 with 4 rules applied. Total rules applied 118 place count 259 transition count 336
Applied a total of 118 rules in 10 ms. Remains 259 /318 variables (removed 59) and now considering 336/395 (removed 59) transitions.
// Phase 1: matrix 336 rows 259 cols
[2025-06-07 17:45:23] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:23] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-07 17:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:45:23] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2025-06-07 17:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (OVERLAPS) 336/595 variables, 259/270 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 0/595 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 270 constraints, problems are : Problem set: 0 solved, 335 unsolved in 20289 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/259 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (OVERLAPS) 336/595 variables, 259/270 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 335/605 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:45:52] [INFO ] Deduced a trap along path composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 0/595 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 606 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 50322ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 50322ms
Starting structural reductions in LTL mode, iteration 1 : 259/318 places, 336/395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50564 ms. Remains : 259/318 places, 336/395 transitions.
[2025-06-07 17:46:13] [INFO ] Flatten gal took : 21 ms
[2025-06-07 17:46:13] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:46:13] [INFO ] Input system was already deterministic with 336 transitions.
[2025-06-07 17:46:13] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:46:13] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:46:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7450845745528995139.gal : 2 ms
[2025-06-07 17:46:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1031213182905017014.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/CTLFireability7450845745528995139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1031213182905017014.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,7.95794e+14,0.096969,7224,2,1247,5,13944,6,0,1374,11157,0


Converting to forward existential form...Done !
original formula: E(E(!(EG(((AX((p23==1)) + (p152==1)) + (p175==1)))) U ((p26==1) * ((p249!=1) + !(EF((p144==1)))))) U AF(((!(AF(!(((p263==1)&&(p324==1))))...223
=> equivalent forward existential formula: [(FwdU(Init,E(!(EG(((!(EX(!((p23==1)))) + (p152==1)) + (p175==1)))) U ((p26==1) * ((p249!=1) + !(E(TRUE U (p144=...311
Reverse transition relation is NOT exact ! Due to transitions t5, t55, t60, t84, t104, t109, t136, t160, t185, t212, t237, t261, Intersection with reachab...229
(forward)formula 0,0,10.81,345360,1,0,1044,2.0903e+06,710,610,7944,2.31992e+06,1439
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 287 transition count 364
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 287 transition count 364
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 79 place count 270 transition count 347
Iterating global reduction 0 with 17 rules applied. Total rules applied 96 place count 270 transition count 347
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 265 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 265 transition count 342
Applied a total of 106 rules in 21 ms. Remains 265 /318 variables (removed 53) and now considering 342/395 (removed 53) transitions.
// Phase 1: matrix 342 rows 265 cols
[2025-06-07 17:46:24] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:24] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-07 17:46:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:46:24] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2025-06-07 17:46:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:29] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:29] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:29] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:30] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:30] [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 17:46:30] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 342/607 variables, 265/282 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 0/607 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 341 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 282 constraints, problems are : Problem set: 0 solved, 341 unsolved in 24748 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 342/607 variables, 265/282 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 341/623 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:54] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:55] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:46:59] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:03] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 607/607 variables, and 627 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54785ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 54786ms
Starting structural reductions in LTL mode, iteration 1 : 265/318 places, 342/395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55014 ms. Remains : 265/318 places, 342/395 transitions.
[2025-06-07 17:47:19] [INFO ] Flatten gal took : 7 ms
[2025-06-07 17:47:19] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:47:19] [INFO ] Input system was already deterministic with 342 transitions.
[2025-06-07 17:47:19] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:47:19] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:47:19] [INFO ] Time to serialize gal into /tmp/CTLFireability7774756485587946358.gal : 1 ms
[2025-06-07 17:47:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16496813365122197408.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/CTLFireability7774756485587946358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16496813365122197408.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.03055e+15,0.193982,10596,2,2325,5,30151,6,0,1404,31013,0


Converting to forward existential form...Done !
original formula: A((((EF(AX(AX((p36==1)))) + AX(EF((p224==1)))) + ((p26==1)||(p240!=1))) + (AG((p337==1)) * (p344==1))) U EF(((!((AG((p402==1)) * EG((p331...273
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((!((!(E(TRUE U !((p402==1)))) * EG((p331==1)))) * !(!(EX(!((((p189==1)&&(p275==1))||(...762
Reverse transition relation is NOT exact ! Due to transitions t3, t52, t53, t58, t66, t83, t103, t108, t124, t129, t134, t160, t180, t186, t208, t214, t234...269
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,25.9872,624296,1,0,925,3.47245e+06,729,611,8494,4.33483e+06,1258
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Graph (trivial) has 315 edges and 318 vertex of which 177 / 318 are part of one of the 12 SCC in 2 ms
Free SCC test removed 165 places
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 153 transition count 165
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 59 rules applied. Total rules applied 108 place count 105 transition count 154
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 100 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 119 place count 97 transition count 151
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 119 place count 97 transition count 147
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 127 place count 93 transition count 147
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 137 place count 83 transition count 137
Iterating global reduction 4 with 10 rules applied. Total rules applied 147 place count 83 transition count 137
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 187 place count 63 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 192 place count 58 transition count 102
Iterating global reduction 4 with 5 rules applied. Total rules applied 197 place count 58 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 202 place count 58 transition count 97
Applied a total of 202 rules in 25 ms. Remains 58 /318 variables (removed 260) and now considering 97/395 (removed 298) transitions.
[2025-06-07 17:47:45] [INFO ] Flow matrix only has 78 transitions (discarded 19 similar events)
// Phase 1: matrix 78 rows 58 cols
[2025-06-07 17:47:45] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:45] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 17:47:45] [INFO ] Flow matrix only has 78 transitions (discarded 19 similar events)
[2025-06-07 17:47:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-07 17:47:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:47:45] [INFO ] Redundant transitions in 2 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 17:47:45] [INFO ] Flow matrix only has 78 transitions (discarded 19 similar events)
[2025-06-07 17:47:45] [INFO ] Invariant cache hit.
[2025-06-07 17:47:45] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:47] [INFO ] Deduced a trap along path composed of 2 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 80 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 58/58 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 77/135 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 9/78 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 96/174 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 176 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3464 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 58/58 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6501ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 6502ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/318 places, 97/395 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6626 ms. Remains : 58/318 places, 97/395 transitions.
[2025-06-07 17:47:52] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:47:52] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:47:52] [INFO ] Input system was already deterministic with 97 transitions.
[2025-06-07 17:47:52] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:47:52] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:47:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9321120881211974457.gal : 5 ms
[2025-06-07 17:47:52] [INFO ] Time to serialize properties into /tmp/CTLFireability660046205637027106.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/CTLFireability9321120881211974457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability660046205637027106.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.07455e+07,0.021357,4328,2,171,5,1745,6,0,319,1234,0


Converting to forward existential form...Done !
original formula: AG((A((p286==1) U (((p128==1) + EF((p177==1))) + A((p1==1) U ((p280==1)||((p189==1)&&(p275==1)))))) + A((p299==1) U ((EG((p182==1)) * (p2...203
=> equivalent forward existential formula: ([((((FwdU((FwdU(Init,TRUE) * !(!((E(!(((EG((p182==1)) * (p20!=1)) * ((p108!=1)&&((p169==1)||(p219==1))))) U (!(...1204
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 85/12/12
Hit Full ! (commute/partial/dont) 85/12/12
(forward)formula 0,0,0.221791,13544,1,0,103,56339,50,74,1679,63406,82
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 285 transition count 362
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 285 transition count 362
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 81 place count 270 transition count 347
Iterating global reduction 0 with 15 rules applied. Total rules applied 96 place count 270 transition count 347
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 267 transition count 344
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 267 transition count 344
Applied a total of 102 rules in 8 ms. Remains 267 /318 variables (removed 51) and now considering 344/395 (removed 51) transitions.
// Phase 1: matrix 344 rows 267 cols
[2025-06-07 17:47:52] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:52] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-07 17:47:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:47:52] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2025-06-07 17:47:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:47:57] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 344/611 variables, 267/279 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (OVERLAPS) 0/611 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 343 unsolved
No progress, stopping.
After SMT solving in domain Real declared 611/611 variables, and 279 constraints, problems are : Problem set: 0 solved, 343 unsolved in 24576 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 344/611 variables, 267/279 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 343/622 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:25] [INFO ] Deduced a trap along path composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/611 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:31] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:31] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:48:32] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/611 variables, 3/626 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 611/611 variables, and 626 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54616ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 54616ms
Starting structural reductions in LTL mode, iteration 1 : 267/318 places, 344/395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54821 ms. Remains : 267/318 places, 344/395 transitions.
[2025-06-07 17:48:47] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:48:47] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:48:47] [INFO ] Input system was already deterministic with 344 transitions.
[2025-06-07 17:48:47] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:48:47] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:48:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1423125264165933655.gal : 1 ms
[2025-06-07 17:48:47] [INFO ] Time to serialize properties into /tmp/CTLFireability813279276681557588.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/CTLFireability1423125264165933655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability813279276681557588.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.10839e+15,0.157038,8080,2,1382,5,16983,6,0,1414,16075,0


Converting to forward existential form...Done !
original formula: AF((AX(((((p340==1)||(p281==1))&&(p12==0))&&((p137==0)&&(p169==0)))) + ((EF((p356==0)) * AF((((p112==0)||(p174==0))||(p23==0)))) * ((AX((...245
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(((((p340==1)||(p281==1))&&(p12==0))&&((p137==0)&&(p169==0)))))) + ((E(TRUE U (p356==0)) * !...314
Reverse transition relation is NOT exact ! Due to transitions t6, t53, t57, t64, t90, t108, t112, t117, t143, t167, t183, t188, t193, t220, t245, t269, In...252
(forward)formula 0,0,16.37,518856,1,0,898,2.05967e+06,727,613,8198,4.24034e+06,1066
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-10 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 : 318/318 places, 395/395 transitions.
Graph (trivial) has 323 edges and 318 vertex of which 177 / 318 are part of one of the 14 SCC in 0 ms
Free SCC test removed 163 places
Ensure Unique test removed 177 transitions
Reduce isomorphic transitions removed 177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 154 transition count 163
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 68 rules applied. Total rules applied 123 place count 100 transition count 149
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 131 place count 94 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 92 transition count 147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 133 place count 92 transition count 144
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 139 place count 89 transition count 144
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 154 place count 74 transition count 128
Iterating global reduction 4 with 15 rules applied. Total rules applied 169 place count 74 transition count 128
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 73 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 73 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 73 transition count 124
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 210 place count 54 transition count 105
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 214 place count 50 transition count 92
Iterating global reduction 5 with 4 rules applied. Total rules applied 218 place count 50 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 222 place count 50 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 48 transition count 86
Applied a total of 224 rules in 15 ms. Remains 48 /318 variables (removed 270) and now considering 86/395 (removed 309) transitions.
[2025-06-07 17:49:04] [INFO ] Flow matrix only has 61 transitions (discarded 25 similar events)
// Phase 1: matrix 61 rows 48 cols
[2025-06-07 17:49:04] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-07 17:49:04] [INFO ] Flow matrix only has 61 transitions (discarded 25 similar events)
[2025-06-07 17:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:04] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:49:04] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-07 17:49:04] [INFO ] Flow matrix only has 61 transitions (discarded 25 similar events)
[2025-06-07 17:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 3/48 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 60/108 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 59 constraints, problems are : Problem set: 0 solved, 54 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 3/48 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 60/108 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 54/113 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 113 constraints, problems are : Problem set: 0 solved, 54 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1676ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1676ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/318 places, 86/395 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1780 ms. Remains : 48/318 places, 86/395 transitions.
[2025-06-07 17:49:05] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:05] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:05] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-07 17:49:05] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:05] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:49:05] [INFO ] Time to serialize gal into /tmp/CTLFireability312020262017406793.gal : 0 ms
[2025-06-07 17:49:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10188643807369756201.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/CTLFireability312020262017406793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10188643807369756201.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.26592e+06,0.017122,4240,2,208,5,1366,6,0,268,886,0


Converting to forward existential form...Done !
original formula: (EF((p261==1)) * A(EG(E(E((p354==1) U ((p75==1)&&(p236==1))) U !(A((p54==1) U (p136==1))))) U ((p30!=1)||(p366==1))))
=> equivalent forward existential formula: [(((Init * E(TRUE U (p261==1))) * !(EG(!(((p30!=1)||(p366==1)))))) * !(E(!(((p30!=1)||(p366==1))) U (!(EG(E(E((p...307
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 84/0/2
Hit Full ! (commute/partial/dont) 84/0/2
Hit Full ! (commute/partial/dont) 84/0/2
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 82/4/4
(forward)formula 0,1,0.429623,24164,1,0,96,112609,54,66,1530,132976,78
FORMULA Champagne-PT-H04T2O-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 : 318/318 places, 395/395 transitions.
Graph (trivial) has 338 edges and 318 vertex of which 195 / 318 are part of one of the 11 SCC in 1 ms
Free SCC test removed 184 places
Ensure Unique test removed 206 transitions
Reduce isomorphic transitions removed 206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 133 transition count 137
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 67 rules applied. Total rules applied 119 place count 82 transition count 121
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 126 place count 75 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 126 place count 75 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 73 transition count 119
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 143 place count 60 transition count 106
Iterating global reduction 3 with 13 rules applied. Total rules applied 156 place count 60 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 59 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 59 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 59 transition count 102
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 197 place count 40 transition count 83
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 202 place count 35 transition count 67
Iterating global reduction 4 with 5 rules applied. Total rules applied 207 place count 35 transition count 67
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 212 place count 35 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 33 transition count 60
Applied a total of 214 rules in 18 ms. Remains 33 /318 variables (removed 285) and now considering 60/395 (removed 335) transitions.
[2025-06-07 17:49:06] [INFO ] Flow matrix only has 33 transitions (discarded 27 similar events)
// Phase 1: matrix 33 rows 33 cols
[2025-06-07 17:49:06] [INFO ] Computed 11 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-07 17:49:06] [INFO ] Flow matrix only has 33 transitions (discarded 27 similar events)
[2025-06-07 17:49:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:06] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:49:06] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2025-06-07 17:49:06] [INFO ] Flow matrix only has 33 transitions (discarded 27 similar events)
[2025-06-07 17:49: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/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 44 constraints, problems are : Problem set: 0 solved, 30 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 30/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 74 constraints, problems are : Problem set: 0 solved, 30 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 794ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 796ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/318 places, 60/395 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 905 ms. Remains : 33/318 places, 60/395 transitions.
[2025-06-07 17:49:07] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:49:07] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:49:07] [INFO ] Input system was already deterministic with 60 transitions.
RANDOM walk for 121 steps (5 resets) in 6 ms. (17 steps per ms) remains 0/1 properties
[2025-06-07 17:49:07] [INFO ] Flatten gal took : 1 ms
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 17:49:07] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:49:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7615634769403140644.gal : 0 ms
[2025-06-07 17:49:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12907410623564642616.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/ReachabilityCardinality7615634769403140644.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12907410623564642616.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 : 318/318 places, 395/395 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 280 transition count 357
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 280 transition count 357
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 97 place count 259 transition count 336
Iterating global reduction 0 with 21 rules applied. Total rules applied 118 place count 259 transition count 336
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 253 transition count 330
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 253 transition count 330
Applied a total of 130 rules in 9 ms. Remains 253 /318 variables (removed 65) and now considering 330/395 (removed 65) transitions.
// Phase 1: matrix 330 rows 253 cols
[2025-06-07 17:49:07] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:07] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-07 17:49:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:49:07] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2025-06-07 17:49:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:11] [INFO ] Deduced a trap composed of 48 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 17:49:11] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:12] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:12] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:12] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/583 variables, 253/269 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (OVERLAPS) 0/583 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 269 constraints, problems are : Problem set: 0 solved, 329 unsolved in 22566 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 330/583 variables, 253/269 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 329/598 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:37] [INFO ] Deduced a trap along path composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:41] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:48] [INFO ] Deduced a trap along path composed of 22 places in 33 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:49:48] [INFO ] Deduced a trap along path composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/583 variables, and 602 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 52600ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 52602ms
Starting structural reductions in LTL mode, iteration 1 : 253/318 places, 330/395 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52974 ms. Remains : 253/318 places, 330/395 transitions.
[2025-06-07 17:50:00] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:50:00] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:50:00] [INFO ] Input system was already deterministic with 330 transitions.
[2025-06-07 17:50:00] [INFO ] Flatten gal took : 5 ms
[2025-06-07 17:50:00] [INFO ] Flatten gal took : 6 ms
[2025-06-07 17:50:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3979839760433804081.gal : 1 ms
[2025-06-07 17:50:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10465687684838210424.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/CTLFireability3979839760433804081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10465687684838210424.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.15072e+14,0.129582,8476,2,1591,5,20864,6,0,1344,17688,0


Converting to forward existential form...Done !
original formula: AG((EX(!(A((p179==1) U (p135==1)))) + (p381==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p381==0))) * !(EX(!(!((E(!((p135==1)) U (!((p179==1)) * !((p135==1)))) + EG(!((p135==1))...171
Reverse transition relation is NOT exact ! Due to transitions t3, t28, t53, t58, t82, t102, t107, t127, t132, t156, t181, t206, t226, t231, t255, Intersec...246
(forward)formula 0,1,12.8683,412820,1,0,955,2.40279e+06,689,565,7420,2.95017e+06,1284
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Graph (trivial) has 331 edges and 318 vertex of which 193 / 318 are part of one of the 12 SCC in 2 ms
Free SCC test removed 181 places
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 136 transition count 145
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 64 rules applied. Total rules applied 115 place count 86 transition count 131
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 122 place count 80 transition count 130
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 125 place count 79 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 78 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 126 place count 78 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 77 transition count 127
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 141 place count 64 transition count 114
Iterating global reduction 5 with 13 rules applied. Total rules applied 154 place count 64 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 63 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 63 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 63 transition count 110
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 193 place count 45 transition count 92
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 199 place count 39 transition count 73
Iterating global reduction 6 with 6 rules applied. Total rules applied 205 place count 39 transition count 73
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 211 place count 39 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 213 place count 37 transition count 65
Applied a total of 213 rules in 19 ms. Remains 37 /318 variables (removed 281) and now considering 65/395 (removed 330) transitions.
[2025-06-07 17:50:13] [INFO ] Flow matrix only has 42 transitions (discarded 23 similar events)
// Phase 1: matrix 42 rows 37 cols
[2025-06-07 17:50:13] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:13] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-07 17:50:13] [INFO ] Flow matrix only has 42 transitions (discarded 23 similar events)
[2025-06-07 17:50:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:50:13] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2025-06-07 17:50:13] [INFO ] Flow matrix only has 42 transitions (discarded 23 similar events)
[2025-06-07 17:50: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/35 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 41/78 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/79 variables, and 48 constraints, problems are : Problem set: 0 solved, 33 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 41/78 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 33/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/79 variables, and 81 constraints, problems are : Problem set: 0 solved, 33 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 968ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 969ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/318 places, 65/395 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1128 ms. Remains : 37/318 places, 65/395 transitions.
[2025-06-07 17:50:14] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:14] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:14] [INFO ] Input system was already deterministic with 65 transitions.
[2025-06-07 17:50:14] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:14] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:50:14] [INFO ] Time to serialize gal into /tmp/CTLFireability18017436084878336006.gal : 0 ms
[2025-06-07 17:50:14] [INFO ] Time to serialize properties into /tmp/CTLFireability18408979681862117073.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/CTLFireability18017436084878336006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18408979681862117073.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,466560,0.018968,4120,2,64,5,558,6,0,204,337,0


Converting to forward existential form...Done !
original formula: AF(AG((!(A((p83==1) U (p376==1))) * ((p66==0)||(p142==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(!((E(!((p376==1)) U (!((p83==1)) * !((p376==1)))) + EG(!((p376==1)))))) * ((p66==0)...182
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 63/0/2
Hit Full ! (commute/partial/dont) 63/0/2
(forward)formula 0,0,0.086377,6424,1,0,41,12164,33,40,982,17883,50
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 318/318 places, 395/395 transitions.
Graph (trivial) has 336 edges and 318 vertex of which 203 / 318 are part of one of the 11 SCC in 0 ms
Free SCC test removed 192 places
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 125 transition count 134
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 59 rules applied. Total rules applied 105 place count 80 transition count 120
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 112 place count 74 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 73 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 113 place count 73 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 72 transition count 118
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 128 place count 59 transition count 105
Iterating global reduction 4 with 13 rules applied. Total rules applied 141 place count 59 transition count 105
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 58 transition count 102
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 58 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 58 transition count 101
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 180 place count 40 transition count 83
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 186 place count 34 transition count 64
Iterating global reduction 5 with 6 rules applied. Total rules applied 192 place count 34 transition count 64
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 198 place count 34 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 200 place count 32 transition count 56
Applied a total of 200 rules in 11 ms. Remains 32 /318 variables (removed 286) and now considering 56/395 (removed 339) transitions.
[2025-06-07 17:50:14] [INFO ] Flow matrix only has 34 transitions (discarded 22 similar events)
// Phase 1: matrix 34 rows 32 cols
[2025-06-07 17:50:14] [INFO ] Computed 11 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:14] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-07 17:50:14] [INFO ] Flow matrix only has 34 transitions (discarded 22 similar events)
[2025-06-07 17:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:50:14] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:50:14] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-07 17:50:14] [INFO ] Flow matrix only has 34 transitions (discarded 22 similar events)
[2025-06-07 17:50: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/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 33/65 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 43 constraints, problems are : Problem set: 0 solved, 27 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 33/65 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 27/70 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 70 constraints, problems are : Problem set: 0 solved, 27 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 753ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 753ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/318 places, 56/395 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 958 ms. Remains : 32/318 places, 56/395 transitions.
[2025-06-07 17:50:15] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:15] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:15] [INFO ] Input system was already deterministic with 56 transitions.
[2025-06-07 17:50:15] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:15] [INFO ] Flatten gal took : 1 ms
[2025-06-07 17:50:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13512696574889840684.gal : 0 ms
[2025-06-07 17:50:15] [INFO ] Time to serialize properties into /tmp/CTLFireability7681771255220651291.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/CTLFireability13512696574889840684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7681771255220651291.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,87480,0.00715,4180,2,54,5,500,6,0,176,321,0


Converting to forward existential form...Done !
original formula: AG(!(E((p72==1) U EG((p74==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,TRUE),(p72==1)),(p74==1))] = FALSE
Hit Full ! (commute/partial/dont) 54/0/2
Hit Full ! (commute/partial/dont) 51/0/5
(forward)formula 0,0,0.015694,4308,1,0,9,2140,26,2,892,1330,11
FORMULA Champagne-PT-H04T2O-CTLFireability-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-07 17:50:15] [INFO ] Flatten gal took : 8 ms
[2025-06-07 17:50:15] [INFO ] Flatten gal took : 8 ms
Total runtime 617387 ms.

BK_STOP 1749318615668

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

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