Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.3K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K 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:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 11:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 11:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 6 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:36 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 101K 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-H05T2O-CTLCardinality-2025-00
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-01
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-02
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-03
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-04
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-05
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-06
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-07
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-08
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-09
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-10
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-11
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-12
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-13
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-14
FORMULA_NAME Champagne-PT-H05T2O-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749318903703

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H05T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-07 17:55:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:55:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:55:05] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-07 17:55:05] [INFO ] Transformed 569 places.
[2025-06-07 17:55:05] [INFO ] Transformed 686 transitions.
[2025-06-07 17:55:05] [INFO ] Found NUPN structural information;
[2025-06-07 17:55:05] [INFO ] Parsed PT model containing 569 places and 686 transitions and 1566 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 85 out of 569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 686/686 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 483 transition count 600
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 483 transition count 600
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 210 place count 445 transition count 562
Iterating global reduction 0 with 38 rules applied. Total rules applied 248 place count 445 transition count 562
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 267 place count 426 transition count 543
Iterating global reduction 0 with 19 rules applied. Total rules applied 286 place count 426 transition count 543
Applied a total of 286 rules in 115 ms. Remains 426 /569 variables (removed 143) and now considering 543/686 (removed 143) transitions.
// Phase 1: matrix 543 rows 426 cols
[2025-06-07 17:55:05] [INFO ] Computed 15 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:55:05] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-07 17:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:55:05] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2025-06-07 17:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/426 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:16] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:16] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:17] [INFO ] Deduced a trap composed of 114 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:17] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:18] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:18] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:18] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:19] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:19] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:19] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:19] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (OVERLAPS) 543/969 variables, 426/452 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 969/969 variables, and 452 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/426 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (OVERLAPS) 543/969 variables, 426/452 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/969 variables, 542/994 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:48] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:53] [INFO ] Deduced a trap composed of 133 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:55:53] [INFO ] Deduced a trap composed of 138 places in 86 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/969 variables, 3/997 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:01] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:03] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 969/969 variables, and 999 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 426/569 places, 543/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60870 ms. Remains : 426/569 places, 543/686 transitions.
Support contains 85 out of 426 places after structural reductions.
[2025-06-07 17:56:06] [INFO ] Flatten gal took : 54 ms
[2025-06-07 17:56:06] [INFO ] Flatten gal took : 24 ms
[2025-06-07 17:56:06] [INFO ] Input system was already deterministic with 543 transitions.
Support contains 68 out of 426 places (down from 85) after GAL structural reductions.
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (107 resets) in 1874 ms. (21 steps per ms) remains 2/41 properties
BEST_FIRST walk for 40003 steps (12 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
[2025-06-07 17:56:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 141/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 280/426 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 543/969 variables, 426/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/969 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/969 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 969/969 variables, and 441 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 141/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:07] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 280/426 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 543/969 variables, 426/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/969 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/969 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 969/969 variables, and 444 constraints, problems are : Problem set: 0 solved, 2 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 543/543 transitions.
Graph (trivial) has 444 edges and 426 vertex of which 253 / 426 are part of one of the 15 SCC in 3 ms
Free SCC test removed 238 places
Drop transitions (Empty/Sink Transition effects.) removed 278 transitions
Reduce isomorphic transitions removed 278 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 188 transition count 199
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 90 rules applied. Total rules applied 157 place count 122 transition count 175
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 171 place count 111 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 174 place count 108 transition count 172
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 174 place count 108 transition count 169
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 180 place count 105 transition count 169
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 195 place count 90 transition count 154
Iterating global reduction 4 with 15 rules applied. Total rules applied 210 place count 90 transition count 154
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 214 place count 86 transition count 142
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 86 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 222 place count 86 transition count 138
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 280 place count 57 transition count 109
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 284 place count 53 transition count 94
Iterating global reduction 5 with 4 rules applied. Total rules applied 288 place count 53 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 292 place count 53 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 296 place count 51 transition count 96
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 300 place count 51 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 304 place count 51 transition count 88
Free-agglomeration rule applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 328 place count 51 transition count 64
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 7 with 58 rules applied. Total rules applied 386 place count 27 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 387 place count 27 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 388 place count 27 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 389 place count 26 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 390 place count 26 transition count 28
Applied a total of 390 rules in 54 ms. Remains 26 /426 variables (removed 400) and now considering 28/543 (removed 515) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 26/426 places, 28/543 transitions.
RANDOM walk for 1021 steps (0 resets) in 11 ms. (85 steps per ms) remains 0/2 properties
[2025-06-07 17:56:08] [INFO ] Flatten gal took : 19 ms
[2025-06-07 17:56:08] [INFO ] Flatten gal took : 21 ms
[2025-06-07 17:56:08] [INFO ] Input system was already deterministic with 543 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 383 transition count 500
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 383 transition count 500
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 107 place count 362 transition count 479
Iterating global reduction 0 with 21 rules applied. Total rules applied 128 place count 362 transition count 479
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 139 place count 351 transition count 468
Iterating global reduction 0 with 11 rules applied. Total rules applied 150 place count 351 transition count 468
Applied a total of 150 rules in 34 ms. Remains 351 /426 variables (removed 75) and now considering 468/543 (removed 75) transitions.
// Phase 1: matrix 468 rows 351 cols
[2025-06-07 17:56:08] [INFO ] Computed 15 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:56:08] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-07 17:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:56:08] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2025-06-07 17:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (OVERLAPS) 468/819 variables, 351/366 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 819/819 variables, and 366 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/351 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (OVERLAPS) 468/819 variables, 351/366 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 467/833 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:56:54] [INFO ] Deduced a trap along path composed of 24 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 1/834 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:57:03] [INFO ] Deduced a trap composed of 70 places in 130 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 835 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 351/351 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 351/426 places, 468/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60392 ms. Remains : 351/426 places, 468/543 transitions.
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 17 ms
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 15 ms
[2025-06-07 17:57:08] [INFO ] Input system was already deterministic with 468 transitions.
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 14 ms
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 14 ms
[2025-06-07 17:57:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality8166607891365675405.gal : 9 ms
[2025-06-07 17:57:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality12498081524382598112.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8166607891365675405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12498081524382598112.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.87454e+20,0.188798,9892,2,1821,5,25746,6,0,1874,21406,0


Converting to forward existential form...Done !
original formula: E(!(((p114==0)||(p380==1))) U AX(AF(!(((p321==0)||(p511==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!(((p114==0)||(p380==1)))) * !(EX(!(!(EG(!(!(((p321==0)||(p511==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t57, t62, t86, t106, t111, t137, t161, t177, t182, t187, t212, t237, t261, t286, t312, t3...265
Hit Full ! (commute/partial/dont) 464/4/4
(forward)formula 0,0,25.2116,759380,1,0,1278,4.51264e+06,966,748,10551,5.28212e+06,1723
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Graph (trivial) has 448 edges and 426 vertex of which 257 / 426 are part of one of the 15 SCC in 1 ms
Free SCC test removed 242 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 183 transition count 207
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 92 rules applied. Total rules applied 160 place count 116 transition count 182
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 172 place count 104 transition count 182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 172 place count 104 transition count 180
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 176 place count 102 transition count 180
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 195 place count 83 transition count 156
Iterating global reduction 3 with 19 rules applied. Total rules applied 214 place count 83 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 216 place count 83 transition count 154
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 220 place count 79 transition count 142
Iterating global reduction 4 with 4 rules applied. Total rules applied 224 place count 79 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 228 place count 79 transition count 138
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 280 place count 53 transition count 112
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 284 place count 49 transition count 97
Iterating global reduction 5 with 4 rules applied. Total rules applied 288 place count 49 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 292 place count 49 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 294 place count 47 transition count 91
Applied a total of 294 rules in 29 ms. Remains 47 /426 variables (removed 379) and now considering 91/543 (removed 452) transitions.
[2025-06-07 17:57:34] [INFO ] Flow matrix only has 52 transitions (discarded 39 similar events)
// Phase 1: matrix 52 rows 47 cols
[2025-06-07 17:57:34] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:34] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-07 17:57:34] [INFO ] Flow matrix only has 52 transitions (discarded 39 similar events)
[2025-06-07 17:57:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:34] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:57:34] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2025-06-07 17:57:34] [INFO ] Flow matrix only has 52 transitions (discarded 39 similar events)
[2025-06-07 17:57:34] [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, 13/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 51/98 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/99 variables, and 62 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 51/98 variables, 47/62 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 49/111 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/99 variables, and 111 constraints, problems are : Problem set: 0 solved, 49 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 47/47 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1978ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1978ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/426 places, 91/543 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2271 ms. Remains : 47/426 places, 91/543 transitions.
[2025-06-07 17:57:36] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:57:36] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:57:36] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-07 17:57:36] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:57:36] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:57:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality11636065248609602977.gal : 1 ms
[2025-06-07 17:57:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17294823755775322517.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/CTLCardinality11636065248609602977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17294823755775322517.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AF(((p106==0)||(p196==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p106==0)||(p196==1))))] = FALSE
Hit Full ! (commute/partial/dont) 87/4/4
(forward)formula 0,0,0.038785,4572,1,0,8,3655,20,2,1316,2000,8
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Graph (trivial) has 441 edges and 426 vertex of which 253 / 426 are part of one of the 15 SCC in 1 ms
Free SCC test removed 238 places
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 187 transition count 212
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 91 rules applied. Total rules applied 159 place count 120 transition count 188
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 170 place count 109 transition count 188
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 170 place count 109 transition count 185
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 106 transition count 185
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 192 place count 90 transition count 164
Iterating global reduction 3 with 16 rules applied. Total rules applied 208 place count 90 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 210 place count 90 transition count 162
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 214 place count 86 transition count 150
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 86 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 222 place count 86 transition count 146
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 276 place count 59 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 279 place count 56 transition count 107
Iterating global reduction 5 with 3 rules applied. Total rules applied 282 place count 56 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 284 place count 56 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 286 place count 54 transition count 103
Applied a total of 286 rules in 41 ms. Remains 54 /426 variables (removed 372) and now considering 103/543 (removed 440) transitions.
[2025-06-07 17:57:36] [INFO ] Flow matrix only has 60 transitions (discarded 43 similar events)
// Phase 1: matrix 60 rows 54 cols
[2025-06-07 17:57:36] [INFO ] Computed 15 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 17:57:36] [INFO ] Flow matrix only has 60 transitions (discarded 43 similar events)
[2025-06-07 17:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:36] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 17:57:36] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-07 17:57:36] [INFO ] Flow matrix only has 60 transitions (discarded 43 similar events)
[2025-06-07 17:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/113 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/113 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 69 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 3/54 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/113 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 64/133 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 133 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1075 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2351ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2351ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/426 places, 103/543 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2631 ms. Remains : 54/426 places, 103/543 transitions.
[2025-06-07 17:57:39] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:57:39] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:57:39] [INFO ] Input system was already deterministic with 103 transitions.
[2025-06-07 17:57:39] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:57:39] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:57:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality6077108963128790323.gal : 1 ms
[2025-06-07 17:57:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality929010059238932929.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/CTLCardinality6077108963128790323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality929010059238932929.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,4.25503e+07,0.012759,4420,2,100,5,1268,6,0,306,764,0


Converting to forward existential form...Done !
original formula: AG((((p428==0) + EF(EG(((p424==0)&&(p401==1))))) + ((p156==0) + AG(((p256==0)||(p185==1))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((p428==0) + E(TRUE U EG(((p424==0)&&(p401==1))))))) * !((p156==0))),TRUE) * !(((p2...184
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.05502,5828,1,0,21,10962,28,10,1512,8541,13
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 381 transition count 498
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 381 transition count 498
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 114 place count 357 transition count 474
Iterating global reduction 0 with 24 rules applied. Total rules applied 138 place count 357 transition count 474
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 148 place count 347 transition count 464
Iterating global reduction 0 with 10 rules applied. Total rules applied 158 place count 347 transition count 464
Applied a total of 158 rules in 18 ms. Remains 347 /426 variables (removed 79) and now considering 464/543 (removed 79) transitions.
// Phase 1: matrix 464 rows 347 cols
[2025-06-07 17:57:39] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-07 17:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:57:39] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-07 17:57:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/811 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 362 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/811 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 463/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:25] [INFO ] Deduced a trap along path composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 826 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 347/426 places, 464/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60367 ms. Remains : 347/426 places, 464/543 transitions.
[2025-06-07 17:58:39] [INFO ] Flatten gal took : 22 ms
[2025-06-07 17:58:39] [INFO ] Flatten gal took : 28 ms
[2025-06-07 17:58:39] [INFO ] Input system was already deterministic with 464 transitions.
[2025-06-07 17:58:39] [INFO ] Flatten gal took : 11 ms
[2025-06-07 17:58:39] [INFO ] Flatten gal took : 27 ms
[2025-06-07 17:58:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16883528697755775704.gal : 3 ms
[2025-06-07 17:58:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality13317316677736285000.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/CTLCardinality16883528697755775704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13317316677736285000.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.56972e+20,0.221177,9532,2,1762,5,24071,6,0,1854,19110,0


Converting to forward existential form...Done !
original formula: EF(AX((p535==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p535==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t56, t61, t85, t105, t110, t135, t159, t179, t184, t209, t234, t258, t283, t308, t333, t3...259
(forward)formula 0,1,2.37844,76768,1,0,570,365937,945,392,10149,294805,935
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 389 transition count 506
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 389 transition count 506
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 90 place count 373 transition count 490
Iterating global reduction 0 with 16 rules applied. Total rules applied 106 place count 373 transition count 490
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 367 transition count 484
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 367 transition count 484
Applied a total of 118 rules in 15 ms. Remains 367 /426 variables (removed 59) and now considering 484/543 (removed 59) transitions.
// Phase 1: matrix 484 rows 367 cols
[2025-06-07 17:58:42] [INFO ] Computed 15 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:42] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-07 17:58:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 17:58:42] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 483 sub problems to find dead transitions.
[2025-06-07 17:58:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 1/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:50] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:51] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:52] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:52] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:58:52] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 484/851 variables, 367/387 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/851 variables, and 387 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 1/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 484/851 variables, 367/387 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/851 variables, 483/870 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:22] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:23] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:25] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 28 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 3/873 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:29] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:31] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 17:59:31] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 3/876 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/851 variables, and 876 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 483 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 367/426 places, 484/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60376 ms. Remains : 367/426 places, 484/543 transitions.
[2025-06-07 17:59:42] [INFO ] Flatten gal took : 12 ms
[2025-06-07 17:59:42] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:59:42] [INFO ] Input system was already deterministic with 484 transitions.
[2025-06-07 17:59:42] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:59:42] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:59:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality791509478548082916.gal : 2 ms
[2025-06-07 17:59:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4574469315949124168.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/CTLCardinality791509478548082916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4574469315949124168.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,3.66272e+20,0.255995,13224,2,2499,5,43606,6,0,1954,37759,0


Converting to forward existential form...Done !
original formula: E(((!((A((((p478==0)||(p382==0))||((p362==1)||(p185==1))) U (EX(((p76==0)||(p143==1))) * (((p396==1)||(p117==0))||(p295==1)))) * (EX(((p6...240
=> equivalent forward existential formula: [(EY(FwdU(Init,((!((!((E(!((EX(((p76==0)||(p143==1))) * (((p396==1)||(p117==0))||(p295==1)))) U (!((((p478==0)||...445
Reverse transition relation is NOT exact ! Due to transitions t8, t57, t62, t86, t106, t111, t133, t134, t138, t140, t148, t165, t185, t191, t219, t241, t2...313
Detected timeout of ITS tools.
[2025-06-07 18:00:12] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:00:12] [INFO ] Applying decomposition
[2025-06-07 18:00:12] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7231514848204405070.txt' '-o' '/tmp/graph7231514848204405070.bin' '-w' '/tmp/graph7231514848204405070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7231514848204405070.bin' '-l' '-1' '-v' '-w' '/tmp/graph7231514848204405070.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:00:12] [INFO ] Decomposing Gal with order
[2025-06-07 18:00:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:00:13] [INFO ] Removed a total of 286 redundant transitions.
[2025-06-07 18:00:13] [INFO ] Flatten gal took : 408 ms
[2025-06-07 18:00:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-07 18:00:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality11391429095330830434.gal : 7 ms
[2025-06-07 18:00:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality9357534839401789012.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/CTLCardinality11391429095330830434.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9357534839401789012.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.66272e+20,0.106268,8136,884,20,7569,500,710,7428,51,1183,0


Converting to forward existential form...Done !
original formula: E(((!((A((((i13.i0.u118.p478==0)||(i11.i2.u107.p382==0))||((i10.i2.u95.p362==1)||(i5.i3.u48.p185==1))) U (EX(((i2.i2.u18.p76==0)||(i4.i2....408
=> equivalent forward existential formula: [(EY(FwdU(Init,((!((!((E(!((EX(((i2.i2.u18.p76==0)||(i4.i2.u35.p143==1))) * (((i11.i1.u102.p396==1)||(i4.i2.u36....717
Reverse transition relation is NOT exact ! Due to transitions t8, t57, t106, t134, t185, t241, t293, i1.i2.t377, i2.i2.t349, i2.i2.t353, i3.i0.t326, i3.i0....455
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 383 transition count 500
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 383 transition count 500
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 110 place count 359 transition count 476
Iterating global reduction 0 with 24 rules applied. Total rules applied 134 place count 359 transition count 476
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 145 place count 348 transition count 465
Iterating global reduction 0 with 11 rules applied. Total rules applied 156 place count 348 transition count 465
Applied a total of 156 rules in 14 ms. Remains 348 /426 variables (removed 78) and now considering 465/543 (removed 78) transitions.
// Phase 1: matrix 465 rows 348 cols
[2025-06-07 18:00:43] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:00:43] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-07 18:00:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:00:43] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-06-07 18:00:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/348 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/813 variables, 348/363 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 813/813 variables, and 363 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/348 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/813 variables, 348/363 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 464/827 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:01:29] [INFO ] Deduced a trap along path composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 1/828 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 813/813 variables, and 828 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 348/426 places, 465/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60478 ms. Remains : 348/426 places, 465/543 transitions.
[2025-06-07 18:01:44] [INFO ] Flatten gal took : 16 ms
[2025-06-07 18:01:44] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:01:44] [INFO ] Input system was already deterministic with 465 transitions.
[2025-06-07 18:01:44] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:01:44] [INFO ] Flatten gal took : 20 ms
[2025-06-07 18:01:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16453931391189187364.gal : 2 ms
[2025-06-07 18:01:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality16811765777998967707.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/CTLCardinality16453931391189187364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16811765777998967707.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6468e+20,0.308314,9796,2,1830,5,25338,6,0,1859,20982,0


Converting to forward existential form...Done !
original formula: EF(EX(AG(((!(A(((p34==0)||(p528==1)) U (p434==0))) * (p525==0)) * (p509==0)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !(((!(!((E(!((p434==0)) U (!(((p34==0)||(p528==1))) * !((p434==0)))) + EG(!((...208
Reverse transition relation is NOT exact ! Due to transitions t4, t50, t55, t60, t84, t100, t105, t110, t135, t159, t179, t184, t209, t234, t258, t283, t30...270
(forward)formula 0,0,7.23742,242752,1,0,781,1.34156e+06,964,491,10962,1.48628e+06,1186
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Graph (trivial) has 450 edges and 426 vertex of which 257 / 426 are part of one of the 15 SCC in 1 ms
Free SCC test removed 242 places
Ensure Unique test removed 267 transitions
Reduce isomorphic transitions removed 267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 183 transition count 206
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 94 rules applied. Total rules applied 164 place count 114 transition count 181
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 177 place count 102 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 101 transition count 180
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 198 place count 81 transition count 155
Iterating global reduction 4 with 20 rules applied. Total rules applied 218 place count 81 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 220 place count 81 transition count 153
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 224 place count 77 transition count 141
Iterating global reduction 5 with 4 rules applied. Total rules applied 228 place count 77 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 232 place count 77 transition count 137
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 284 place count 51 transition count 111
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 289 place count 46 transition count 92
Iterating global reduction 6 with 5 rules applied. Total rules applied 294 place count 46 transition count 92
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 299 place count 46 transition count 87
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 300 place count 46 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 301 place count 46 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 302 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 304 place count 43 transition count 83
Applied a total of 304 rules in 37 ms. Remains 43 /426 variables (removed 383) and now considering 83/543 (removed 460) transitions.
[2025-06-07 18:01:51] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
// Phase 1: matrix 42 rows 43 cols
[2025-06-07 18:01:51] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:01:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-07 18:01:51] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
[2025-06-07 18:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:01:51] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:01:51] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2025-06-07 18:01:51] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
[2025-06-07 18:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 58 constraints, problems are : Problem set: 0 solved, 41 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 99 constraints, problems are : Problem set: 0 solved, 41 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1218ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1218ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/426 places, 83/543 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1364 ms. Remains : 43/426 places, 83/543 transitions.
[2025-06-07 18:01:52] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:01:52] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:01:52] [INFO ] Input system was already deterministic with 83 transitions.
[2025-06-07 18:01:52] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:01:52] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:01:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8859908204674741148.gal : 0 ms
[2025-06-07 18:01:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10164638944867426542.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/ReachabilityCardinality8859908204674741148.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10164638944867426542.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 160 steps (4 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 380 transition count 497
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 380 transition count 497
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 117 place count 355 transition count 472
Iterating global reduction 0 with 25 rules applied. Total rules applied 142 place count 355 transition count 472
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 153 place count 344 transition count 461
Iterating global reduction 0 with 11 rules applied. Total rules applied 164 place count 344 transition count 461
Applied a total of 164 rules in 18 ms. Remains 344 /426 variables (removed 82) and now considering 461/543 (removed 82) transitions.
// Phase 1: matrix 461 rows 344 cols
[2025-06-07 18:01:53] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:01:53] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-07 18:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:01:53] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 18:01:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/805 variables, 344/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/805 variables, and 359 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/805 variables, 344/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 460/819 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:39] [INFO ] Deduced a trap along path composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 1/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:47] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:48] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:02:48] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 3/823 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 823 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 344/426 places, 461/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60560 ms. Remains : 344/426 places, 461/543 transitions.
[2025-06-07 18:02:53] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:02:53] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:02:53] [INFO ] Input system was already deterministic with 461 transitions.
[2025-06-07 18:02:53] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:02:53] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:02:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality16220327275062608326.gal : 2 ms
[2025-06-07 18:02:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9462256288939282942.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/CTLCardinality16220327275062608326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9462256288939282942.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.38161e+20,0.286816,9388,2,1756,5,23975,6,0,1839,19036,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t53, t58, t82, t102, t107, t132, t156, t176, t181, t206, t231, t255, t280, t305, t330, t3...259
(forward)formula 0,0,17.6243,531248,1,0,1102,2.25978e+06,943,799,10345,4.10197e+06,1347
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Graph (trivial) has 442 edges and 426 vertex of which 250 / 426 are part of one of the 17 SCC in 1 ms
Free SCC test removed 233 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 192 transition count 219
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 92 rules applied. Total rules applied 162 place count 123 transition count 196
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 174 place count 112 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 111 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 175 place count 111 transition count 194
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 177 place count 110 transition count 194
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 196 place count 91 transition count 170
Iterating global reduction 4 with 19 rules applied. Total rules applied 215 place count 91 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 217 place count 91 transition count 168
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 220 place count 88 transition count 160
Iterating global reduction 5 with 3 rules applied. Total rules applied 223 place count 88 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 226 place count 88 transition count 157
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 280 place count 61 transition count 130
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 285 place count 56 transition count 111
Iterating global reduction 6 with 5 rules applied. Total rules applied 290 place count 56 transition count 111
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 295 place count 56 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 297 place count 54 transition count 104
Applied a total of 297 rules in 24 ms. Remains 54 /426 variables (removed 372) and now considering 104/543 (removed 439) transitions.
[2025-06-07 18:03:11] [INFO ] Flow matrix only has 61 transitions (discarded 43 similar events)
// Phase 1: matrix 61 rows 54 cols
[2025-06-07 18:03:11] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-07 18:03:11] [INFO ] Flow matrix only has 61 transitions (discarded 43 similar events)
[2025-06-07 18:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:11] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:03:11] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2025-06-07 18:03:11] [INFO ] Flow matrix only has 61 transitions (discarded 43 similar events)
[2025-06-07 18:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/114 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 69 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/114 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 59/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 128 constraints, problems are : Problem set: 0 solved, 59 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2019ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2019ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/426 places, 104/543 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2147 ms. Remains : 54/426 places, 104/543 transitions.
[2025-06-07 18:03:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:03:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:03:13] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-07 18:03:13] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:03:13] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:03:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality15653593187572205919.gal : 1 ms
[2025-06-07 18:03:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14979148736448171698.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/CTLCardinality15653593187572205919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14979148736448171698.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,7.08588e+07,0.024453,4408,2,94,5,1071,6,0,306,635,0


Converting to forward existential form...Done !
original formula: EG(((EG(((p13==0)&&(p187==1))) + (p159==0)) + ((p61==0)&&(p82==1))))
=> equivalent forward existential formula: [FwdG(Init,((EG(((p13==0)&&(p187==1))) + (p159==0)) + ((p61==0)&&(p82==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.090758,6328,1,0,50,14425,24,50,1406,15127,54
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Graph (trivial) has 450 edges and 426 vertex of which 263 / 426 are part of one of the 15 SCC in 0 ms
Free SCC test removed 248 places
Ensure Unique test removed 274 transitions
Reduce isomorphic transitions removed 274 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 177 transition count 203
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 90 rules applied. Total rules applied 156 place count 112 transition count 178
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 168 place count 100 transition count 178
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 188 place count 80 transition count 153
Iterating global reduction 3 with 20 rules applied. Total rules applied 208 place count 80 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 210 place count 80 transition count 151
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 214 place count 76 transition count 139
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 76 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 222 place count 76 transition count 135
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 274 place count 50 transition count 109
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 279 place count 45 transition count 90
Iterating global reduction 5 with 5 rules applied. Total rules applied 284 place count 45 transition count 90
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 289 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 291 place count 43 transition count 83
Applied a total of 291 rules in 26 ms. Remains 43 /426 variables (removed 383) and now considering 83/543 (removed 460) transitions.
[2025-06-07 18:03:13] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
// Phase 1: matrix 42 rows 43 cols
[2025-06-07 18:03:13] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:13] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-07 18:03:13] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
[2025-06-07 18:03:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:13] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:03:13] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2025-06-07 18:03:13] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
[2025-06-07 18:03: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/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 58 constraints, problems are : Problem set: 0 solved, 41 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 99 constraints, problems are : Problem set: 0 solved, 41 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1326ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/426 places, 83/543 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1546 ms. Remains : 43/426 places, 83/543 transitions.
[2025-06-07 18:03:15] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:03:15] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:03:15] [INFO ] Input system was already deterministic with 83 transitions.
[2025-06-07 18:03:15] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:03:15] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:03:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8641502760475455664.gal : 0 ms
[2025-06-07 18:03:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality17298500123870787125.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/CTLCardinality8641502760475455664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17298500123870787125.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.6687e+06,0.009745,4252,2,72,5,671,6,0,243,375,0


Converting to forward existential form...Done !
original formula: EG((p122==0))
=> equivalent forward existential formula: [FwdG(Init,(p122==0))] != FALSE
Hit Full ! (commute/partial/dont) 81/0/2
(forward)formula 0,1,0.02111,4508,1,0,8,3163,19,4,1171,2003,8
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Graph (trivial) has 447 edges and 426 vertex of which 265 / 426 are part of one of the 15 SCC in 1 ms
Free SCC test removed 250 places
Ensure Unique test removed 277 transitions
Reduce isomorphic transitions removed 277 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 175 transition count 202
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 88 rules applied. Total rules applied 152 place count 112 transition count 177
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 164 place count 100 transition count 177
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 183 place count 81 transition count 153
Iterating global reduction 3 with 19 rules applied. Total rules applied 202 place count 81 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 204 place count 81 transition count 151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 207 place count 78 transition count 143
Iterating global reduction 4 with 3 rules applied. Total rules applied 210 place count 78 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 213 place count 78 transition count 140
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 265 place count 52 transition count 114
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 270 place count 47 transition count 95
Iterating global reduction 5 with 5 rules applied. Total rules applied 275 place count 47 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 279 place count 47 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 281 place count 45 transition count 89
Applied a total of 281 rules in 17 ms. Remains 45 /426 variables (removed 381) and now considering 89/543 (removed 454) transitions.
[2025-06-07 18:03:15] [INFO ] Flow matrix only has 45 transitions (discarded 44 similar events)
// Phase 1: matrix 45 rows 45 cols
[2025-06-07 18:03:15] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 18:03:15] [INFO ] Flow matrix only has 45 transitions (discarded 44 similar events)
[2025-06-07 18:03:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:15] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:03:15] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-07 18:03:15] [INFO ] Flow matrix only has 45 transitions (discarded 44 similar events)
[2025-06-07 18:03:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 44/89 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/89 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 60 constraints, problems are : Problem set: 0 solved, 46 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2/45 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 44/89 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 46/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 106 constraints, problems are : Problem set: 0 solved, 46 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1551ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1551ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/426 places, 89/543 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1745 ms. Remains : 45/426 places, 89/543 transitions.
[2025-06-07 18:03:16] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:03:16] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:03:17] [INFO ] Input system was already deterministic with 89 transitions.
[2025-06-07 18:03:17] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:03:17] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:03:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality6562595499175226152.gal : 0 ms
[2025-06-07 18:03:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality15478996035332372321.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/CTLCardinality6562595499175226152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15478996035332372321.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,7.55827e+06,0.009818,4296,2,76,5,739,6,0,257,411,0


Converting to forward existential form...Done !
original formula: EF((AF(E((p176!=1) U (p364==1))) * AG((p162==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(E((p176!=1) U (p364==1)))))) * !(E(TRUE U !((p162==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 87/0/2
Using saturation style SCC detection
(forward)formula 0,1,0.128018,9800,1,0,62,30400,30,41,1310,43996,45
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Graph (trivial) has 444 edges and 426 vertex of which 245 / 426 are part of one of the 15 SCC in 0 ms
Free SCC test removed 230 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 195 transition count 217
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 95 rules applied. Total rules applied 167 place count 124 transition count 193
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 180 place count 112 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 181 place count 111 transition count 192
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 181 place count 111 transition count 189
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 187 place count 108 transition count 189
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 204 place count 91 transition count 169
Iterating global reduction 4 with 17 rules applied. Total rules applied 221 place count 91 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 91 transition count 168
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 225 place count 88 transition count 160
Iterating global reduction 5 with 3 rules applied. Total rules applied 228 place count 88 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 231 place count 88 transition count 157
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 285 place count 61 transition count 130
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 289 place count 57 transition count 115
Iterating global reduction 6 with 4 rules applied. Total rules applied 293 place count 57 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 297 place count 57 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 299 place count 55 transition count 109
Applied a total of 299 rules in 19 ms. Remains 55 /426 variables (removed 371) and now considering 109/543 (removed 434) transitions.
[2025-06-07 18:03:17] [INFO ] Flow matrix only has 63 transitions (discarded 46 similar events)
// Phase 1: matrix 63 rows 55 cols
[2025-06-07 18:03:17] [INFO ] Computed 15 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-07 18:03:17] [INFO ] Flow matrix only has 63 transitions (discarded 46 similar events)
[2025-06-07 18:03:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:03:17] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2025-06-07 18:03:17] [INFO ] Flow matrix only has 63 transitions (discarded 46 similar events)
[2025-06-07 18:03:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 62/117 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/117 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/118 variables, and 70 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 62/117 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 65/135 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/117 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/118 variables, and 135 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2282ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2282ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/426 places, 109/543 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2449 ms. Remains : 55/426 places, 109/543 transitions.
[2025-06-07 18:03:19] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:03:19] [INFO ] Flatten gal took : 1 ms
[2025-06-07 18:03:19] [INFO ] Input system was already deterministic with 109 transitions.
[2025-06-07 18:03:19] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:03:19] [INFO ] Flatten gal took : 2 ms
[2025-06-07 18:03:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality9174443483434104627.gal : 1 ms
[2025-06-07 18:03:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15478597483551963711.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/CTLCardinality9174443483434104627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15478597483551963711.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.00113e+07,0.012678,4324,2,96,5,1036,6,0,317,610,0


Converting to forward existential form...Done !
original formula: (EF(((p473==0)||(p376==1))) * EG((AF((p332==0)) * EF((p241==0)))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U ((p473==0)||(p376==1)))),(!(EG(!((p332==0)))) * E(TRUE U (p241==0))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.090648,6884,1,0,56,15675,29,54,1512,19184,60
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 380 transition count 497
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 380 transition count 497
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 117 place count 355 transition count 472
Iterating global reduction 0 with 25 rules applied. Total rules applied 142 place count 355 transition count 472
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 153 place count 344 transition count 461
Iterating global reduction 0 with 11 rules applied. Total rules applied 164 place count 344 transition count 461
Applied a total of 164 rules in 12 ms. Remains 344 /426 variables (removed 82) and now considering 461/543 (removed 82) transitions.
// Phase 1: matrix 461 rows 344 cols
[2025-06-07 18:03:19] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:19] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-07 18:03:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:03:20] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2025-06-07 18:03:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/805 variables, 344/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 460 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 805/805 variables, and 359 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/805 variables, 344/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 460/819 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:06] [INFO ] Deduced a trap along path composed of 22 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 1/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:14] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:15] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:15] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 3/823 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 823 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 344/426 places, 461/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60427 ms. Remains : 344/426 places, 461/543 transitions.
[2025-06-07 18:04:20] [INFO ] Flatten gal took : 14 ms
[2025-06-07 18:04:20] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:04:20] [INFO ] Input system was already deterministic with 461 transitions.
[2025-06-07 18:04:20] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:04:20] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:04:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality4901350273455327979.gal : 2 ms
[2025-06-07 18:04:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality5149531416570413559.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/CTLCardinality4901350273455327979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5149531416570413559.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.38161e+20,0.180077,9392,2,1756,5,23975,6,0,1839,19036,0


Converting to forward existential form...Done !
original formula: AX((((p188==0) * AG(AF((p28==0)))) * ((AX(((p491==0)&&(p440==1))) + (AG(((p148==0)&&(p134==1))) * AF(((p383==0)&&(p278==1))))) + ((p400==...183
=> equivalent forward existential formula: (([(EY(Init) * !((p188==0)))] = FALSE * [FwdG(FwdU(EY(Init),TRUE),!((p28==0)))] = FALSE) * ([(FwdU(((EY(Init) * ...411
Reverse transition relation is NOT exact ! Due to transitions t4, t53, t58, t82, t102, t107, t132, t156, t176, t181, t206, t231, t255, t280, t305, t330, t3...259
Hit Full ! (commute/partial/dont) 459/0/2
(forward)formula 0,0,2.44205,83424,1,0,576,395979,962,393,11434,332795,946
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 385 transition count 502
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 385 transition count 502
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 104 place count 363 transition count 480
Iterating global reduction 0 with 22 rules applied. Total rules applied 126 place count 363 transition count 480
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 353 transition count 470
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 353 transition count 470
Applied a total of 146 rules in 15 ms. Remains 353 /426 variables (removed 73) and now considering 470/543 (removed 73) transitions.
// Phase 1: matrix 470 rows 353 cols
[2025-06-07 18:04:22] [INFO ] Computed 15 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:04:22] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-07 18:04:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:04:23] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2025-06-07 18:04: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/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:30] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:31] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:31] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:32] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:04:32] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (OVERLAPS) 470/823 variables, 353/373 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 373 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (OVERLAPS) 470/823 variables, 353/373 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 469/842 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:05:01] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:05:10] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 844 constraints, problems are : Problem set: 0 solved, 469 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 469/469 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 353/426 places, 470/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60417 ms. Remains : 353/426 places, 470/543 transitions.
[2025-06-07 18:05:23] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:05:23] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:05:23] [INFO ] Input system was already deterministic with 470 transitions.
[2025-06-07 18:05:23] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:05:23] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:05:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality11549874718513236129.gal : 2 ms
[2025-06-07 18:05:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality3809089224268726035.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/CTLCardinality11549874718513236129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3809089224268726035.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.02563e+20,0.238179,12508,2,2401,5,39162,6,0,1884,34932,0


Converting to forward existential form...Done !
original formula: AX((!(E((p335==1) U !(AX((p502==1))))) + ((AF(((p382==0)||(p291==1))) * AF((((p401==0)&&(p361==1))||(p348==1)))) * ((p521==0) + EG((p28==...162
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(!(E((p335==1) U !(!(EX(!((p502==1))))))))),!(((p382==0)||(p291==1))))] = FALSE * [FwdG((EY...365
Reverse transition relation is NOT exact ! Due to transitions t5, t42, t55, t60, t84, t104, t109, t129, t130, t135, t145, t163, t185, t190, t215, t235, t24...294
Detected timeout of ITS tools.
[2025-06-07 18:05:53] [INFO ] Flatten gal took : 37 ms
[2025-06-07 18:05:53] [INFO ] Applying decomposition
[2025-06-07 18:05:53] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2376947812015499232.txt' '-o' '/tmp/graph2376947812015499232.bin' '-w' '/tmp/graph2376947812015499232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2376947812015499232.bin' '-l' '-1' '-v' '-w' '/tmp/graph2376947812015499232.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:05:53] [INFO ] Decomposing Gal with order
[2025-06-07 18:05:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:05:53] [INFO ] Removed a total of 292 redundant transitions.
[2025-06-07 18:05:53] [INFO ] Flatten gal took : 22 ms
[2025-06-07 18:05:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2025-06-07 18:05:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9184229484497529832.gal : 5 ms
[2025-06-07 18:05:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11127260075803997674.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/CTLCardinality9184229484497529832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11127260075803997674.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02563e+20,0.096665,7464,697,20,5779,336,613,8240,49,687,0


Converting to forward existential form...Done !
original formula: AX((!(E((i8.i0.u77.p335==1) U !(AX((i13.i0.u119.p502==1))))) + ((AF(((i10.i2.u90.p382==0)||(i7.i1.u65.p291==1))) * AF((((i10.i1.u96.p401=...257
=> equivalent forward existential formula: (([FwdG((EY(Init) * !(!(E((i8.i0.u77.p335==1) U !(!(EX(!((i13.i0.u119.p502==1))))))))),!(((i10.i2.u90.p382==0)||...504
Reverse transition relation is NOT exact ! Due to transitions t5, t55, t104, t130, t185, t235, t334, i0.i2.t363, i1.i2.t339, i2.i0.t314, i3.i0.t289, i4.i2....401
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,1.23414,48936,1,0,95103,432,5327,117266,261,1013,233390
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 543/543 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 383 transition count 500
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 383 transition count 500
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 111 place count 358 transition count 475
Iterating global reduction 0 with 25 rules applied. Total rules applied 136 place count 358 transition count 475
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 147 place count 347 transition count 464
Iterating global reduction 0 with 11 rules applied. Total rules applied 158 place count 347 transition count 464
Applied a total of 158 rules in 13 ms. Remains 347 /426 variables (removed 79) and now considering 464/543 (removed 79) transitions.
// Phase 1: matrix 464 rows 347 cols
[2025-06-07 18:05:54] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:05:54] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-06-07 18:05:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:05:55] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-07 18:05: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/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/811 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 811/811 variables, and 362 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/346 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/347 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/811 variables, 347/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 463/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:06:40] [INFO ] Deduced a trap along path composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 811/811 variables, and 826 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 347/426 places, 464/543 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60513 ms. Remains : 347/426 places, 464/543 transitions.
[2025-06-07 18:06:55] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:06:55] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:06:55] [INFO ] Input system was already deterministic with 464 transitions.
[2025-06-07 18:06:55] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:06:55] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:06:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality9610327042052865291.gal : 2 ms
[2025-06-07 18:06:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality12981210671941546596.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/CTLCardinality9610327042052865291.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12981210671941546596.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.5783e+20,0.185076,9808,2,1870,5,25184,6,0,1854,20727,0


Converting to forward existential form...Done !
original formula: EX(EG((!(A(((p504==0)||(p101==1)) U (p219==1))) + ((p480==0)&&(p59==0)))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!(!((E(!((p219==1)) U (!(((p504==0)||(p101==1))) * !((p219==1)))) + EG(!((p219==1)))))) + ((p480...182
Reverse transition relation is NOT exact ! Due to transitions t5, t54, t59, t83, t103, t108, t133, t157, t177, t182, t207, t232, t240, t257, t277, t282, t3...271
Detected timeout of ITS tools.
[2025-06-07 18:07:25] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:07:25] [INFO ] Applying decomposition
[2025-06-07 18:07:25] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4955432725634972376.txt' '-o' '/tmp/graph4955432725634972376.bin' '-w' '/tmp/graph4955432725634972376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4955432725634972376.bin' '-l' '-1' '-v' '-w' '/tmp/graph4955432725634972376.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:07:25] [INFO ] Decomposing Gal with order
[2025-06-07 18:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:07:25] [INFO ] Removed a total of 292 redundant transitions.
[2025-06-07 18:07:25] [INFO ] Flatten gal took : 17 ms
[2025-06-07 18:07:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-07 18:07:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality5871632732601539660.gal : 19 ms
[2025-06-07 18:07:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3334337774028369843.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/CTLCardinality5871632732601539660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3334337774028369843.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5783e+20,0.090324,7288,882,20,5953,451,620,4608,50,978,0


Converting to forward existential form...Done !
original formula: EX(EG((!(A(((i14.i0.u118.p504==0)||(i3.i1.u24.p101==1)) U (i6.i2.u50.p219==1))) + ((i13.i0.u108.p480==0)&&(i2.i1.u14.p59==0)))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!(!((E(!((i6.i2.u50.p219==1)) U (!(((i14.i0.u118.p504==0)||(i3.i1.u24.p101==1))) * !((i6.i2.u50....256
Reverse transition relation is NOT exact ! Due to transitions t5, t54, t103, t177, t277, i1.i0.t357, i2.i2.t332, i3.i2.t307, i4.i0.t282, i5.i0.t257, i6.i0....363
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,17.9395,434552,1,0,973251,451,4667,826828,255,978,903661
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-07 18:07:43] [INFO ] Flatten gal took : 11 ms
[2025-06-07 18:07:43] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:07:43] [INFO ] Applying decomposition
[2025-06-07 18:07:43] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2457849238807194689.txt' '-o' '/tmp/graph2457849238807194689.bin' '-w' '/tmp/graph2457849238807194689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2457849238807194689.bin' '-l' '-1' '-v' '-w' '/tmp/graph2457849238807194689.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:07:43] [INFO ] Decomposing Gal with order
[2025-06-07 18:07:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:07:43] [INFO ] Removed a total of 246 redundant transitions.
[2025-06-07 18:07:43] [INFO ] Flatten gal took : 39 ms
[2025-06-07 18:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2025-06-07 18:07:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality7029788972734212780.gal : 5 ms
[2025-06-07 18:07:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality12396610167540310540.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/CTLCardinality7029788972734212780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12396610167540310540.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.61016e+21,0.185012,9712,925,21,10565,422,905,13853,47,980,0


Converting to forward existential form...Done !
original formula: E(((!((A((((i13.i1.i0.u143.p478==0)||(i11.u125.p382==0))||((i10.i2.i0.u109.p362==1)||(i5.u55.p185==1))) U (EX(((i1.u21.p76==0)||(i3.u42.p...400
=> equivalent forward existential formula: [(EY(FwdU(Init,((!((!((E(!((EX(((i1.u21.p76==0)||(i3.u42.p143==1))) * (((i11.u119.p396==1)||(i3.u41.p117==0))||(...679
Reverse transition relation is NOT exact ! Due to transitions t22, t81, t133, t225, t401, i0.i0.i2.u2.t432, i1.t408, i1.t404, i2.t377, i2.u22.t372, i3.t347...621
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,45.1573,832880,1,0,1.52155e+06,422,5739,2.28348e+06,237,980,1157674
FORMULA Champagne-PT-H05T2O-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 803962 ms.

BK_STOP 1749319708926

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-H05T2O"
export BK_EXAMINATION="CTLCardinality"
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-H05T2O, examination is CTLCardinality"
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-174931339100041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H05T2O.tgz
mv Champagne-PT-H05T2O execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;