Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 174K May 29 14:32 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 CO4-PT-14-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-14-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748607258668

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 12:14:19] [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-05-30 12:14:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:14:20] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2025-05-30 12:14:20] [INFO ] Transformed 680 places.
[2025-05-30 12:14:20] [INFO ] Transformed 812 transitions.
[2025-05-30 12:14:20] [INFO ] Found NUPN structural information;
[2025-05-30 12:14:20] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 120 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-14-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 71 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 569 transition count 691
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 117 place count 464 transition count 585
Iterating global reduction 1 with 105 rules applied. Total rules applied 222 place count 464 transition count 585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 226 place count 464 transition count 581
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 275 place count 415 transition count 532
Iterating global reduction 2 with 49 rules applied. Total rules applied 324 place count 415 transition count 532
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 332 place count 407 transition count 522
Iterating global reduction 2 with 8 rules applied. Total rules applied 340 place count 407 transition count 522
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 342 place count 407 transition count 520
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 344 place count 405 transition count 518
Iterating global reduction 3 with 2 rules applied. Total rules applied 346 place count 405 transition count 518
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 348 place count 403 transition count 516
Iterating global reduction 3 with 2 rules applied. Total rules applied 350 place count 403 transition count 516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 352 place count 403 transition count 514
Applied a total of 352 rules in 135 ms. Remains 403 /580 variables (removed 177) and now considering 514/692 (removed 178) transitions.
// Phase 1: matrix 514 rows 403 cols
[2025-05-30 12:14:20] [INFO ] Computed 5 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:14:20] [INFO ] Implicit Places using invariants in 281 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/580 places, 514/692 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 514/514 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 468 ms. Remains : 402/580 places, 514/692 transitions.
Support contains 71 out of 402 places after structural reductions.
[2025-05-30 12:14:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 12:14:20] [INFO ] Flatten gal took : 51 ms
[2025-05-30 12:14:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CO4-PT-14-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:14:20] [INFO ] Flatten gal took : 24 ms
[2025-05-30 12:14:20] [INFO ] Input system was already deterministic with 514 transitions.
Support contains 48 out of 402 places (down from 71) after GAL structural reductions.
RANDOM walk for 40000 steps (59 resets) in 1568 ms. (25 steps per ms) remains 22/27 properties
BEST_FIRST walk for 4003 steps (21 resets) in 103 ms. (38 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (25 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (24 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (19 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (19 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (21 resets) in 16 ms. (235 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (17 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (20 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (22 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (19 resets) in 22 ms. (174 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (22 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (24 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
// Phase 1: matrix 514 rows 402 cols
[2025-05-30 12:14:21] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 59/87 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 211/298 variables, 52/80 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 10/308 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 17/325 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 364/689 variables, 180/265 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 194/883 variables, 118/383 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/883 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 31/914 variables, 22/405 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/914 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 2/916 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/916 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 0/916 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 916/916 variables, and 406 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2977 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 59/87 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 211/298 variables, 52/81 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 10/308 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 17/325 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/325 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 364/689 variables, 180/284 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/689 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 194/883 variables, 118/402 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/883 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 31/914 variables, 22/424 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/914 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 2/916 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/916 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/916 variables, and 425 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8037ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 514/514 transitions.
Graph (trivial) has 384 edges and 402 vertex of which 2 / 402 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 662 edges and 401 vertex of which 385 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 385 transition count 358
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 138 rules applied. Total rules applied 281 place count 256 transition count 349
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 289 place count 248 transition count 349
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 289 place count 248 transition count 317
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 353 place count 216 transition count 317
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 360 place count 209 transition count 310
Iterating global reduction 3 with 7 rules applied. Total rules applied 367 place count 209 transition count 310
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 367 place count 209 transition count 306
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 375 place count 205 transition count 306
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 378 place count 202 transition count 303
Iterating global reduction 3 with 3 rules applied. Total rules applied 381 place count 202 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 382 place count 202 transition count 302
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 383 place count 201 transition count 301
Iterating global reduction 4 with 1 rules applied. Total rules applied 384 place count 201 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 201 transition count 300
Performed 54 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 5 with 108 rules applied. Total rules applied 493 place count 147 transition count 235
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 496 place count 147 transition count 232
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 498 place count 145 transition count 230
Iterating global reduction 6 with 2 rules applied. Total rules applied 500 place count 145 transition count 230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 560 place count 115 transition count 235
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 572 place count 115 transition count 223
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 591 place count 96 transition count 185
Iterating global reduction 7 with 19 rules applied. Total rules applied 610 place count 96 transition count 185
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 618 place count 96 transition count 177
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 620 place count 94 transition count 171
Iterating global reduction 8 with 2 rules applied. Total rules applied 622 place count 94 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 631 place count 94 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 631 place count 94 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 633 place count 93 transition count 161
Free-agglomeration rule applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 645 place count 93 transition count 149
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 658 place count 81 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 660 place count 81 transition count 146
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 667 place count 81 transition count 146
Graph (complete) has 220 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 668 place count 80 transition count 146
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 669 place count 80 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 670 place count 80 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 671 place count 80 transition count 144
Graph (complete) has 216 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 672 place count 79 transition count 144
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 673 place count 79 transition count 143
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 674 place count 79 transition count 143
Graph (complete) has 213 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 675 place count 78 transition count 143
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 676 place count 78 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 677 place count 77 transition count 141
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t51.t446 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 15 with 3 rules applied. Total rules applied 680 place count 73 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 681 place count 72 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 683 place count 71 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 17 with 11 rules applied. Total rules applied 694 place count 71 transition count 126
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 696 place count 69 transition count 124
Iterating global reduction 17 with 2 rules applied. Total rules applied 698 place count 69 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 700 place count 69 transition count 122
Free-agglomeration rule applied 11 times.
Iterating global reduction 18 with 11 rules applied. Total rules applied 711 place count 69 transition count 111
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 724 place count 58 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 19 with 7 rules applied. Total rules applied 731 place count 58 transition count 102
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 732 place count 57 transition count 101
Iterating global reduction 19 with 1 rules applied. Total rules applied 733 place count 57 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 734 place count 57 transition count 100
Free-agglomeration rule applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 737 place count 57 transition count 97
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 742 place count 54 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 743 place count 54 transition count 94
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 746 place count 54 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 747 place count 54 transition count 93
Applied a total of 747 rules in 142 ms. Remains 54 /402 variables (removed 348) and now considering 93/514 (removed 421) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 54/402 places, 93/514 transitions.
RANDOM walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2025-05-30 12:14:30] [INFO ] Flow matrix only has 88 transitions (discarded 5 similar events)
// Phase 1: matrix 88 rows 54 cols
[2025-05-30 12:14:30] [INFO ] Computed 2 invariants in 0 ms
[2025-05-30 12:14:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/100 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/127 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/131 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/142 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/100 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/127 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/131 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/142 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/142 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 215 steps, including 33 resets, run visited all 1 properties in 2 ms. (steps per millisecond=107 )
Parikh walk visited 1 properties in 6 ms.
[2025-05-30 12:14:30] [INFO ] Flatten gal took : 19 ms
[2025-05-30 12:14:30] [INFO ] Flatten gal took : 20 ms
[2025-05-30 12:14:30] [INFO ] Input system was already deterministic with 514 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 664 edges and 402 vertex of which 397 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 373 transition count 484
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 373 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 373 transition count 483
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 362 transition count 471
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 362 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 362 transition count 470
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 358 transition count 466
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 358 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 358 transition count 465
Applied a total of 91 rules in 44 ms. Remains 358 /402 variables (removed 44) and now considering 465/514 (removed 49) transitions.
// Phase 1: matrix 465 rows 358 cols
[2025-05-30 12:14:30] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:14:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-30 12:14:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:14:30] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-05-30 12:14:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/823 variables, 358/362 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:14:47] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:14:47] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 364 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 465/823 variables, 358/364 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 464/828 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:15:21] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 829 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 358/402 places, 465/514 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60470 ms. Remains : 358/402 places, 465/514 transitions.
[2025-05-30 12:15:30] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:15:30] [INFO ] Flatten gal took : 16 ms
[2025-05-30 12:15:30] [INFO ] Input system was already deterministic with 465 transitions.
[2025-05-30 12:15:30] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:15:30] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:15:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7415612826678876228.gal : 8 ms
[2025-05-30 12:15:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality12587081312107600067.ctl : 6 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/CTLCardinality7415612826678876228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12587081312107600067.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.68154e+08,0.384973,17492,2,3242,5,43202,6,0,1894,62153,0


Converting to forward existential form...Done !
original formula: A(((p277==0)||(p191==1)) U (((p141==1) * AX((p409==1))) * (EX((p629!=1)) + !(EG(((p265==0)||(p555==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!((((p141==1) * !(EX(!((p409==1))))) * (EX((p629!=1)) + !(EG(((p265==0)||(p555==1)))))))))) * !(E...378
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t32, t33, t35, t36, t40, t41, t44, t129, t160, t187, t194, ...393
Detected timeout of ITS tools.
[2025-05-30 12:16:01] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:16:01] [INFO ] Applying decomposition
[2025-05-30 12:16:01] [INFO ] Flatten gal took : 14 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/graph3904695450102570811.txt' '-o' '/tmp/graph3904695450102570811.bin' '-w' '/tmp/graph3904695450102570811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3904695450102570811.bin' '-l' '-1' '-v' '-w' '/tmp/graph3904695450102570811.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:16:01] [INFO ] Decomposing Gal with order
[2025-05-30 12:16:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:16:01] [INFO ] Removed a total of 157 redundant transitions.
[2025-05-30 12:16:01] [INFO ] Flatten gal took : 79 ms
[2025-05-30 12:16:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 13 ms.
[2025-05-30 12:16:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality15149426579274072670.gal : 7 ms
[2025-05-30 12:16:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality8505435551469787299.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/CTLCardinality15149426579274072670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8505435551469787299.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.68154e+08,0.156064,8120,402,90,6412,1047,860,10242,101,3550,0


Converting to forward existential form...Done !
original formula: A(((i7.u118.p277==0)||(i1.u23.p191==1)) U (((i3.u15.p141==1) * AX((i11.u76.p409==1))) * (EX((i18.u121.p629!=1)) + !(EG(((i4.i1.i1.u40.p26...185
=> equivalent forward existential formula: [((Init * !(EG(!((((i3.u15.p141==1) * !(EX(!((i11.u76.p409==1))))) * (EX((i18.u121.p629!=1)) + !(EG(((i4.i1.i1.u...528
Reverse transition relation is NOT exact ! Due to transitions t44, t188, t201, t223, t235, t248, t317, t377, t416, i1.u21.t358, i2.t307, i3.t374, i3.u7.t38...629
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
(forward)formula 0,0,9.8764,310712,1,0,432526,3921,5781,1.88738e+06,545,16194,482683
FORMULA CO4-PT-14-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Graph (trivial) has 421 edges and 402 vertex of which 2 / 402 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 663 edges and 401 vertex of which 396 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 395 transition count 357
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 152 rules applied. Total rules applied 303 place count 246 transition count 354
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 306 place count 245 transition count 352
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 311 place count 244 transition count 348
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 315 place count 240 transition count 348
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 315 place count 240 transition count 313
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 385 place count 205 transition count 313
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 396 place count 194 transition count 300
Iterating global reduction 5 with 11 rules applied. Total rules applied 407 place count 194 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 408 place count 194 transition count 299
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 408 place count 194 transition count 293
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 420 place count 188 transition count 293
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 425 place count 183 transition count 288
Iterating global reduction 6 with 5 rules applied. Total rules applied 430 place count 183 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 433 place count 183 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 434 place count 182 transition count 285
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 464 place count 167 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 467 place count 167 transition count 267
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 469 place count 166 transition count 266
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 471 place count 164 transition count 264
Iterating global reduction 10 with 2 rules applied. Total rules applied 473 place count 164 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 477 place count 162 transition count 262
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 478 place count 161 transition count 261
Iterating global reduction 10 with 1 rules applied. Total rules applied 479 place count 161 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 490 place count 161 transition count 250
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 7 rules applied. Total rules applied 497 place count 161 transition count 243
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 504 place count 154 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 506 place count 153 transition count 242
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 507 place count 153 transition count 242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 509 place count 151 transition count 240
Applied a total of 509 rules in 78 ms. Remains 151 /402 variables (removed 251) and now considering 240/514 (removed 274) transitions.
// Phase 1: matrix 240 rows 151 cols
[2025-05-30 12:16:11] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:11] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-30 12:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:16:11] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:16:11] [INFO ] Redundant transitions in 11 ms returned []
Running 227 sub problems to find dead transitions.
[2025-05-30 12:16:11] [INFO ] Invariant cache hit.
[2025-05-30 12:16:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 239/390 variables, 151/155 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 1/391 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 0/391 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 156 constraints, problems are : Problem set: 0 solved, 227 unsolved in 13255 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 239/390 variables, 151/155 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 227/382 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 1/391 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 383 constraints, problems are : Problem set: 0 solved, 227 unsolved in 28527 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41810ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 41816ms
Starting structural reductions in SI_CTL mode, iteration 1 : 151/402 places, 240/514 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42078 ms. Remains : 151/402 places, 240/514 transitions.
[2025-05-30 12:16:53] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:16:53] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:16:53] [INFO ] Input system was already deterministic with 240 transitions.
[2025-05-30 12:16:53] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:16:53] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:16:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality4816533498612840568.gal : 1 ms
[2025-05-30 12:16:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1179423744927275360.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/CTLCardinality4816533498612840568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1179423744927275360.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.45722e+06,0.062276,6232,2,760,5,8200,6,0,836,6460,0


Converting to forward existential form...Done !
original formula: EG(A(((EG((p355==0)) * !((((p470==0)||(p445==1))&&(p571==0)))) * (p465!=1)) U (p349!=1)))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((p349!=1)) U (!(((EG((p355==0)) * !((((p470==0)||(p445==1))&&(p571==0)))) * (p465!=1))) * !((p...197
Reverse transition relation is NOT exact ! Due to transitions t4, t38, t72, t80, t85, t123, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,1,3.17654,109660,1,0,595,597956,514,367,4911,611338,915
FORMULA CO4-PT-14-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Graph (trivial) has 427 edges and 402 vertex of which 2 / 402 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 663 edges and 401 vertex of which 396 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 395 transition count 353
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 156 rules applied. Total rules applied 311 place count 242 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 314 place count 241 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 240 transition count 348
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 315 place count 240 transition count 313
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 385 place count 205 transition count 313
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 398 place count 192 transition count 298
Iterating global reduction 4 with 13 rules applied. Total rules applied 411 place count 192 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 412 place count 192 transition count 297
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 412 place count 192 transition count 291
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 424 place count 186 transition count 291
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 430 place count 180 transition count 285
Iterating global reduction 5 with 6 rules applied. Total rules applied 436 place count 180 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 439 place count 180 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 440 place count 179 transition count 282
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 472 place count 163 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 475 place count 163 transition count 263
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 477 place count 162 transition count 262
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 480 place count 159 transition count 259
Iterating global reduction 9 with 3 rules applied. Total rules applied 483 place count 159 transition count 259
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 487 place count 157 transition count 257
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 488 place count 156 transition count 256
Iterating global reduction 9 with 1 rules applied. Total rules applied 489 place count 156 transition count 256
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 490 place count 155 transition count 254
Iterating global reduction 9 with 1 rules applied. Total rules applied 491 place count 155 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 492 place count 155 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 503 place count 155 transition count 242
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 7 rules applied. Total rules applied 510 place count 155 transition count 235
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 517 place count 148 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 519 place count 147 transition count 234
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 521 place count 145 transition count 232
Applied a total of 521 rules in 54 ms. Remains 145 /402 variables (removed 257) and now considering 232/514 (removed 282) transitions.
// Phase 1: matrix 232 rows 145 cols
[2025-05-30 12:16:56] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-30 12:16:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:16:56] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:16:56] [INFO ] Redundant transitions in 8 ms returned []
Running 219 sub problems to find dead transitions.
[2025-05-30 12:16:56] [INFO ] Invariant cache hit.
[2025-05-30 12:16:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 231/376 variables, 145/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/377 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 150 constraints, problems are : Problem set: 0 solved, 219 unsolved in 11958 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 145/145 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 231/376 variables, 145/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 219/368 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 1/377 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 369 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21100 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 145/145 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33078ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 33078ms
Starting structural reductions in SI_CTL mode, iteration 1 : 145/402 places, 232/514 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33304 ms. Remains : 145/402 places, 232/514 transitions.
[2025-05-30 12:17:29] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:17:29] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:17:30] [INFO ] Input system was already deterministic with 232 transitions.
[2025-05-30 12:17:30] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:17:30] [INFO ] Flatten gal took : 28 ms
[2025-05-30 12:17:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality6542919230442904992.gal : 1 ms
[2025-05-30 12:17:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality14702449391519944347.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/CTLCardinality6542919230442904992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14702449391519944347.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.28096e+06,0.119056,5988,2,721,5,7851,6,0,804,6436,0


Converting to forward existential form...Done !
original formula: AG((EG((p145!=1)) + AG((p564==0))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EG((p145!=1)))),TRUE) * !((p564==0)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t41, t72, t81, t86, t120, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,0,2.45426,79528,1,0,433,452783,488,232,4975,403827,676
FORMULA CO4-PT-14-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 372 transition count 483
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 372 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 372 transition count 482
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 361 transition count 471
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 361 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 361 transition count 470
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 357 transition count 466
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 357 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 357 transition count 465
Applied a total of 93 rules in 20 ms. Remains 357 /402 variables (removed 45) and now considering 465/514 (removed 49) transitions.
// Phase 1: matrix 465 rows 357 cols
[2025-05-30 12:17:32] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:17:32] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 12:17:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:17:32] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2025-05-30 12:17:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/822 variables, 357/361 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:17:50] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:17:50] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 822/822 variables, and 363 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 465/822 variables, 357/363 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 464/827 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/822 variables, and 827 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 357/402 places, 465/514 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60511 ms. Remains : 357/402 places, 465/514 transitions.
[2025-05-30 12:18:33] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:18:33] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:18:33] [INFO ] Input system was already deterministic with 465 transitions.
[2025-05-30 12:18:33] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:18:33] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:18:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality1496115632264662363.gal : 2 ms
[2025-05-30 12:18:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2620700838599072287.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/CTLCardinality1496115632264662363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2620700838599072287.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.7767e+08,0.319751,16144,2,3245,5,40734,6,0,1890,52226,0


Converting to forward existential form...Done !
original formula: EX(EF(((p358==1) * (!(A(((p506==0)||(p627==1)) U ((p559==0)||(p468==1)))) + ((p470==0)&&(p205==1))))))
=> equivalent forward existential formula: (([(FwdU((FwdU(EY(Init),TRUE) * (p358==1)),!(((p559==0)||(p468==1)))) * (!(((p506==0)||(p627==1))) * !(((p559==0...336
(forward)formula 0,1,2.90896,95684,1,0,31,494164,26,4,8690,150195,28
FORMULA CO4-PT-14-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Graph (trivial) has 429 edges and 402 vertex of which 2 / 402 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 663 edges and 401 vertex of which 396 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 155 place count 395 transition count 353
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 156 rules applied. Total rules applied 311 place count 242 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 314 place count 241 transition count 348
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 240 transition count 348
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 315 place count 240 transition count 313
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 385 place count 205 transition count 313
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 398 place count 192 transition count 298
Iterating global reduction 4 with 13 rules applied. Total rules applied 411 place count 192 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 412 place count 192 transition count 297
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 412 place count 192 transition count 291
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 424 place count 186 transition count 291
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 430 place count 180 transition count 285
Iterating global reduction 5 with 6 rules applied. Total rules applied 436 place count 180 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 439 place count 180 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 440 place count 179 transition count 282
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 472 place count 163 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 475 place count 163 transition count 263
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 477 place count 162 transition count 262
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 480 place count 159 transition count 259
Iterating global reduction 9 with 3 rules applied. Total rules applied 483 place count 159 transition count 259
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 487 place count 157 transition count 257
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 488 place count 156 transition count 256
Iterating global reduction 9 with 1 rules applied. Total rules applied 489 place count 156 transition count 256
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 490 place count 155 transition count 254
Iterating global reduction 9 with 1 rules applied. Total rules applied 491 place count 155 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 492 place count 155 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 503 place count 155 transition count 242
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 7 rules applied. Total rules applied 510 place count 155 transition count 235
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 517 place count 148 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 519 place count 147 transition count 234
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 521 place count 145 transition count 232
Applied a total of 521 rules in 50 ms. Remains 145 /402 variables (removed 257) and now considering 232/514 (removed 282) transitions.
// Phase 1: matrix 232 rows 145 cols
[2025-05-30 12:18:36] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:18:36] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-30 12:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:18:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:18:36] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:18:36] [INFO ] Redundant transitions in 2 ms returned []
Running 219 sub problems to find dead transitions.
[2025-05-30 12:18:36] [INFO ] Invariant cache hit.
[2025-05-30 12:18:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 231/376 variables, 145/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/377 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/377 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 150 constraints, problems are : Problem set: 0 solved, 219 unsolved in 11933 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 145/145 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 231/376 variables, 145/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 219/368 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 1/377 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/377 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 369 constraints, problems are : Problem set: 0 solved, 219 unsolved in 20157 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 145/145 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32116ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 32116ms
Starting structural reductions in SI_CTL mode, iteration 1 : 145/402 places, 232/514 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32496 ms. Remains : 145/402 places, 232/514 transitions.
[2025-05-30 12:19:08] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:19:08] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:19:08] [INFO ] Input system was already deterministic with 232 transitions.
[2025-05-30 12:19:08] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:19:08] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:19:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality17942898128024975102.gal : 1 ms
[2025-05-30 12:19:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality11909863262013038106.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/CTLCardinality17942898128024975102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11909863262013038106.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.27059e+06,0.069776,6008,2,720,5,7735,6,0,804,6255,0


Converting to forward existential form...Done !
original formula: EG((p461==0))
=> equivalent forward existential formula: [FwdG(Init,(p461==0))] != FALSE
Hit Full ! (commute/partial/dont) 230/0/2
(forward)formula 0,1,0.303268,14840,1,0,8,58993,19,4,3788,20584,8
FORMULA CO4-PT-14-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Graph (trivial) has 407 edges and 402 vertex of which 2 / 402 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 663 edges and 401 vertex of which 396 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 396 transition count 368
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 283 place count 257 transition count 365
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 286 place count 256 transition count 363
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 255 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 289 place count 254 transition count 362
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 289 place count 254 transition count 327
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 359 place count 219 transition count 327
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 373 place count 205 transition count 311
Iterating global reduction 5 with 14 rules applied. Total rules applied 387 place count 205 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 388 place count 205 transition count 310
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 388 place count 205 transition count 304
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 400 place count 199 transition count 304
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 406 place count 193 transition count 298
Iterating global reduction 6 with 6 rules applied. Total rules applied 412 place count 193 transition count 298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 415 place count 193 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 416 place count 192 transition count 295
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 448 place count 176 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 451 place count 176 transition count 276
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 453 place count 175 transition count 275
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 456 place count 172 transition count 272
Iterating global reduction 10 with 3 rules applied. Total rules applied 459 place count 172 transition count 272
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 463 place count 170 transition count 270
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 464 place count 169 transition count 269
Iterating global reduction 10 with 1 rules applied. Total rules applied 465 place count 169 transition count 269
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 466 place count 168 transition count 267
Iterating global reduction 10 with 1 rules applied. Total rules applied 467 place count 168 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 468 place count 168 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 479 place count 168 transition count 255
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 4 rules applied. Total rules applied 483 place count 168 transition count 251
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 12 with 6 rules applied. Total rules applied 489 place count 164 transition count 249
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 491 place count 162 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 493 place count 161 transition count 248
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 497 place count 161 transition count 248
Applied a total of 497 rules in 52 ms. Remains 161 /402 variables (removed 241) and now considering 248/514 (removed 266) transitions.
// Phase 1: matrix 248 rows 161 cols
[2025-05-30 12:19:08] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-05-30 12:19:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-30 12:19:09] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:19:09] [INFO ] Redundant transitions in 3 ms returned []
Running 247 sub problems to find dead transitions.
[2025-05-30 12:19:09] [INFO ] Invariant cache hit.
[2025-05-30 12:19:09] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 247/408 variables, 161/165 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 1/409 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/409 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 198 constraints, problems are : Problem set: 0 solved, 247 unsolved in 13278 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 161/161 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (OVERLAPS) 247/408 variables, 161/165 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 247/444 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/409 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 445 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 161/161 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43316ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 43317ms
Starting structural reductions in SI_CTL mode, iteration 1 : 161/402 places, 248/514 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43629 ms. Remains : 161/402 places, 248/514 transitions.
[2025-05-30 12:19:52] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:19:52] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:19:52] [INFO ] Input system was already deterministic with 248 transitions.
[2025-05-30 12:19:52] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:19:52] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:19:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14099365876017168019.gal : 0 ms
[2025-05-30 12:19:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality13215620636335689327.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/CTLCardinality14099365876017168019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13215620636335689327.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,3.09148e+06,0.078391,6736,2,955,5,10836,6,0,885,9015,0


Converting to forward existential form...Done !
original formula: AF((A((p405==1) U ((p228==0)||(p381==1))) * E(!((((((p142==0)||(p487==1))&&((p252==0)||(p220==1)))&&((p668==1)&&((p344==0)||(p535==1))))&...205
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(((p228==0)||(p381==1))) U (!((p405==1)) * !(((p228==0)||(p381==1))))) + EG(!(((p228==0)||(p...329
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t41, t75, t83, t88, t126, t171, Intersection with reachable at each step enabled. (d...201
(forward)formula 0,0,3.72422,136268,1,0,580,714054,537,327,5473,820522,783
FORMULA CO4-PT-14-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Graph (trivial) has 426 edges and 402 vertex of which 2 / 402 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 663 edges and 401 vertex of which 396 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 395 transition count 354
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 155 rules applied. Total rules applied 309 place count 243 transition count 351
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 311 place count 242 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 313 place count 241 transition count 349
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 313 place count 241 transition count 314
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 383 place count 206 transition count 314
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 395 place count 194 transition count 301
Iterating global reduction 4 with 12 rules applied. Total rules applied 407 place count 194 transition count 301
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 407 place count 194 transition count 295
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 419 place count 188 transition count 295
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 425 place count 182 transition count 289
Iterating global reduction 4 with 6 rules applied. Total rules applied 431 place count 182 transition count 289
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 434 place count 182 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 435 place count 181 transition count 286
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 467 place count 165 transition count 270
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 470 place count 165 transition count 267
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 472 place count 164 transition count 266
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 475 place count 161 transition count 263
Iterating global reduction 8 with 3 rules applied. Total rules applied 478 place count 161 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 480 place count 160 transition count 262
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 481 place count 159 transition count 261
Iterating global reduction 8 with 1 rules applied. Total rules applied 482 place count 159 transition count 261
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 483 place count 158 transition count 259
Iterating global reduction 8 with 1 rules applied. Total rules applied 484 place count 158 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 485 place count 158 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 497 place count 158 transition count 246
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 9 with 7 rules applied. Total rules applied 504 place count 158 transition count 239
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 511 place count 151 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 511 place count 151 transition count 238
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 513 place count 150 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 515 place count 149 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 517 place count 147 transition count 235
Applied a total of 517 rules in 53 ms. Remains 147 /402 variables (removed 255) and now considering 235/514 (removed 279) transitions.
// Phase 1: matrix 235 rows 147 cols
[2025-05-30 12:19:56] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:56] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-30 12:19:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:19:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:19:56] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:19:56] [INFO ] Redundant transitions in 1 ms returned []
Running 222 sub problems to find dead transitions.
[2025-05-30 12:19:56] [INFO ] Invariant cache hit.
[2025-05-30 12:19:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 234/381 variables, 147/151 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/382 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/382 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 152 constraints, problems are : Problem set: 0 solved, 222 unsolved in 12182 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 234/381 variables, 147/151 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 222/373 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 1/382 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/382 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 374 constraints, problems are : Problem set: 0 solved, 222 unsolved in 21116 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33328ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 33328ms
Starting structural reductions in SI_CTL mode, iteration 1 : 147/402 places, 235/514 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33547 ms. Remains : 147/402 places, 235/514 transitions.
[2025-05-30 12:20:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:20:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:20:29] [INFO ] Input system was already deterministic with 235 transitions.
[2025-05-30 12:20:29] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:20:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:20:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7123338549976839801.gal : 1 ms
[2025-05-30 12:20:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2357878725663692952.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7123338549976839801.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2357878725663692952.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2357878725663692952.prop.
RANDOM walk for 37670 steps (3761 resets) in 299 ms. (125 steps per ms) remains 0/1 properties
FORMULA CO4-PT-14-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 373 transition count 484
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 373 transition count 484
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 361 transition count 471
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 361 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 83 place count 361 transition count 470
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 88 place count 356 transition count 465
Iterating global reduction 1 with 5 rules applied. Total rules applied 93 place count 356 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 356 transition count 464
Applied a total of 94 rules in 26 ms. Remains 356 /402 variables (removed 46) and now considering 464/514 (removed 50) transitions.
// Phase 1: matrix 464 rows 356 cols
[2025-05-30 12:20:30] [INFO ] Computed 4 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:30] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-30 12:20:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:20:30] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-05-30 12:20:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/820 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:47] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:20:47] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 1.0)
(t5 0.0)
(t6 timeout
0.0)
(t7 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/820 variables, and 362 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (OVERLAPS) 464/820 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 463/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:21:30] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/820 variables, and 826 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 356/402 places, 464/514 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60375 ms. Remains : 356/402 places, 464/514 transitions.
[2025-05-30 12:21:30] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:21:30] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:21:30] [INFO ] Input system was already deterministic with 464 transitions.
[2025-05-30 12:21:30] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:21:30] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:21:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality6859387236811461191.gal : 2 ms
[2025-05-30 12:21:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality12376563543122080019.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/CTLCardinality6859387236811461191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12376563543122080019.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.95521e+08,0.491127,20868,2,5301,5,54827,6,0,1884,78577,0


Converting to forward existential form...Done !
original formula: EG((EX(!(A((p592==1) U (p540==0)))) * AX((((p538==0)&&(p184==1))||(p362==0)))))
=> equivalent forward existential formula: [FwdG(Init,(EX(!(!((E(!((p540==0)) U (!((p592==1)) * !((p540==0)))) + EG(!((p540==0))))))) * !(EX(!((((p538==0)&...193
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t11, t16, t26, t31, t32, t34, t35, t39, t40, t43, t44, t56, t57, t62,...601
(forward)formula 0,0,19.2343,569712,1,0,978,3.07158e+06,961,526,10533,2.99066e+06,1308
FORMULA CO4-PT-14-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 371 transition count 482
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 371 transition count 482
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 371 transition count 481
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 360 transition count 469
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 360 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 360 transition count 468
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 356 transition count 464
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 356 transition count 464
Applied a total of 94 rules in 26 ms. Remains 356 /402 variables (removed 46) and now considering 464/514 (removed 50) transitions.
// Phase 1: matrix 464 rows 356 cols
[2025-05-30 12:21:49] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-30 12:21:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:21:50] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-05-30 12:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/820 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:07] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:07] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/820 variables, and 362 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (OVERLAPS) 464/820 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 463/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:22:40] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/820 variables, and 826 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 356/402 places, 464/514 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60352 ms. Remains : 356/402 places, 464/514 transitions.
[2025-05-30 12:22:50] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:22:50] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:22:50] [INFO ] Input system was already deterministic with 464 transitions.
[2025-05-30 12:22:50] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:22:50] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:22:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality11603931445509277593.gal : 2 ms
[2025-05-30 12:22:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality5028524230619321286.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/CTLCardinality11603931445509277593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5028524230619321286.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.60619e+08,0.367011,16652,2,3260,5,42247,6,0,1885,54468,0


Converting to forward existential form...Done !
original formula: EF(EX(EF((p474==1))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (p474==1))] != FALSE
(forward)formula 0,1,0.523107,16908,1,0,8,42247,9,1,3653,54468,4
FORMULA CO4-PT-14-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 514/514 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 372 transition count 483
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 372 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 372 transition count 482
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 361 transition count 470
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 361 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 361 transition count 469
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 356 transition count 464
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 356 transition count 464
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 356 transition count 463
Applied a total of 95 rules in 20 ms. Remains 356 /402 variables (removed 46) and now considering 463/514 (removed 51) transitions.
// Phase 1: matrix 463 rows 356 cols
[2025-05-30 12:22:50] [INFO ] Computed 4 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-30 12:22:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:22:51] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2025-05-30 12:22:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:07] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:23:08] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 356/402 places, 463/514 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60373 ms. Remains : 356/402 places, 463/514 transitions.
[2025-05-30 12:23:51] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:23:51] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:23:51] [INFO ] Input system was already deterministic with 463 transitions.
[2025-05-30 12:23:51] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:23:51] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:23:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality14407748946699586752.gal : 2 ms
[2025-05-30 12:23:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17905821829624309622.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/CTLCardinality14407748946699586752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17905821829624309622.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.61025e+08,0.36781,17012,2,3276,5,42129,6,0,1883,55647,0


Converting to forward existential form...Done !
original formula: EF(((p174==1) * (EF(((p467==0)&&(p431==1))) + EX(((p130==0)&&(p421==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (p174==1)),TRUE) * ((p467==0)&&(p431==1)))] != FALSE + [(EY((FwdU(Init,TRUE) * (p174=...197
(forward)formula 0,1,0.448693,17268,1,0,10,42129,10,2,3076,55647,4
FORMULA CO4-PT-14-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-30 12:23:51] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:23:51] [INFO ] Flatten gal took : 8 ms
Total runtime 571886 ms.

BK_STOP 1748607831773

--------------------
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="CO4-PT-14"
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 CO4-PT-14, 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 r044-tall-174854028500481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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