Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Champagne-PT-H07T0R, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.2K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 11:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 5.3K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 119K Jun 5 20:08 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-00
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-01
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-02
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-03
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-04
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-05
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-06
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-07
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-08
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-09
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-10
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-11
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-12
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-13
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-14
FORMULA_NAME Champagne-PT-H07T0R-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749321523944

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-H07T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-07 18:38:45] [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 18:38:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:38:45] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2025-06-07 18:38:45] [INFO ] Transformed 539 places.
[2025-06-07 18:38:45] [INFO ] Transformed 742 transitions.
[2025-06-07 18:38:45] [INFO ] Found NUPN structural information;
[2025-06-07 18:38:45] [INFO ] Parsed PT model containing 539 places and 742 transitions and 1934 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 539 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 539/539 places, 742/742 transitions.
Discarding 113 places :
Symmetric choice reduction at 0 with 113 rule applications. Total rules 113 place count 426 transition count 629
Iterating global reduction 0 with 113 rules applied. Total rules applied 226 place count 426 transition count 629
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 282 place count 370 transition count 573
Iterating global reduction 0 with 56 rules applied. Total rules applied 338 place count 370 transition count 573
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 369 place count 339 transition count 511
Iterating global reduction 0 with 31 rules applied. Total rules applied 400 place count 339 transition count 511
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 414 place count 339 transition count 497
Applied a total of 414 rules in 110 ms. Remains 339 /539 variables (removed 200) and now considering 497/742 (removed 245) transitions.
// Phase 1: matrix 497 rows 339 cols
[2025-06-07 18:38:45] [INFO ] Computed 27 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:38:45] [INFO ] Implicit Places using invariants in 311 ms returned []
[2025-06-07 18:38:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:38:46] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2025-06-07 18:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:38:54] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:38:55] [INFO ] Deduced a trap composed of 32 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 18:38:55] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:38:55] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:38:56] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:38:56] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:38:56] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:38:56] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (OVERLAPS) 497/836 variables, 339/374 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/836 variables, and 374 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/338 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (OVERLAPS) 1/339 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (OVERLAPS) 497/836 variables, 339/374 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 496/870 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:25] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:26] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:27] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:27] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:28] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:28] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:28] [INFO ] Deduced a trap composed of 113 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:28] [INFO ] Deduced a trap composed of 130 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:29] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:29] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:30] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:31] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 12/882 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:37] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 496 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:44] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/836 variables, and 884 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 339/539 places, 497/742 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60898 ms. Remains : 339/539 places, 497/742 transitions.
Support contains 61 out of 339 places after structural reductions.
[2025-06-07 18:39:46] [INFO ] Flatten gal took : 60 ms
[2025-06-07 18:39:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-07 18:39:46] [INFO ] Flatten gal took : 33 ms
[2025-06-07 18:39:46] [INFO ] Input system was already deterministic with 497 transitions.
Support contains 59 out of 339 places (down from 61) after GAL structural reductions.
RANDOM walk for 40000 steps (129 resets) in 991 ms. (40 steps per ms) remains 1/36 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2025-06-07 18:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 322/339 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 497/836 variables, 339/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:47] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/836 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 322/339 variables, 26/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 497/836 variables, 339/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/836 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 339/339 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 720ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 8 ms.
[2025-06-07 18:39:47] [INFO ] Flatten gal took : 21 ms
[2025-06-07 18:39:47] [INFO ] Flatten gal took : 26 ms
[2025-06-07 18:39:47] [INFO ] Input system was already deterministic with 497 transitions.
Computed a total of 50 stabilizing places and 50 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Graph (trivial) has 319 edges and 339 vertex of which 50 / 339 are part of one of the 9 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 297 transition count 382
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 113 rules applied. Total rules applied 182 place count 229 transition count 337
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 203 place count 208 transition count 337
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 203 place count 208 transition count 326
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 225 place count 197 transition count 326
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 251 place count 171 transition count 297
Iterating global reduction 3 with 26 rules applied. Total rules applied 277 place count 171 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 278 place count 171 transition count 296
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 278 place count 171 transition count 290
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 290 place count 165 transition count 290
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 295 place count 160 transition count 262
Iterating global reduction 4 with 5 rules applied. Total rules applied 300 place count 160 transition count 262
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 305 place count 160 transition count 257
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 457 place count 84 transition count 181
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 460 place count 81 transition count 165
Iterating global reduction 5 with 3 rules applied. Total rules applied 463 place count 81 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 466 place count 81 transition count 162
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 468 place count 79 transition count 160
Applied a total of 468 rules in 136 ms. Remains 79 /339 variables (removed 260) and now considering 160/497 (removed 337) transitions.
[2025-06-07 18:39:48] [INFO ] Flow matrix only has 85 transitions (discarded 75 similar events)
// Phase 1: matrix 85 rows 79 cols
[2025-06-07 18:39:48] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:39:48] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-07 18:39:48] [INFO ] Flow matrix only has 85 transitions (discarded 75 similar events)
[2025-06-07 18:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:39:48] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:39:48] [INFO ] Redundant transitions in 5 ms returned []
Running 104 sub problems to find dead transitions.
[2025-06-07 18:39:48] [INFO ] Flow matrix only has 85 transitions (discarded 75 similar events)
[2025-06-07 18:39:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 3/79 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 84/163 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/164 variables, and 106 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2536 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 3/79 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 84/163 variables, 79/106 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 104/210 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/164 variables, and 210 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2459 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5012ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 5013ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/339 places, 160/497 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5340 ms. Remains : 79/339 places, 160/497 transitions.
[2025-06-07 18:39:53] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:39:53] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:39:53] [INFO ] Input system was already deterministic with 160 transitions.
[2025-06-07 18:39:53] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:39:53] [INFO ] Flatten gal took : 22 ms
[2025-06-07 18:39:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10992225384619712326.gal : 3 ms
[2025-06-07 18:39:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality17397719431647106412.ctl : 11 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/CTLCardinality10992225384619712326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17397719431647106412.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.65299e+12,0.033838,4848,2,132,5,1590,6,0,470,834,0


Converting to forward existential form...Done !
original formula: E(((p235==0)||(p260==1)) U (p347!=0))
=> equivalent forward existential formula: [(FwdU(Init,((p235==0)||(p260==1))) * (p347!=0))] != FALSE
Hit Full ! (commute/partial/dont) 150/0/10
(forward)formula 0,1,0.041704,4976,1,0,8,2696,15,1,900,1829,4
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Graph (trivial) has 325 edges and 339 vertex of which 50 / 339 are part of one of the 9 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 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 297 transition count 381
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 116 rules applied. Total rules applied 186 place count 228 transition count 334
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 208 place count 206 transition count 334
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 208 place count 206 transition count 322
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 232 place count 194 transition count 322
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 259 place count 167 transition count 292
Iterating global reduction 3 with 27 rules applied. Total rules applied 286 place count 167 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 287 place count 167 transition count 291
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 287 place count 167 transition count 285
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 299 place count 161 transition count 285
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 305 place count 155 transition count 253
Iterating global reduction 4 with 6 rules applied. Total rules applied 311 place count 155 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 317 place count 155 transition count 247
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 467 place count 80 transition count 172
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 470 place count 77 transition count 156
Iterating global reduction 5 with 3 rules applied. Total rules applied 473 place count 77 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 476 place count 77 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 477 place count 76 transition count 152
Applied a total of 477 rules in 47 ms. Remains 76 /339 variables (removed 263) and now considering 152/497 (removed 345) transitions.
[2025-06-07 18:39:53] [INFO ] Flow matrix only has 71 transitions (discarded 81 similar events)
// Phase 1: matrix 71 rows 76 cols
[2025-06-07 18:39:53] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:39:53] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 18:39:53] [INFO ] Flow matrix only has 71 transitions (discarded 81 similar events)
[2025-06-07 18:39:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:39:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-07 18:39:53] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:39:53] [INFO ] Redundant transitions in 4 ms returned []
Running 109 sub problems to find dead transitions.
[2025-06-07 18:39:53] [INFO ] Flow matrix only has 71 transitions (discarded 81 similar events)
[2025-06-07 18:39:53] [INFO ] Invariant cache hit.
[2025-06-07 18:39:53] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 70/146 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:39:55] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 109 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2975 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 70/146 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 109/217 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 218 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2788 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5787ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 5787ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/339 places, 152/497 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6049 ms. Remains : 76/339 places, 152/497 transitions.
[2025-06-07 18:39:59] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:39:59] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:39:59] [INFO ] Input system was already deterministic with 152 transitions.
[2025-06-07 18:39:59] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:39:59] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:39:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality11510145385251131631.gal : 2 ms
[2025-06-07 18:39:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality18196714568637482358.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/CTLCardinality11510145385251131631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18196714568637482358.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,4.56769e+11,0.021106,4736,2,149,5,1502,6,0,449,781,0


Converting to forward existential form...Done !
original formula: EF(EG((p2==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p2==0))] != FALSE
Hit Full ! (commute/partial/dont) 150/0/2
(forward)formula 0,1,0.056394,5376,1,0,8,7814,19,3,2253,3575,8
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Graph (trivial) has 323 edges and 339 vertex of which 47 / 339 are part of one of the 9 SCC in 0 ms
Free SCC test removed 38 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 300 transition count 384
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 117 rules applied. Total rules applied 188 place count 230 transition count 337
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 210 place count 208 transition count 337
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 210 place count 208 transition count 325
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 234 place count 196 transition count 325
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 261 place count 169 transition count 295
Iterating global reduction 3 with 27 rules applied. Total rules applied 288 place count 169 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 289 place count 169 transition count 294
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 289 place count 169 transition count 288
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 301 place count 163 transition count 288
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 307 place count 157 transition count 256
Iterating global reduction 4 with 6 rules applied. Total rules applied 313 place count 157 transition count 256
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 319 place count 157 transition count 250
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 471 place count 81 transition count 174
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 474 place count 78 transition count 158
Iterating global reduction 5 with 3 rules applied. Total rules applied 477 place count 78 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 480 place count 78 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 482 place count 76 transition count 153
Applied a total of 482 rules in 32 ms. Remains 76 /339 variables (removed 263) and now considering 153/497 (removed 344) transitions.
[2025-06-07 18:39:59] [INFO ] Flow matrix only has 72 transitions (discarded 81 similar events)
// Phase 1: matrix 72 rows 76 cols
[2025-06-07 18:39:59] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:39:59] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-07 18:39:59] [INFO ] Flow matrix only has 72 transitions (discarded 81 similar events)
[2025-06-07 18:39:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:39:59] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:39:59] [INFO ] Redundant transitions in 4 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-07 18:39:59] [INFO ] Flow matrix only has 72 transitions (discarded 81 similar events)
[2025-06-07 18:39:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/147 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/148 variables, and 103 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 2/76 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 71/147 variables, 76/103 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 96/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/148 variables, and 199 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2159 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 76/76 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4162ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4163ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/339 places, 153/497 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4389 ms. Remains : 76/339 places, 153/497 transitions.
[2025-06-07 18:40:04] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:40:04] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:40:04] [INFO ] Input system was already deterministic with 153 transitions.
[2025-06-07 18:40:04] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:40:04] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:40:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality8227513962262937991.gal : 2 ms
[2025-06-07 18:40:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality422335388704743361.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/CTLCardinality8227513962262937991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality422335388704743361.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,8.92617e+11,0.020231,4736,2,126,5,1436,6,0,451,732,0


Converting to forward existential form...Done !
original formula: AG(AF((p89==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p89==0)))] = FALSE
Hit Full ! (commute/partial/dont) 151/0/2
(forward)formula 0,0,0.054007,5248,1,0,8,7644,20,2,2231,3100,8
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Graph (trivial) has 320 edges and 339 vertex of which 50 / 339 are part of one of the 9 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 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 297 transition count 384
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 111 rules applied. Total rules applied 178 place count 231 transition count 339
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 200 place count 210 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 201 place count 209 transition count 338
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 201 place count 209 transition count 326
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 225 place count 197 transition count 326
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 250 place count 172 transition count 298
Iterating global reduction 4 with 25 rules applied. Total rules applied 275 place count 172 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 172 transition count 297
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 276 place count 172 transition count 292
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 286 place count 167 transition count 292
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 292 place count 161 transition count 260
Iterating global reduction 5 with 6 rules applied. Total rules applied 298 place count 161 transition count 260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 304 place count 161 transition count 254
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 456 place count 85 transition count 178
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 459 place count 82 transition count 162
Iterating global reduction 6 with 3 rules applied. Total rules applied 462 place count 82 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 465 place count 82 transition count 159
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 467 place count 80 transition count 157
Applied a total of 467 rules in 32 ms. Remains 80 /339 variables (removed 259) and now considering 157/497 (removed 340) transitions.
[2025-06-07 18:40:04] [INFO ] Flow matrix only has 81 transitions (discarded 76 similar events)
// Phase 1: matrix 81 rows 80 cols
[2025-06-07 18:40:04] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:40:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-07 18:40:04] [INFO ] Flow matrix only has 81 transitions (discarded 76 similar events)
[2025-06-07 18:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:40:04] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:40:04] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-07 18:40:04] [INFO ] Flow matrix only has 81 transitions (discarded 76 similar events)
[2025-06-07 18:40:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 80/160 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/160 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/161 variables, and 107 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2452 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 80/160 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 111/218 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/160 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/161 variables, and 218 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2636 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5100ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 5100ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/339 places, 157/497 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5269 ms. Remains : 80/339 places, 157/497 transitions.
[2025-06-07 18:40:09] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:40:09] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:40:09] [INFO ] Input system was already deterministic with 157 transitions.
[2025-06-07 18:40:09] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:40:09] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:40:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality10105661285945643956.gal : 1 ms
[2025-06-07 18:40:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality6282980560013123136.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/CTLCardinality10105661285945643956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6282980560013123136.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.25479e+12,0.02305,4824,2,144,5,1736,6,0,469,955,0


Converting to forward existential form...Done !
original formula: EF(AG(EF(((p201!=0)||((p21!=1)&&(p83!=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U ((p201!=0)||((p21!=1)&&(p83!=1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.054046,5080,1,0,7,6929,14,1,2144,1741,5
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Graph (trivial) has 312 edges and 339 vertex of which 48 / 339 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 299 transition count 391
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 108 rules applied. Total rules applied 171 place count 237 transition count 345
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 193 place count 216 transition count 344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 194 place count 215 transition count 344
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 194 place count 215 transition count 329
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 224 place count 200 transition count 329
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 245 place count 179 transition count 308
Iterating global reduction 4 with 21 rules applied. Total rules applied 266 place count 179 transition count 308
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 266 place count 179 transition count 304
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 274 place count 175 transition count 304
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 279 place count 170 transition count 279
Iterating global reduction 4 with 5 rules applied. Total rules applied 284 place count 170 transition count 279
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 289 place count 170 transition count 274
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 443 place count 93 transition count 197
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 446 place count 90 transition count 181
Iterating global reduction 5 with 3 rules applied. Total rules applied 449 place count 90 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 452 place count 90 transition count 178
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 454 place count 88 transition count 176
Applied a total of 454 rules in 36 ms. Remains 88 /339 variables (removed 251) and now considering 176/497 (removed 321) transitions.
[2025-06-07 18:40:09] [INFO ] Flow matrix only has 91 transitions (discarded 85 similar events)
// Phase 1: matrix 91 rows 88 cols
[2025-06-07 18:40:09] [INFO ] Computed 27 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:40:09] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-07 18:40:09] [INFO ] Flow matrix only has 91 transitions (discarded 85 similar events)
[2025-06-07 18:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:40:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2025-06-07 18:40:09] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:40:09] [INFO ] Redundant transitions in 2 ms returned []
Running 151 sub problems to find dead transitions.
[2025-06-07 18:40:09] [INFO ] Flow matrix only has 91 transitions (discarded 85 similar events)
[2025-06-07 18:40:09] [INFO ] Invariant cache hit.
[2025-06-07 18:40:09] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 3/88 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 90/178 variables, 88/115 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/179 variables, and 127 constraints, problems are : Problem set: 0 solved, 151 unsolved in 3774 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 88/88 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 3/88 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 90/178 variables, 88/115 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 151/278 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/178 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/179 variables, and 278 constraints, problems are : Problem set: 0 solved, 151 unsolved in 4257 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 88/88 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8056ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 8056ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/339 places, 176/497 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8327 ms. Remains : 88/339 places, 176/497 transitions.
[2025-06-07 18:40:17] [INFO ] Flatten gal took : 12 ms
[2025-06-07 18:40:17] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:40:17] [INFO ] Input system was already deterministic with 176 transitions.
[2025-06-07 18:40:17] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:40:17] [INFO ] Flatten gal took : 5 ms
[2025-06-07 18:40:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality9206760279833779188.gal : 1 ms
[2025-06-07 18:40:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality448395408330359174.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/CTLCardinality9206760279833779188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality448395408330359174.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3877e+13,0.025781,4916,2,209,5,2150,6,0,519,1147,0


Converting to forward existential form...Done !
original formula: EF((AG((EF((p168==0)) * (p63==0))) * !(A(((((p168!=0) * EF((p345==1))) + !(((p256==0)||(p420==1)))) + EF((p126==1))) U ((EG((p332==0)) + ...182
=> equivalent forward existential formula: ([((((FwdU((FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U (p168==0)) * (p63==0)))))),!(((EG((p332==0)) + (p241==0)) +...458
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 171/0/5
(forward)formula 0,1,0.263699,13876,1,0,39,53249,38,24,2649,50994,29
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 306 transition count 461
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 306 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 306 transition count 460
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 87 place count 286 transition count 428
Iterating global reduction 1 with 20 rules applied. Total rules applied 107 place count 286 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 111 place count 286 transition count 424
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 123 place count 274 transition count 396
Iterating global reduction 2 with 12 rules applied. Total rules applied 135 place count 274 transition count 396
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 140 place count 274 transition count 391
Applied a total of 140 rules in 21 ms. Remains 274 /339 variables (removed 65) and now considering 391/497 (removed 106) transitions.
// Phase 1: matrix 391 rows 274 cols
[2025-06-07 18:40:18] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:40:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-07 18:40:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:40:18] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2025-06-07 18:40:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (OVERLAPS) 391/665 variables, 274/301 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (OVERLAPS) 0/665 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 665/665 variables, and 301 constraints, problems are : Problem set: 0 solved, 390 unsolved in 25987 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (OVERLAPS) 391/665 variables, 274/301 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 390/691 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:40:54] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:01] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 1/693 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:04] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:05] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:06] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:06] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:07] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 5/698 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:14] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 699 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56030ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 56031ms
Starting structural reductions in LTL mode, iteration 1 : 274/339 places, 391/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56297 ms. Remains : 274/339 places, 391/497 transitions.
[2025-06-07 18:41:14] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:41:14] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:41:14] [INFO ] Input system was already deterministic with 391 transitions.
[2025-06-07 18:41:14] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:41:14] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:41:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1261277413486649924.gal : 3 ms
[2025-06-07 18:41:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality1727446422478069877.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/CTLCardinality1261277413486649924.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1727446422478069877.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,8.98536e+25,0.211443,11920,2,2019,5,40466,6,0,1489,31942,0


Converting to forward existential form...Done !
original formula: (EX(EF(AG(((p488==0)||(p179==1))))) * EF(((((p299==0)&&(p263==1))||((p409==0)&&(p177==1))) + (((p142==0)||(p383==1)) * EG((p152==0))))))
=> equivalent forward existential formula: ([(FwdU((Init * EX(E(TRUE U !(E(TRUE U !(((p488==0)||(p179==1)))))))),TRUE) * (((p299==0)&&(p263==1))||((p409==0...310
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t32, t37, t41, t46, t47, t51, t57, t61, t66, t70, t73, t78, t79, t83, t89,...470
Detected timeout of ITS tools.
[2025-06-07 18:41:44] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:41:44] [INFO ] Applying decomposition
[2025-06-07 18:41:44] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14706341217051043131.txt' '-o' '/tmp/graph14706341217051043131.bin' '-w' '/tmp/graph14706341217051043131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14706341217051043131.bin' '-l' '-1' '-v' '-w' '/tmp/graph14706341217051043131.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:41:44] [INFO ] Decomposing Gal with order
[2025-06-07 18:41:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:41:44] [INFO ] Removed a total of 293 redundant transitions.
[2025-06-07 18:41:44] [INFO ] Flatten gal took : 58 ms
[2025-06-07 18:41:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 13 ms.
[2025-06-07 18:41:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15156345614630493728.gal : 6 ms
[2025-06-07 18:41:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1989029502614343350.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/CTLCardinality15156345614630493728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1989029502614343350.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,8.98536e+25,0.114038,7776,715,25,6690,609,614,11156,66,1350,0


Converting to forward existential form...Done !
original formula: (EX(EF(AG(((i22.i1.u81.p488==0)||(i9.u26.p179==1))))) * EF(((((i12.u44.p299==0)&&(i14.u42.p263==1))||((i21.u68.p409==0)&&(i9.u25.p177==1)...228
=> equivalent forward existential formula: ([(FwdU((Init * EX(E(TRUE U !(E(TRUE U !(((i22.i1.u81.p488==0)||(i9.u26.p179==1)))))))),TRUE) * (((i12.u44.p299=...402
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t46, t78, t117, i0.t212, i0.i1.t217, i1.i1.t267, i2.t276, i3.u9.t257, i4.t247, i5.t2...773
(forward)formula 0,1,9.90686,300256,1,0,520707,844,4381,1.19882e+06,376,2044,768369
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Graph (trivial) has 318 edges and 339 vertex of which 50 / 339 are part of one of the 9 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 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 297 transition count 384
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 109 rules applied. Total rules applied 176 place count 231 transition count 341
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 197 place count 211 transition count 340
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 200 place count 210 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 209 transition count 338
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 201 place count 209 transition count 326
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 225 place count 197 transition count 326
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 250 place count 172 transition count 298
Iterating global reduction 5 with 25 rules applied. Total rules applied 275 place count 172 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 276 place count 172 transition count 297
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 276 place count 172 transition count 292
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 286 place count 167 transition count 292
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 292 place count 161 transition count 260
Iterating global reduction 6 with 6 rules applied. Total rules applied 298 place count 161 transition count 260
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 304 place count 161 transition count 254
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 7 with 152 rules applied. Total rules applied 456 place count 85 transition count 178
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 459 place count 82 transition count 162
Iterating global reduction 7 with 3 rules applied. Total rules applied 462 place count 82 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 465 place count 82 transition count 159
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 467 place count 80 transition count 157
Applied a total of 467 rules in 34 ms. Remains 80 /339 variables (removed 259) and now considering 157/497 (removed 340) transitions.
[2025-06-07 18:41:54] [INFO ] Flow matrix only has 82 transitions (discarded 75 similar events)
// Phase 1: matrix 82 rows 80 cols
[2025-06-07 18:41:54] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:54] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-07 18:41:54] [INFO ] Flow matrix only has 82 transitions (discarded 75 similar events)
[2025-06-07 18:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:41:55] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:41:55] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-07 18:41:55] [INFO ] Flow matrix only has 82 transitions (discarded 75 similar events)
[2025-06-07 18:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 3/80 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 81/161 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:56] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/162 variables, and 108 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2844 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 3/80 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 81/161 variables, 80/107 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 102/209 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:41:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/162 variables, and 211 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6033ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6034ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/339 places, 157/497 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6253 ms. Remains : 80/339 places, 157/497 transitions.
[2025-06-07 18:42:01] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:42:01] [INFO ] Flatten gal took : 4 ms
[2025-06-07 18:42:01] [INFO ] Input system was already deterministic with 157 transitions.
[2025-06-07 18:42:01] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:42:01] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:42:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality1214268619181742539.gal : 1 ms
[2025-06-07 18:42:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality4819538325649871930.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/CTLCardinality1214268619181742539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4819538325649871930.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,2.31419e+12,0.024778,4824,2,165,5,2923,6,0,470,2005,0


Converting to forward existential form...Done !
original formula: E(!(((!((p436==0)||(p25==1)))||(p184==1))) U (p236==1))
=> equivalent forward existential formula: [(FwdU(Init,!(((!((p436==0)||(p25==1)))||(p184==1)))) * (p236==1))] != FALSE
Hit Full ! (commute/partial/dont) 151/3/6
(forward)formula 0,1,0.035851,5080,1,0,10,5034,16,1,899,2878,4
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 304 transition count 459
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 304 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 304 transition count 458
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 93 place count 282 transition count 416
Iterating global reduction 1 with 22 rules applied. Total rules applied 115 place count 282 transition count 416
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 121 place count 282 transition count 410
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 132 place count 271 transition count 386
Iterating global reduction 2 with 11 rules applied. Total rules applied 143 place count 271 transition count 386
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 148 place count 271 transition count 381
Applied a total of 148 rules in 11 ms. Remains 271 /339 variables (removed 68) and now considering 381/497 (removed 116) transitions.
// Phase 1: matrix 381 rows 271 cols
[2025-06-07 18:42:01] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:42:01] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-06-07 18:42:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:42:01] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2025-06-07 18:42:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 381/652 variables, 271/298 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/652 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (OVERLAPS) 0/652 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 380 unsolved
No progress, stopping.
After SMT solving in domain Real declared 652/652 variables, and 298 constraints, problems are : Problem set: 0 solved, 380 unsolved in 25337 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (OVERLAPS) 381/652 variables, 271/298 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/652 variables, 380/678 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:36] [INFO ] Deduced a trap along path composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/652 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:42] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:43] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/652 variables, 2/681 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:46] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:46] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:48] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:48] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/652 variables, 4/685 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:52] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:52] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:52] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:53] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:42:53] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 652/652 variables, and 690 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55383ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 55384ms
Starting structural reductions in LTL mode, iteration 1 : 271/339 places, 381/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55801 ms. Remains : 271/339 places, 381/497 transitions.
[2025-06-07 18:42:57] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:42:57] [INFO ] Flatten gal took : 10 ms
[2025-06-07 18:42:57] [INFO ] Input system was already deterministic with 381 transitions.
[2025-06-07 18:42:57] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:42:57] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:42:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality12302943930861800446.gal : 2 ms
[2025-06-07 18:42:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality9688794680971193153.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/CTLCardinality12302943930861800446.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9688794680971193153.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.01669e+25,0.20271,11116,2,1939,5,36887,6,0,1467,28282,0


Converting to forward existential form...Done !
original formula: EF((EG(AX(EG((p83==1)))) * (EF((EF(((p291==0)||(p62==1))) + AX((p189==1)))) + (p434==0))))
=> equivalent forward existential formula: (([(FwdU(FwdU((FwdU(Init,TRUE) * EG(!(EX(!(EG((p83==1))))))),TRUE),TRUE) * ((p291==0)||(p62==1)))] != FALSE + [(...321
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t58, t65, t69, t74, t75, t79, t85, t89, t95,...453
Using saturation style SCC detection
(forward)formula 0,1,6.68357,224248,1,0,1077,1.24113e+06,792,489,9693,1.4801e+06,1319
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 303 transition count 458
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 303 transition count 458
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 303 transition count 457
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 95 place count 281 transition count 415
Iterating global reduction 1 with 22 rules applied. Total rules applied 117 place count 281 transition count 415
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 122 place count 281 transition count 410
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 135 place count 268 transition count 378
Iterating global reduction 2 with 13 rules applied. Total rules applied 148 place count 268 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 268 transition count 372
Applied a total of 154 rules in 20 ms. Remains 268 /339 variables (removed 71) and now considering 372/497 (removed 125) transitions.
// Phase 1: matrix 372 rows 268 cols
[2025-06-07 18:43:03] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:43:03] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-07 18:43:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:43:04] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-07 18:43:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (OVERLAPS) 372/640 variables, 268/295 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 295 constraints, problems are : Problem set: 0 solved, 371 unsolved in 23451 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (OVERLAPS) 372/640 variables, 268/295 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 371/666 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:37] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:37] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:43] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:43] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 2/670 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:49] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:54] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:54] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:55] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:43:55] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/640 variables, and 675 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 53488ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 53488ms
Starting structural reductions in LTL mode, iteration 1 : 268/339 places, 372/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53795 ms. Remains : 268/339 places, 372/497 transitions.
[2025-06-07 18:43:57] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:43:57] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:43:57] [INFO ] Input system was already deterministic with 372 transitions.
[2025-06-07 18:43:57] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:43:57] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:43:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality5181600855237609312.gal : 2 ms
[2025-06-07 18:43:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality17489135862411061416.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/CTLCardinality5181600855237609312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17489135862411061416.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.09935e+25,0.17713,10464,2,1822,5,34501,6,0,1446,24326,0


Converting to forward existential form...Done !
original formula: AG((AG((p128==0)) + AX(E(((p402==0)||(p174==1)) U (p394!=1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !(!(E(TRUE U !((p128==0))))))) * !(E(((p402==0)||(p174==1)) U (p394!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t77, t79, t85, t89,...440
(forward)formula 0,0,12.5755,370520,1,0,797,1.95749e+06,771,416,9110,2.142e+06,993
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Graph (trivial) has 313 edges and 339 vertex of which 50 / 339 are part of one of the 9 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 297 transition count 390
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 101 rules applied. Total rules applied 162 place count 237 transition count 349
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 21 rules applied. Total rules applied 183 place count 218 transition count 347
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 187 place count 216 transition count 345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 188 place count 215 transition count 345
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 188 place count 215 transition count 330
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 218 place count 200 transition count 330
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 242 place count 176 transition count 303
Iterating global reduction 5 with 24 rules applied. Total rules applied 266 place count 176 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 267 place count 176 transition count 302
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 267 place count 176 transition count 297
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 277 place count 171 transition count 297
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 283 place count 165 transition count 265
Iterating global reduction 6 with 6 rules applied. Total rules applied 289 place count 165 transition count 265
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 295 place count 165 transition count 259
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 7 with 148 rules applied. Total rules applied 443 place count 91 transition count 185
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 446 place count 88 transition count 169
Iterating global reduction 7 with 3 rules applied. Total rules applied 449 place count 88 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 452 place count 88 transition count 166
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 454 place count 86 transition count 164
Applied a total of 454 rules in 41 ms. Remains 86 /339 variables (removed 253) and now considering 164/497 (removed 333) transitions.
[2025-06-07 18:44:10] [INFO ] Flow matrix only has 107 transitions (discarded 57 similar events)
// Phase 1: matrix 107 rows 86 cols
[2025-06-07 18:44:10] [INFO ] Computed 27 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:44:10] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-07 18:44:10] [INFO ] Flow matrix only has 107 transitions (discarded 57 similar events)
[2025-06-07 18:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:44:10] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:44:10] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2025-06-07 18:44:10] [INFO ] Flow matrix only has 107 transitions (discarded 57 similar events)
[2025-06-07 18:44:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/86 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 106/192 variables, 86/113 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/193 variables, and 113 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2589 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/86 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 106/192 variables, 86/113 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 108/221 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/193 variables, and 221 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5414ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5414ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/339 places, 164/497 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5589 ms. Remains : 86/339 places, 164/497 transitions.
[2025-06-07 18:44:15] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:44:15] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:44:15] [INFO ] Input system was already deterministic with 164 transitions.
[2025-06-07 18:44:15] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:44:15] [INFO ] Flatten gal took : 3 ms
[2025-06-07 18:44:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8346259061155162517.gal : 1 ms
[2025-06-07 18:44:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality6340362601075470437.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/CTLCardinality8346259061155162517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6340362601075470437.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.58687e+13,0.024742,4816,2,146,5,2475,6,0,502,1413,0


Converting to forward existential form...Done !
original formula: AG(A((EF(((p456==1)&&(p175==1))) * ((p130==0)||(p17==1))) U ((p57==0)||(p375==1))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(((p57==0)||(p375==1)))) * !(((p57==0)||(p375==1)))) * !(E(TRUE U ((p456==1)&&(p175==...348
Hit Full ! (commute/partial/dont) 160/4/4
(forward)formula 0,0,0.065282,5712,1,0,8,9601,20,2,2567,3702,8
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 308 transition count 463
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 308 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 308 transition count 462
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 82 place count 289 transition count 423
Iterating global reduction 1 with 19 rules applied. Total rules applied 101 place count 289 transition count 423
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 107 place count 289 transition count 417
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 116 place count 280 transition count 399
Iterating global reduction 2 with 9 rules applied. Total rules applied 125 place count 280 transition count 399
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 129 place count 280 transition count 395
Applied a total of 129 rules in 15 ms. Remains 280 /339 variables (removed 59) and now considering 395/497 (removed 102) transitions.
// Phase 1: matrix 395 rows 280 cols
[2025-06-07 18:44:16] [INFO ] Computed 27 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:44:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-07 18:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:44:16] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2025-06-07 18:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 395/675 variables, 280/307 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (OVERLAPS) 0/675 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 675/675 variables, and 307 constraints, problems are : Problem set: 0 solved, 394 unsolved in 26297 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/280 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 395/675 variables, 280/307 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 394/701 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:49] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:50] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:50] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:50] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:50] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:50] [INFO ] Deduced a trap composed of 25 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:44:51] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:51] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 8/709 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:54] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:54] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:44:56] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 3/712 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:00] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:01] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:06] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:08] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/675 variables, and 716 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56340ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 56341ms
Starting structural reductions in LTL mode, iteration 1 : 280/339 places, 395/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56617 ms. Remains : 280/339 places, 395/497 transitions.
[2025-06-07 18:45:12] [INFO ] Flatten gal took : 7 ms
[2025-06-07 18:45:12] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:45:12] [INFO ] Input system was already deterministic with 395 transitions.
[2025-06-07 18:45:12] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:45:12] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:45:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8811687613614493397.gal : 2 ms
[2025-06-07 18:45:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality12299042322307887744.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/CTLCardinality8811687613614493397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12299042322307887744.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.56134e+26,0.321873,15772,2,2688,5,58713,6,0,1517,53025,0


Converting to forward existential form...Done !
original formula: EF(EX((AX(((p285==0)&&(p413==1))) * ((E((p26==1) U (p27==1)) + (p83==1)) + (EX(((p205==0)||(p432==1))) + EX((p530==1)))))))
=> equivalent forward existential formula: (([(FwdU((EY(FwdU(Init,TRUE)) * !(EX(!(((p285==0)&&(p413==1)))))),(p26==1)) * (p27==1))] != FALSE + [((EY(FwdU(I...416
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t28, t29, t33, t38, t42, t47, t48, t52, t58, t63, t70, t75, t82, t83, t87, t93, t97, ...489
Hit Full ! (commute/partial/dont) 393/0/2
(forward)formula 0,1,3.26452,107676,1,0,667,612427,817,345,9310,470980,805
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 301 transition count 456
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 301 transition count 456
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 301 transition count 455
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 100 place count 278 transition count 412
Iterating global reduction 1 with 23 rules applied. Total rules applied 123 place count 278 transition count 412
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 129 place count 278 transition count 406
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 142 place count 265 transition count 374
Iterating global reduction 2 with 13 rules applied. Total rules applied 155 place count 265 transition count 374
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 160 place count 265 transition count 369
Applied a total of 160 rules in 13 ms. Remains 265 /339 variables (removed 74) and now considering 369/497 (removed 128) transitions.
// Phase 1: matrix 369 rows 265 cols
[2025-06-07 18:45:15] [INFO ] Computed 27 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:45:16] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-07 18:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:45:16] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2025-06-07 18:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 369/634 variables, 265/292 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 0/634 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 634/634 variables, and 292 constraints, problems are : Problem set: 0 solved, 368 unsolved in 23062 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 369/634 variables, 265/292 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/634 variables, 368/660 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:45:48] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/634 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/634 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:03] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:04] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:46:06] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 6 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/634 variables, 3/664 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 634/634 variables, and 664 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53100ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 53101ms
Starting structural reductions in LTL mode, iteration 1 : 265/339 places, 369/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53361 ms. Remains : 265/339 places, 369/497 transitions.
[2025-06-07 18:46:09] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:46:09] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:46:09] [INFO ] Input system was already deterministic with 369 transitions.
[2025-06-07 18:46:09] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:46:09] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:46:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9673118565644925756.gal : 4 ms
[2025-06-07 18:46:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality7766697881967387923.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/CTLCardinality9673118565644925756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7766697881967387923.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EX(AF((p105==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((p105==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...435
Detected timeout of ITS tools.
[2025-06-07 18:46:39] [INFO ] Flatten gal took : 13 ms
[2025-06-07 18:46:39] [INFO ] Applying decomposition
[2025-06-07 18:46:39] [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/graph11389658426511473956.txt' '-o' '/tmp/graph11389658426511473956.bin' '-w' '/tmp/graph11389658426511473956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11389658426511473956.bin' '-l' '-1' '-v' '-w' '/tmp/graph11389658426511473956.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:46:39] [INFO ] Decomposing Gal with order
[2025-06-07 18:46:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:46:39] [INFO ] Removed a total of 255 redundant transitions.
[2025-06-07 18:46:39] [INFO ] Flatten gal took : 18 ms
[2025-06-07 18:46:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-07 18:46:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality18052708484665774381.gal : 3 ms
[2025-06-07 18:46:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality12785137668742725447.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/CTLCardinality18052708484665774381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12785137668742725447.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.7994e+25,0.299211,16840,2860,25,22834,580,523,47375,65,1145,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((i5.u13.p105==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((i5.u13.p105==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t44, t73, t112, t151, i0.i1.u10.t238, i1.u4.t267, i2.t258, i3.t248, i4.t228, i5.t215...676
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 339/339 places, 497/497 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 303 transition count 458
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 303 transition count 458
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 303 transition count 457
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 95 place count 281 transition count 415
Iterating global reduction 1 with 22 rules applied. Total rules applied 117 place count 281 transition count 415
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 123 place count 281 transition count 409
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 137 place count 267 transition count 376
Iterating global reduction 2 with 14 rules applied. Total rules applied 151 place count 267 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 157 place count 267 transition count 370
Applied a total of 157 rules in 14 ms. Remains 267 /339 variables (removed 72) and now considering 370/497 (removed 127) transitions.
// Phase 1: matrix 370 rows 267 cols
[2025-06-07 18:47:09] [INFO ] Computed 27 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:47:09] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-07 18:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:47:09] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2025-06-07 18:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/637 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (OVERLAPS) 0/637 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 294 constraints, problems are : Problem set: 0 solved, 369 unsolved in 23208 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (OVERLAPS) 370/637 variables, 267/294 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/637 variables, 369/663 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:42] [INFO ] Deduced a trap along path composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/637 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:47] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:48] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:48] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:48] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/637 variables, 4/668 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:52] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:52] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:53] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:53] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 4/672 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:47:57] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 1/673 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 637/637 variables, and 673 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 53247ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 53248ms
Starting structural reductions in LTL mode, iteration 1 : 267/339 places, 370/497 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53504 ms. Remains : 267/339 places, 370/497 transitions.
[2025-06-07 18:48:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:48:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:48:03] [INFO ] Input system was already deterministic with 370 transitions.
[2025-06-07 18:48:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:48:03] [INFO ] Flatten gal took : 6 ms
[2025-06-07 18:48:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality7578739642565222784.gal : 1 ms
[2025-06-07 18:48:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality6682448279033601044.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/CTLCardinality7578739642565222784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6682448279033601044.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF((AX(AX((p239==1))) + ((p335==1)&&(((p177==0)||(p376==1))||((p216==1)&&(((p359==0)||(p419==1))||(p237==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(!(EX(!((p239==1))))))))] != FALSE + [(FwdU(Init,TRUE) * ((p335==1)&&(((p177==0)||(p3...226
Reverse transition relation is NOT exact ! Due to transitions t6, t25, t26, t30, t35, t39, t44, t45, t49, t55, t59, t64, t68, t73, t74, t78, t84, t88, t94,...453
(forward)formula 0,1,1.98543,74432,1,0,613,441576,757,321,8568,317562,751
FORMULA Champagne-PT-H07T0R-CTLCardinality-2025-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-07 18:48:05] [INFO ] Flatten gal took : 9 ms
[2025-06-07 18:48:05] [INFO ] Flatten gal took : 8 ms
[2025-06-07 18:48:05] [INFO ] Applying decomposition
[2025-06-07 18:48:05] [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/graph18076393988506470104.txt' '-o' '/tmp/graph18076393988506470104.bin' '-w' '/tmp/graph18076393988506470104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18076393988506470104.bin' '-l' '-1' '-v' '-w' '/tmp/graph18076393988506470104.weights' '-q' '0' '-e' '0.001'
[2025-06-07 18:48:05] [INFO ] Decomposing Gal with order
[2025-06-07 18:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 18:48:05] [INFO ] Removed a total of 341 redundant transitions.
[2025-06-07 18:48:05] [INFO ] Flatten gal took : 19 ms
[2025-06-07 18:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2025-06-07 18:48:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality1922791473329328289.gal : 4 ms
[2025-06-07 18:48:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality18437978094941170285.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/CTLCardinality1922791473329328289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18437978094941170285.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.11108e+28,0.251408,14164,1271,36,19933,699,836,32423,69,1551,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((i6.u23.p105==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((i6.u23.p105==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t28, t49, t91, t197, t255, i0.t259, i0.u26.t261, i1.i0.t334, i1.i1.u7.t329, i2.u8.t318, i...1034
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Detected timeout of ITS tools.
[2025-06-07 19:11:11] [INFO ] Applying decomposition
[2025-06-07 19:11:11] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:11:11] [INFO ] Decomposing Gal with order
[2025-06-07 19:11:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:11:11] [INFO ] Removed a total of 235 redundant transitions.
[2025-06-07 19:11:11] [INFO ] Flatten gal took : 16 ms
[2025-06-07 19:11:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 8 ms.
[2025-06-07 19:11:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality4997905142697973375.gal : 3 ms
[2025-06-07 19:11:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality2922562560421951600.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/CTLCardinality4997905142697973375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2922562560421951600.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,3.11108e+28,0.205255,13224,717,481,16001,2527,559,41759,229,20918,0


Converting to forward existential form...Done !
original formula: AF(EX(AF((i0.i0.u12.p105==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!((i0.i0.u12.p105==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t255, i0.u13.t259, i0.u13.t261, i0.i0.u12.t273, i0.i0.i0.u11.t282, i0.i0.i0.u11.t286, i0.i...1857
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Detected timeout of ITS tools.
[2025-06-07 19:34:17] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:34:17] [INFO ] Input system was already deterministic with 497 transitions.
[2025-06-07 19:34:17] [INFO ] Transformed 339 places.
[2025-06-07 19:34:17] [INFO ] Transformed 497 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-07 19:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8200884847038065504.gal : 4 ms
[2025-06-07 19:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5254252573477494890.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/CTLCardinality8200884847038065504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5254252573477494890.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-H07T0R"
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-H07T0R, 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-174931339200073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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