Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 248K 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-17-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-17-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-17-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748608182147

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 12:29:43] [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:29:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 12:29:43] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2025-05-30 12:29:43] [INFO ] Transformed 967 places.
[2025-05-30 12:29:43] [INFO ] Transformed 1150 transitions.
[2025-05-30 12:29:43] [INFO ] Found NUPN structural information;
[2025-05-30 12:29:43] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 198 places in 12 ms
Reduce places removed 198 places and 238 transitions.
FORMULA CO4-PT-17-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 769 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 769/769 places, 912/912 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 753 transition count 911
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 163 place count 607 transition count 765
Iterating global reduction 1 with 146 rules applied. Total rules applied 309 place count 607 transition count 765
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 314 place count 607 transition count 760
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 382 place count 539 transition count 692
Iterating global reduction 2 with 68 rules applied. Total rules applied 450 place count 539 transition count 692
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 460 place count 529 transition count 680
Iterating global reduction 2 with 10 rules applied. Total rules applied 470 place count 529 transition count 680
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 473 place count 529 transition count 677
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 475 place count 527 transition count 675
Iterating global reduction 3 with 2 rules applied. Total rules applied 477 place count 527 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 478 place count 526 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 526 transition count 674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 480 place count 526 transition count 673
Applied a total of 480 rules in 209 ms. Remains 526 /769 variables (removed 243) and now considering 673/912 (removed 239) transitions.
// Phase 1: matrix 673 rows 526 cols
[2025-05-30 12:29:43] [INFO ] Computed 6 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:29:44] [INFO ] Implicit Places using invariants in 468 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 501 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/769 places, 673/912 transitions.
Applied a total of 0 rules in 9 ms. Remains 525 /525 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 734 ms. Remains : 525/769 places, 673/912 transitions.
Support contains 83 out of 525 places after structural reductions.
[2025-05-30 12:29:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-05-30 12:29:44] [INFO ] Flatten gal took : 61 ms
FORMULA CO4-PT-17-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-17-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 12:29:44] [INFO ] Flatten gal took : 39 ms
[2025-05-30 12:29:44] [INFO ] Input system was already deterministic with 673 transitions.
Support contains 50 out of 525 places (down from 83) after GAL structural reductions.
RANDOM walk for 40000 steps (69 resets) in 1900 ms. (21 steps per ms) remains 22/32 properties
BEST_FIRST walk for 4002 steps (16 resets) in 32 ms. (121 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (18 resets) in 43 ms. (91 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4000 steps (11 resets) in 43 ms. (90 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 29 ms. (133 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4001 steps (13 resets) in 82 ms. (48 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (15 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (16 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
// Phase 1: matrix 673 rows 525 cols
[2025-05-30 12:29:45] [INFO ] Computed 5 invariants in 4 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, 18 unsolved
At refinement iteration 1 (OVERLAPS) 203/231 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 6/237 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 367/604 variables, 237/242 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 309/913 variables, 124/366 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/913 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 230/1143 variables, 128/494 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1143 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 42/1185 variables, 28/522 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1185 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 12/1197 variables, 7/529 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1197 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 1/1198 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1198 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/1198 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1198/1198 variables, and 530 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3475 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 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, 18 unsolved
At refinement iteration 1 (OVERLAPS) 203/231 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 6/237 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 367/604 variables, 237/242 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 309/913 variables, 124/371 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 13/384 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 230/1143 variables, 128/512 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1143 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 42/1185 variables, 28/540 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1185 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SMT process timed out in 8563ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 673/673 transitions.
Graph (trivial) has 514 edges and 525 vertex of which 2 / 525 are part of one of the 1 SCC in 14 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 869 edges and 524 vertex of which 501 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 183 rules applied. Total rules applied 185 place count 501 transition count 470
Reduce places removed 168 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 176 rules applied. Total rules applied 361 place count 333 transition count 462
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 370 place count 325 transition count 461
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 370 place count 325 transition count 412
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 468 place count 276 transition count 412
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 475 place count 269 transition count 405
Iterating global reduction 3 with 7 rules applied. Total rules applied 482 place count 269 transition count 405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 482 place count 269 transition count 402
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 488 place count 266 transition count 402
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 491 place count 263 transition count 399
Iterating global reduction 3 with 3 rules applied. Total rules applied 494 place count 263 transition count 399
Performed 80 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 654 place count 183 transition count 302
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 659 place count 183 transition count 297
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 664 place count 178 transition count 292
Iterating global reduction 4 with 5 rules applied. Total rules applied 669 place count 178 transition count 292
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 4 with 4 rules applied. Total rules applied 673 place count 176 transition count 290
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 757 place count 134 transition count 295
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 780 place count 134 transition count 272
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 813 place count 101 transition count 206
Iterating global reduction 5 with 33 rules applied. Total rules applied 846 place count 101 transition count 206
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 866 place count 101 transition count 186
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 870 place count 97 transition count 175
Iterating global reduction 6 with 4 rules applied. Total rules applied 874 place count 97 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 877 place count 97 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 887 place count 97 transition count 162
Free-agglomeration rule applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 899 place count 97 transition count 150
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 7 with 13 rules applied. Total rules applied 912 place count 85 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 913 place count 85 transition count 149
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 915 place count 85 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 916 place count 84 transition count 148
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 918 place count 83 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 919 place count 82 transition count 147
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 10 with 2 rules applied. Total rules applied 921 place count 81 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 922 place count 81 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 926 place count 81 transition count 141
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 928 place count 79 transition count 139
Iterating global reduction 11 with 2 rules applied. Total rules applied 930 place count 79 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 932 place count 79 transition count 137
Free-agglomeration rule applied 6 times.
Iterating global reduction 12 with 6 rules applied. Total rules applied 938 place count 79 transition count 131
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 944 place count 73 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 945 place count 73 transition count 130
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 948 place count 73 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 949 place count 73 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 950 place count 73 transition count 128
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 952 place count 72 transition count 127
Applied a total of 952 rules in 138 ms. Remains 72 /525 variables (removed 453) and now considering 127/673 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 72/525 places, 127/673 transitions.
RANDOM walk for 36213 steps (1091 resets) in 497 ms. (72 steps per ms) remains 0/18 properties
[2025-05-30 12:29:54] [INFO ] Flatten gal took : 24 ms
[2025-05-30 12:29:54] [INFO ] Flatten gal took : 23 ms
[2025-05-30 12:29:54] [INFO ] Input system was already deterministic with 673 transitions.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 871 edges and 525 vertex of which 515 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Graph (trivial) has 558 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 515 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 514 transition count 467
Reduce places removed 195 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 197 rules applied. Total rules applied 395 place count 319 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 318 transition count 465
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 396 place count 318 transition count 414
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 498 place count 267 transition count 414
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 507 place count 258 transition count 405
Iterating global reduction 3 with 9 rules applied. Total rules applied 516 place count 258 transition count 405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 516 place count 258 transition count 402
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 522 place count 255 transition count 402
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 525 place count 252 transition count 399
Iterating global reduction 3 with 3 rules applied. Total rules applied 528 place count 252 transition count 399
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 584 place count 224 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 589 place count 224 transition count 365
Reduce places removed 2 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 4 with 5 rules applied. Total rules applied 594 place count 222 transition count 362
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 5 with 3 rules applied. Total rules applied 597 place count 221 transition count 360
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 6 with 3 rules applied. Total rules applied 600 place count 220 transition count 358
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 602 place count 219 transition count 357
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 608 place count 213 transition count 351
Iterating global reduction 8 with 6 rules applied. Total rules applied 614 place count 213 transition count 351
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 616 place count 212 transition count 350
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 617 place count 211 transition count 349
Iterating global reduction 8 with 1 rules applied. Total rules applied 618 place count 211 transition count 349
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 619 place count 210 transition count 347
Iterating global reduction 8 with 1 rules applied. Total rules applied 620 place count 210 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 621 place count 210 transition count 346
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 633 place count 210 transition count 334
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 640 place count 210 transition count 327
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 647 place count 203 transition count 327
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 649 place count 202 transition count 326
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 652 place count 202 transition count 326
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 653 place count 202 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 655 place count 200 transition count 323
Applied a total of 655 rules in 100 ms. Remains 200 /525 variables (removed 325) and now considering 323/673 (removed 350) transitions.
// Phase 1: matrix 323 rows 200 cols
[2025-05-30 12:29:54] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:29:54] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-30 12:29:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:29:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:29:54] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:29:54] [INFO ] Redundant transitions in 16 ms returned []
Running 310 sub problems to find dead transitions.
[2025-05-30 12:29:54] [INFO ] Invariant cache hit.
[2025-05-30 12:29:54] [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/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 322/522 variables, 200/205 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 1/523 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 0/523 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 206 constraints, problems are : Problem set: 0 solved, 310 unsolved in 22405 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 200/200 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 322/522 variables, 200/205 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 310/515 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/523 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 516 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 200/200 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52497ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 52500ms
Starting structural reductions in SI_CTL mode, iteration 1 : 200/525 places, 323/673 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52850 ms. Remains : 200/525 places, 323/673 transitions.
[2025-05-30 12:30:47] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:30:47] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:30:47] [INFO ] Input system was already deterministic with 323 transitions.
[2025-05-30 12:30:47] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:30:47] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:30:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality2400134970889035175.gal : 5 ms
[2025-05-30 12:30:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality6120278110751918239.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2400134970889035175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6120278110751918239.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.39128e+08,0.208935,11188,2,1410,5,28188,6,0,1109,27662,0


Converting to forward existential form...Done !
original formula: E((p671==0) U !(E(((p176==0)||(p904==1)) U (p534!=1))))
=> equivalent forward existential formula: [(FwdU(Init,(p671==0)) * !(E(((p176==0)||(p904==1)) U (p534!=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t75, t82, t87, t108, t111, t117, t123, t213, Intersection with reachable at each step en...210
Hit Full ! (commute/partial/dont) 322/0/1
(forward)formula 0,1,1.73826,61404,1,0,397,268656,672,212,6941,206104,665
FORMULA CO4-PT-17-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Graph (trivial) has 561 edges and 525 vertex of which 2 / 525 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 870 edges and 524 vertex of which 514 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 513 transition count 467
Reduce places removed 195 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 394 place count 318 transition count 466
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 394 place count 318 transition count 415
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 496 place count 267 transition count 415
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 505 place count 258 transition count 406
Iterating global reduction 2 with 9 rules applied. Total rules applied 514 place count 258 transition count 406
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 514 place count 258 transition count 403
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 520 place count 255 transition count 403
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 523 place count 252 transition count 400
Iterating global reduction 2 with 3 rules applied. Total rules applied 526 place count 252 transition count 400
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 582 place count 224 transition count 371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 587 place count 224 transition count 366
Reduce places removed 2 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 3 with 5 rules applied. Total rules applied 592 place count 222 transition count 363
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 4 with 3 rules applied. Total rules applied 595 place count 221 transition count 361
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 5 with 3 rules applied. Total rules applied 598 place count 220 transition count 359
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 600 place count 219 transition count 358
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 606 place count 213 transition count 352
Iterating global reduction 7 with 6 rules applied. Total rules applied 612 place count 213 transition count 352
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 7 with 2 rules applied. Total rules applied 614 place count 212 transition count 351
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 615 place count 211 transition count 350
Iterating global reduction 7 with 1 rules applied. Total rules applied 616 place count 211 transition count 350
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 617 place count 210 transition count 348
Iterating global reduction 7 with 1 rules applied. Total rules applied 618 place count 210 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 619 place count 210 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 632 place count 210 transition count 334
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 8 rules applied. Total rules applied 640 place count 210 transition count 326
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 648 place count 202 transition count 326
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 10 with 2 rules applied. Total rules applied 650 place count 201 transition count 325
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 651 place count 201 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 653 place count 199 transition count 323
Applied a total of 653 rules in 69 ms. Remains 199 /525 variables (removed 326) and now considering 323/673 (removed 350) transitions.
// Phase 1: matrix 323 rows 199 cols
[2025-05-30 12:30:49] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:30:49] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-30 12:30:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:30:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:30:49] [INFO ] Implicit Places using invariants and state equation in 141 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:30:49] [INFO ] Redundant transitions in 6 ms returned []
Running 310 sub problems to find dead transitions.
[2025-05-30 12:30:49] [INFO ] Invariant cache hit.
[2025-05-30 12:30:49] [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/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/521 variables, 199/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 1/522 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 0/522 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 204 constraints, problems are : Problem set: 0 solved, 310 unsolved in 21585 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 322/521 variables, 199/203 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 310/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 1/522 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 514 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51665ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 51666ms
Starting structural reductions in SI_CTL mode, iteration 1 : 199/525 places, 323/673 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51997 ms. Remains : 199/525 places, 323/673 transitions.
[2025-05-30 12:31:41] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:31:41] [INFO ] Flatten gal took : 28 ms
[2025-05-30 12:31:41] [INFO ] Input system was already deterministic with 323 transitions.
[2025-05-30 12:31:41] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:31:41] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:31:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality1793721234768553666.gal : 2 ms
[2025-05-30 12:31:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4532707992260372818.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/CTLCardinality1793721234768553666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4532707992260372818.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.39128e+08,0.152132,9560,2,1036,5,25312,6,0,1107,16473,0


Converting to forward existential form...Done !
original formula: AF(EG(!(E(!(AF(((p574==0)||(p489==1)))) U (p904==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(!(!(EG(!(((p574==0)||(p489==1)))))) U (p904==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t45, t75, t82, t87, t109, t112, t119, t125, t214, Intersection with reachable at each st...216
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.11833,292484,1,0,758,1.76886e+06,682,471,7061,1.55289e+06,1110
FORMULA CO4-PT-17-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 522 transition count 673
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 34 place count 491 transition count 642
Iterating global reduction 1 with 31 rules applied. Total rules applied 65 place count 491 transition count 642
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 491 transition count 638
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 82 place count 478 transition count 625
Iterating global reduction 2 with 13 rules applied. Total rules applied 95 place count 478 transition count 625
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 472 transition count 618
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 472 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 471 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 471 transition count 617
Applied a total of 109 rules in 34 ms. Remains 471 /525 variables (removed 54) and now considering 617/673 (removed 56) transitions.
// Phase 1: matrix 617 rows 471 cols
[2025-05-30 12:31:50] [INFO ] Computed 4 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:31:50] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-05-30 12:31:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:31:50] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:31: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/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:32:18] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:32:18] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 471/525 places, 617/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60542 ms. Remains : 471/525 places, 617/673 transitions.
[2025-05-30 12:32:51] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:32:51] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:32:51] [INFO ] Input system was already deterministic with 617 transitions.
[2025-05-30 12:32:51] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:32:51] [INFO ] Flatten gal took : 14 ms
[2025-05-30 12:32:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality623843204024482170.gal : 3 ms
[2025-05-30 12:32:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3250245547226038115.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/CTLCardinality623843204024482170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3250245547226038115.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87379e+10,1.43376,45500,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: (AF(EX((p597==0))) * AX(EG(((p294==0)||(p909==1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(EX((p597==0))))] = FALSE * [(EY(Init) * !(EG(((p294==0)||(p909==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Detected timeout of ITS tools.
[2025-05-30 12:33:21] [INFO ] Flatten gal took : 17 ms
[2025-05-30 12:33:21] [INFO ] Applying decomposition
[2025-05-30 12:33:21] [INFO ] Flatten gal took : 12 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/graph8268983401461084092.txt' '-o' '/tmp/graph8268983401461084092.bin' '-w' '/tmp/graph8268983401461084092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8268983401461084092.bin' '-l' '-1' '-v' '-w' '/tmp/graph8268983401461084092.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:33:21] [INFO ] Decomposing Gal with order
[2025-05-30 12:33:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:33:21] [INFO ] Removed a total of 200 redundant transitions.
[2025-05-30 12:33:21] [INFO ] Flatten gal took : 62 ms
[2025-05-30 12:33:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 12 ms.
[2025-05-30 12:33:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality7318118401926508523.gal : 8 ms
[2025-05-30 12:33:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality12669334047142593852.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/CTLCardinality7318118401926508523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12669334047142593852.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.87379e+10,0.241946,13460,727,95,17931,1448,983,32399,101,5973,0


Converting to forward existential form...Done !
original formula: (AF(EX((i9.u86.p597==0))) * AX(EG(((i3.u45.p294==0)||(i18.u149.p909==1)))))
=> equivalent forward existential formula: ([FwdG(Init,!(EX((i9.u86.p597==0))))] = FALSE * [(EY(Init) * !(EG(((i3.u45.p294==0)||(i18.u149.p909==1)))))] = F...160
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t64, t192, t247, t351, t455, t481, t539, i0.t243, i2.t432, i2.u24.t442, i3.t501, i3...745
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 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,1,29.7873,667672,1,0,933674,3599,6627,4.12288e+06,544,16041,664349
FORMULA CO4-PT-17-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Graph (trivial) has 555 edges and 525 vertex of which 2 / 525 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 870 edges and 524 vertex of which 514 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 193 rules applied. Total rules applied 195 place count 513 transition count 470
Reduce places removed 192 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 195 rules applied. Total rules applied 390 place count 321 transition count 467
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 393 place count 320 transition count 465
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 395 place count 318 transition count 465
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 395 place count 318 transition count 417
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 491 place count 270 transition count 417
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 500 place count 261 transition count 408
Iterating global reduction 4 with 9 rules applied. Total rules applied 509 place count 261 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 509 place count 261 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 515 place count 258 transition count 405
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 518 place count 255 transition count 402
Iterating global reduction 4 with 3 rules applied. Total rules applied 521 place count 255 transition count 402
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 575 place count 228 transition count 374
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 580 place count 228 transition count 369
Reduce places removed 2 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 5 with 5 rules applied. Total rules applied 585 place count 226 transition count 366
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 6 with 3 rules applied. Total rules applied 588 place count 225 transition count 364
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 7 with 3 rules applied. Total rules applied 591 place count 224 transition count 362
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 593 place count 223 transition count 361
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 599 place count 217 transition count 355
Iterating global reduction 9 with 6 rules applied. Total rules applied 605 place count 217 transition count 355
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 9 with 4 rules applied. Total rules applied 609 place count 215 transition count 353
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 610 place count 214 transition count 352
Iterating global reduction 9 with 1 rules applied. Total rules applied 611 place count 214 transition count 352
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 612 place count 213 transition count 350
Iterating global reduction 9 with 1 rules applied. Total rules applied 613 place count 213 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 614 place count 213 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 627 place count 213 transition count 336
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 8 rules applied. Total rules applied 635 place count 213 transition count 328
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 643 place count 205 transition count 328
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 645 place count 204 transition count 327
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 647 place count 202 transition count 325
Applied a total of 647 rules in 57 ms. Remains 202 /525 variables (removed 323) and now considering 325/673 (removed 348) transitions.
// Phase 1: matrix 325 rows 202 cols
[2025-05-30 12:33:51] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:33:51] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-05-30 12:33:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:33:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:33:51] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:33:51] [INFO ] Redundant transitions in 4 ms returned []
Running 312 sub problems to find dead transitions.
[2025-05-30 12:33:51] [INFO ] Invariant cache hit.
[2025-05-30 12:33:51] [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/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 324/526 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 1/527 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 0/527 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 207 constraints, problems are : Problem set: 0 solved, 312 unsolved in 22513 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (OVERLAPS) 324/526 variables, 202/206 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/526 variables, 312/518 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 1/527 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 519 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52576ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 52577ms
Starting structural reductions in SI_CTL mode, iteration 1 : 202/525 places, 325/673 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52975 ms. Remains : 202/525 places, 325/673 transitions.
[2025-05-30 12:34:44] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:34:44] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:34:44] [INFO ] Input system was already deterministic with 325 transitions.
[2025-05-30 12:34:44] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:34:44] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:34:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality9555768427004851351.gal : 2 ms
[2025-05-30 12:34:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7188199388982170024.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/CTLCardinality9555768427004851351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7188199388982170024.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.18302e+08,0.151348,10128,2,1335,5,25153,6,0,1121,20715,0


Converting to forward existential form...Done !
original formula: (EF(EG((AF(((p288!=0)&&(p437!=1))) + (p190==0)))) * AF(EG(((p119==0)||(p486==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U EG((!(EG(!(((p288!=0)&&(p437!=1))))) + (p190==0))))))] = FALSE * [FwdG(Init,!(EG(((p119==0)...180
Reverse transition relation is NOT exact ! Due to transitions t8, t44, t74, t82, t87, t111, t115, t122, t129, t199, Intersection with reachable at each st...216
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.436,838128,1,0,1256,5.33514e+06,693,707,7360,5.04908e+06,1704
FORMULA CO4-PT-17-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 : 525/525 places, 673/673 transitions.
Graph (trivial) has 546 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 514 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 188 rules applied. Total rules applied 190 place count 513 transition count 475
Reduce places removed 187 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 191 rules applied. Total rules applied 381 place count 326 transition count 471
Reduce places removed 4 places and 0 transitions.
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 2 with 7 rules applied. Total rules applied 388 place count 322 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 389 place count 321 transition count 468
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 389 place count 321 transition count 420
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 485 place count 273 transition count 420
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 493 place count 265 transition count 412
Iterating global reduction 4 with 8 rules applied. Total rules applied 501 place count 265 transition count 412
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 501 place count 265 transition count 409
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 507 place count 262 transition count 409
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 510 place count 259 transition count 406
Iterating global reduction 4 with 3 rules applied. Total rules applied 513 place count 259 transition count 406
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 567 place count 232 transition count 378
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 571 place count 232 transition count 374
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 5 with 3 rules applied. Total rules applied 574 place count 231 transition count 372
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 6 with 3 rules applied. Total rules applied 577 place count 230 transition count 370
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 581 place count 229 transition count 367
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 584 place count 227 transition count 366
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 589 place count 222 transition count 361
Iterating global reduction 9 with 5 rules applied. Total rules applied 594 place count 222 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 607 place count 222 transition count 348
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 9 with 8 rules applied. Total rules applied 615 place count 222 transition count 340
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 623 place count 214 transition count 340
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 625 place count 213 transition count 339
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 626 place count 213 transition count 339
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 628 place count 211 transition count 337
Applied a total of 628 rules in 63 ms. Remains 211 /525 variables (removed 314) and now considering 337/673 (removed 336) transitions.
// Phase 1: matrix 337 rows 211 cols
[2025-05-30 12:35:14] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:14] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 12:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:35:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:35:14] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:35:14] [INFO ] Redundant transitions in 2 ms returned []
Running 326 sub problems to find dead transitions.
[2025-05-30 12:35:14] [INFO ] Invariant cache hit.
[2025-05-30 12:35:14] [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/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 2/211 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 336/547 variables, 211/215 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (OVERLAPS) 1/548 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (OVERLAPS) 0/548 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 216 constraints, problems are : Problem set: 0 solved, 326 unsolved in 25128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 211/211 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (OVERLAPS) 2/211 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 336/547 variables, 211/215 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 326/541 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 542 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 211/211 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55184ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 55185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 211/525 places, 337/673 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55446 ms. Remains : 211/525 places, 337/673 transitions.
[2025-05-30 12:36:09] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:36:09] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:36:09] [INFO ] Input system was already deterministic with 337 transitions.
[2025-05-30 12:36:09] [INFO ] Flatten gal took : 6 ms
[2025-05-30 12:36:09] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:36:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality1931924230754710411.gal : 2 ms
[2025-05-30 12:36:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality5277500354602161042.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/CTLCardinality1931924230754710411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5277500354602161042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.20123e+08,0.166386,10108,2,1116,5,27240,6,0,1169,18224,0


Converting to forward existential form...Done !
original formula: AG(EF(((((p223==0)&&(p374==1))&&((p790==0)&&(p963==1))) * ((E((p590==0) U ((p922==0)||(p885==1))) + (p661==0)) + (p293==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((p223==0)&&(p374==1))&&((p790==0)&&(p963==1))) * ((E((p590==0) U ((p922==0)||(...204
Reverse transition relation is NOT exact ! Due to transitions t9, t49, t84, t91, t96, t122, t125, t132, t138, t233, Intersection with reachable at each st...216
(forward)formula 0,0,2.48671,83712,1,0,419,447123,701,230,7265,283650,699
FORMULA CO4-PT-17-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 522 transition count 673
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 493 transition count 644
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 493 transition count 644
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 493 transition count 640
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 77 place count 481 transition count 628
Iterating global reduction 2 with 12 rules applied. Total rules applied 89 place count 481 transition count 628
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 475 transition count 621
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 475 transition count 621
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 474 transition count 620
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 474 transition count 620
Applied a total of 103 rules in 45 ms. Remains 474 /525 variables (removed 51) and now considering 620/673 (removed 53) transitions.
// Phase 1: matrix 620 rows 474 cols
[2025-05-30 12:36:12] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:36:12] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 12:36:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:36:12] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2025-05-30 12:36:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (OVERLAPS) 620/1094 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:36:41] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:36:41] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1094 variables, and 480 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/474 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 4 (OVERLAPS) 620/1094 variables, 474/480 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1094 variables, 619/1099 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1094/1094 variables, and 1099 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 474/525 places, 620/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60510 ms. Remains : 474/525 places, 620/673 transitions.
[2025-05-30 12:37:12] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:37:12] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:37:12] [INFO ] Input system was already deterministic with 620 transitions.
[2025-05-30 12:37:12] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:37:12] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:37:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality7606262188467995395.gal : 3 ms
[2025-05-30 12:37:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality8158664412429977796.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/CTLCardinality7606262188467995395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8158664412429977796.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.92595e+10,1.64051,55672,2,8904,5,183810,6,0,2512,261752,0


Converting to forward existential form...Done !
original formula: (EF((p800==1)) + (AF(EX((p639==0))) * (AF(!(A((p522==0) U (p558==0)))) + EX(AF(((p950==0)&&(p558==1)))))))
=> equivalent forward existential formula: ([FwdG((Init * !(E(TRUE U (p800==1)))),!(EX((p639==0))))] = FALSE * [FwdG(((Init * !(E(TRUE U (p800==1)))) * !(E...281
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t126, t157, t18...498
Detected timeout of ITS tools.
[2025-05-30 12:37:42] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:37:42] [INFO ] Applying decomposition
[2025-05-30 12:37:42] [INFO ] Flatten gal took : 11 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/graph5120753515716191376.txt' '-o' '/tmp/graph5120753515716191376.bin' '-w' '/tmp/graph5120753515716191376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5120753515716191376.bin' '-l' '-1' '-v' '-w' '/tmp/graph5120753515716191376.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:37:42] [INFO ] Decomposing Gal with order
[2025-05-30 12:37:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:37:42] [INFO ] Removed a total of 214 redundant transitions.
[2025-05-30 12:37:42] [INFO ] Flatten gal took : 23 ms
[2025-05-30 12:37:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 9 ms.
[2025-05-30 12:37:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2170440994575338975.gal : 5 ms
[2025-05-30 12:37:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality13525848845152527398.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/CTLCardinality2170440994575338975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13525848845152527398.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.92595e+10,0.2216,13336,752,82,17899,985,954,31836,92,3436,0


Converting to forward existential form...Done !
original formula: (EF((i14.u139.p800==1)) + (AF(EX((i8.u100.p639==0))) * (AF(!(A((i4.u73.p522==0) U (i6.u83.p558==0)))) + EX(AF(((i16.u165.p950==0)&&(i6.u8...171
=> equivalent forward existential formula: ([FwdG((Init * !(E(TRUE U (i14.u139.p800==1)))),!(EX((i8.u100.p639==0))))] = FALSE * [FwdG(((Init * !(E(TRUE U (...351
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t193, t248, t352, t514, i0.t502, i0.t499, i0.t476, i0.u7.t506, i0.u14.t478, i1.t616...801
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
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
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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Graph (trivial) has 560 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 514 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 194 rules applied. Total rules applied 196 place count 513 transition count 469
Reduce places removed 193 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 196 rules applied. Total rules applied 392 place count 320 transition count 466
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 395 place count 319 transition count 464
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 397 place count 317 transition count 464
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 397 place count 317 transition count 414
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 497 place count 267 transition count 414
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 506 place count 258 transition count 405
Iterating global reduction 4 with 9 rules applied. Total rules applied 515 place count 258 transition count 405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 515 place count 258 transition count 402
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 521 place count 255 transition count 402
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 524 place count 252 transition count 399
Iterating global reduction 4 with 3 rules applied. Total rules applied 527 place count 252 transition count 399
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 583 place count 224 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 588 place count 224 transition count 365
Reduce places removed 2 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 5 with 5 rules applied. Total rules applied 593 place count 222 transition count 362
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 6 with 3 rules applied. Total rules applied 596 place count 221 transition count 360
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 7 with 3 rules applied. Total rules applied 599 place count 220 transition count 358
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 601 place count 219 transition count 357
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 607 place count 213 transition count 351
Iterating global reduction 9 with 6 rules applied. Total rules applied 613 place count 213 transition count 351
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 617 place count 211 transition count 349
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 618 place count 210 transition count 348
Iterating global reduction 9 with 1 rules applied. Total rules applied 619 place count 210 transition count 348
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 620 place count 209 transition count 346
Iterating global reduction 9 with 1 rules applied. Total rules applied 621 place count 209 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 622 place count 209 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 10 with 12 rules applied. Total rules applied 634 place count 209 transition count 333
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 641 place count 209 transition count 326
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 648 place count 202 transition count 326
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 650 place count 201 transition count 325
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 652 place count 201 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 653 place count 201 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 655 place count 199 transition count 322
Applied a total of 655 rules in 112 ms. Remains 199 /525 variables (removed 326) and now considering 322/673 (removed 351) transitions.
// Phase 1: matrix 322 rows 199 cols
[2025-05-30 12:38:13] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:38:13] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-05-30 12:38:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:38:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:38:13] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:38:13] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2025-05-30 12:38:13] [INFO ] Invariant cache hit.
[2025-05-30 12:38:13] [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/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/520 variables, 199/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 1/521 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/521 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 204 constraints, problems are : Problem set: 0 solved, 309 unsolved in 22757 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/520 variables, 199/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/520 variables, 309/512 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 1/521 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 513 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52812ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 52813ms
Starting structural reductions in SI_CTL mode, iteration 1 : 199/525 places, 322/673 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53332 ms. Remains : 199/525 places, 322/673 transitions.
[2025-05-30 12:39:06] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:39:06] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:39:06] [INFO ] Input system was already deterministic with 322 transitions.
[2025-05-30 12:39:06] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:39:06] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:39:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4619078103491397286.gal : 1 ms
[2025-05-30 12:39:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4029653794802274376.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4619078103491397286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4029653794802274376.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (3418 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
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
BEST_FIRST walk for 40004 steps (485 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality4029653794802274376.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :27 after 47
Reachability property CO4-PT-17-CTLCardinality-2025-09 is true.
FORMULA CO4-PT-17-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,75,0.069758,5496,2,474,11,2839,6,0,1106,804,0
Total reachable state count : 75

Verifying 1 reachability properties.
Reachability property CO4-PT-17-CTLCardinality-2025-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-17-CTLCardinality-2025-09,1,0.070475,5624,2,200,11,2839,7,0,1114,804,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 25900 steps, run visited all 1 properties in 92 ms. (steps per millisecond=281 )
Probabilistic random walk after 25900 steps, saw 6507 distinct states, run finished after 97 ms. (steps per millisecond=267 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 522 transition count 673
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 33 place count 492 transition count 643
Iterating global reduction 1 with 30 rules applied. Total rules applied 63 place count 492 transition count 643
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 492 transition count 639
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 80 place count 479 transition count 626
Iterating global reduction 2 with 13 rules applied. Total rules applied 93 place count 479 transition count 626
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 473 transition count 619
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 473 transition count 619
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 472 transition count 618
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 472 transition count 618
Applied a total of 107 rules in 41 ms. Remains 472 /525 variables (removed 53) and now considering 618/673 (removed 55) transitions.
// Phase 1: matrix 618 rows 472 cols
[2025-05-30 12:39:06] [INFO ] Computed 4 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:39:06] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-30 12:39:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:39:07] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 617 sub problems to find dead transitions.
[2025-05-30 12:39:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (OVERLAPS) 618/1090 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:39:35] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:39:35] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1090 variables, and 478 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 617 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/472 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 4 (OVERLAPS) 618/1090 variables, 472/478 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1090 variables, 617/1095 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1090 variables, and 1095 constraints, problems are : Problem set: 0 solved, 617 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 617/617 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 472/525 places, 618/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60545 ms. Remains : 472/525 places, 618/673 transitions.
[2025-05-30 12:40:07] [INFO ] Flatten gal took : 11 ms
[2025-05-30 12:40:07] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:40:07] [INFO ] Input system was already deterministic with 618 transitions.
[2025-05-30 12:40:07] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:40:07] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:40:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality12420298752174467683.gal : 2 ms
[2025-05-30 12:40:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality14228580379004925155.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/CTLCardinality12420298752174467683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14228580379004925155.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.88892e+10,1.50056,46184,2,8650,5,154335,6,0,2502,204932,0


Converting to forward existential form...Done !
original formula: EF(AG((EX((p689!=1)) * (EF((p587==0)) + EG((p195==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EX((p689!=1)) * (E(TRUE U (p587==0)) + EG((p195==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...494
Detected timeout of ITS tools.
[2025-05-30 12:40:37] [INFO ] Flatten gal took : 13 ms
[2025-05-30 12:40:37] [INFO ] Applying decomposition
[2025-05-30 12:40:37] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph436019462320215237.txt' '-o' '/tmp/graph436019462320215237.bin' '-w' '/tmp/graph436019462320215237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph436019462320215237.bin' '-l' '-1' '-v' '-w' '/tmp/graph436019462320215237.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:40:37] [INFO ] Decomposing Gal with order
[2025-05-30 12:40:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:40:37] [INFO ] Removed a total of 211 redundant transitions.
[2025-05-30 12:40:37] [INFO ] Flatten gal took : 22 ms
[2025-05-30 12:40:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 6 ms.
[2025-05-30 12:40:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality17025338098847846366.gal : 4 ms
[2025-05-30 12:40:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9309514313387035051.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/CTLCardinality17025338098847846366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9309514313387035051.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.88892e+10,0.200833,11668,681,91,13942,1125,1050,24457,94,4284,0


Converting to forward existential form...Done !
original formula: EF(AG((EX((i10.u111.p689!=1)) * (EF((i18.u88.p587==0)) + EG((i5.i0.i2.u21.p195==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EX((i10.u111.p689!=1)) * (E(TRUE U (i18.u88.p587==0)) + EG((i5.i0.i2.u21.p195=...175
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t130, t156, t192, t196, t240, t247, t482, t502, t540, i0.t499, i0.u6.t506, i1.t442,...819
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 an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,1,27.0684,639692,1,0,908230,3642,7372,4.10187e+06,494,17180,660696
FORMULA CO4-PT-17-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Graph (trivial) has 564 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 514 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 197 rules applied. Total rules applied 199 place count 513 transition count 466
Reduce places removed 196 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 199 rules applied. Total rules applied 398 place count 317 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 399 place count 316 transition count 463
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 399 place count 316 transition count 413
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 499 place count 266 transition count 413
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 508 place count 257 transition count 404
Iterating global reduction 3 with 9 rules applied. Total rules applied 517 place count 257 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 517 place count 257 transition count 401
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 523 place count 254 transition count 401
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 526 place count 251 transition count 398
Iterating global reduction 3 with 3 rules applied. Total rules applied 529 place count 251 transition count 398
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 585 place count 223 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 590 place count 223 transition count 364
Reduce places removed 2 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 4 with 5 rules applied. Total rules applied 595 place count 221 transition count 361
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 5 with 3 rules applied. Total rules applied 598 place count 220 transition count 359
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 6 with 3 rules applied. Total rules applied 601 place count 219 transition count 357
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 603 place count 218 transition count 356
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 609 place count 212 transition count 350
Iterating global reduction 8 with 6 rules applied. Total rules applied 615 place count 212 transition count 350
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 8 with 4 rules applied. Total rules applied 619 place count 210 transition count 348
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 620 place count 209 transition count 347
Iterating global reduction 8 with 1 rules applied. Total rules applied 621 place count 209 transition count 347
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 622 place count 208 transition count 345
Iterating global reduction 8 with 1 rules applied. Total rules applied 623 place count 208 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 624 place count 208 transition count 344
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 636 place count 208 transition count 332
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 643 place count 208 transition count 325
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 650 place count 201 transition count 325
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 652 place count 200 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 654 place count 198 transition count 322
Applied a total of 654 rules in 53 ms. Remains 198 /525 variables (removed 327) and now considering 322/673 (removed 351) transitions.
// Phase 1: matrix 322 rows 198 cols
[2025-05-30 12:41:04] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:41:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-30 12:41:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:41:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:41:04] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:41:04] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2025-05-30 12:41:04] [INFO ] Invariant cache hit.
[2025-05-30 12:41:04] [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/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/519 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 1/520 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/520 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 203 constraints, problems are : Problem set: 0 solved, 309 unsolved in 22162 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/519 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 309/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 1/520 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 512 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52222ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 52223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 198/525 places, 322/673 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52468 ms. Remains : 198/525 places, 322/673 transitions.
[2025-05-30 12:41:57] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:41:57] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:41:57] [INFO ] Input system was already deterministic with 322 transitions.
[2025-05-30 12:41:57] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 9941 steps (855 resets) in 28 ms. (342 steps per ms) remains 0/1 properties
FORMULA CO4-PT-17-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 12:41:57] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:41:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4836597976743967621.gal : 1 ms
[2025-05-30 12:41:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6194272219217137575.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/ReachabilityCardinality4836597976743967621.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6194272219217137575.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 522 transition count 673
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 31 place count 494 transition count 645
Iterating global reduction 1 with 28 rules applied. Total rules applied 59 place count 494 transition count 645
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 63 place count 494 transition count 641
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 482 transition count 629
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 482 transition count 629
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 477 transition count 623
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 477 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 476 transition count 622
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 476 transition count 622
Applied a total of 99 rules in 37 ms. Remains 476 /525 variables (removed 49) and now considering 622/673 (removed 51) transitions.
// Phase 1: matrix 622 rows 476 cols
[2025-05-30 12:41:57] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:41:57] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-30 12:41:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:41:57] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 621 sub problems to find dead transitions.
[2025-05-30 12:41:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (OVERLAPS) 622/1098 variables, 476/480 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:42:26] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:42:27] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1098/1098 variables, and 482 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 621 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 1 (OVERLAPS) 1/476 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 4 (OVERLAPS) 622/1098 variables, 476/482 constraints. Problems are: Problem set: 0 solved, 621 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1098 variables, 621/1103 constraints. Problems are: Problem set: 0 solved, 621 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1098/1098 variables, and 1103 constraints, problems are : Problem set: 0 solved, 621 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 476/476 constraints, PredecessorRefiner: 621/621 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 621 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 476/525 places, 622/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60514 ms. Remains : 476/525 places, 622/673 transitions.
[2025-05-30 12:42:57] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:42:57] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:42:57] [INFO ] Input system was already deterministic with 622 transitions.
[2025-05-30 12:42:57] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:42:57] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:42:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality47518606969258810.gal : 2 ms
[2025-05-30 12:42:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality16158158106689715035.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/CTLCardinality47518606969258810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16158158106689715035.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.94991e+10,1.46512,47228,2,8652,5,155892,6,0,2522,211037,0


Converting to forward existential form...Done !
original formula: AF(((EF(EX(TRUE)) * (p959!=0)) * (EF(!(E((p485==1) U (p214==1)))) + AF(EX(((p386!=0)&&(p93!=1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EX(TRUE)) * (p959!=0)) * (E(TRUE U !(E((p485==1) U (p214==1)))) + !(EG(!(EX(((p386!=0)&&...181
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t125, t156, t182, t...488
Detected timeout of ITS tools.
[2025-05-30 12:43:27] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:43:27] [INFO ] Applying decomposition
[2025-05-30 12:43:27] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph76119677357006168.txt' '-o' '/tmp/graph76119677357006168.bin' '-w' '/tmp/graph76119677357006168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph76119677357006168.bin' '-l' '-1' '-v' '-w' '/tmp/graph76119677357006168.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:43:27] [INFO ] Decomposing Gal with order
[2025-05-30 12:43:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:43:27] [INFO ] Removed a total of 207 redundant transitions.
[2025-05-30 12:43:27] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:43:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 5 ms.
[2025-05-30 12:43:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality6006401465616294779.gal : 4 ms
[2025-05-30 12:43:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality18024691907316831564.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/CTLCardinality6006401465616294779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18024691907316831564.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.94991e+10,0.227994,12676,862,77,16364,985,1013,27420,93,2865,0


Converting to forward existential form...Done !
original formula: AF(((EF(EX(TRUE)) * (i18.u170.p959!=0)) * (EF(!(E((i8.i0.i0.u70.p485==1) U (i1.u28.p214==1)))) + AF(EX(((i5.u53.p386!=0)&&(i1.u5.p93!=1))...160
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EX(TRUE)) * (i18.u170.p959!=0)) * (E(TRUE U !(E((i8.i0.i0.u70.p485==1) U (i1.u28.p214==1...223
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t196, t206, t247, t325, t351, t371, i0.u16.t444, i1.t500, i1.u5.t621, i1.u28.t437, ...793
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 522 transition count 673
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 496 transition count 647
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 496 transition count 647
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 59 place count 496 transition count 643
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 485 transition count 632
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 485 transition count 632
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 479 transition count 625
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 479 transition count 625
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 478 transition count 624
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 478 transition count 624
Applied a total of 95 rules in 42 ms. Remains 478 /525 variables (removed 47) and now considering 624/673 (removed 49) transitions.
// Phase 1: matrix 624 rows 478 cols
[2025-05-30 12:43:58] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:43:58] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 12:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:43:58] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 623 sub problems to find dead transitions.
[2025-05-30 12:43:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (OVERLAPS) 624/1102 variables, 478/482 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:44:28] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:44:28] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 484 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 623 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 4 (OVERLAPS) 624/1102 variables, 478/484 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 623/1107 constraints. Problems are: Problem set: 0 solved, 623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 1107 constraints, problems are : Problem set: 0 solved, 623 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 478/478 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 623 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 478/525 places, 624/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60489 ms. Remains : 478/525 places, 624/673 transitions.
[2025-05-30 12:44:58] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:44:58] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:44:58] [INFO ] Input system was already deterministic with 624 transitions.
[2025-05-30 12:44:58] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:44:58] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:44:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2207633599605956764.gal : 2 ms
[2025-05-30 12:44:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality13087695818149952890.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/CTLCardinality2207633599605956764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13087695818149952890.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.96704e+10,1.51524,49308,2,8746,5,162061,6,0,2532,226537,0


Converting to forward existential form...Done !
original formula: AF((AF((((p823!=0)&&(p953!=1))||((p543==1)&&((p550==0)||(p107==1))))) + AX(!(E(((p857==1)||(p573==0)) U (p960!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((p823!=0)&&(p953!=1))||((p543==1)&&((p550==0)||(p107==1))))))) + !(EX(!(!(E(((p857==1)||(...193
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t18, t24, t29, t30, t32, t33, t37, t38, t41, t127, t158, t184, t...488
Detected timeout of ITS tools.
[2025-05-30 12:45:28] [INFO ] Flatten gal took : 12 ms
[2025-05-30 12:45:28] [INFO ] Applying decomposition
[2025-05-30 12:45:28] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1570608564078022314.txt' '-o' '/tmp/graph1570608564078022314.bin' '-w' '/tmp/graph1570608564078022314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1570608564078022314.bin' '-l' '-1' '-v' '-w' '/tmp/graph1570608564078022314.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:45:28] [INFO ] Decomposing Gal with order
[2025-05-30 12:45:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:45:28] [INFO ] Removed a total of 203 redundant transitions.
[2025-05-30 12:45:28] [INFO ] Flatten gal took : 27 ms
[2025-05-30 12:45:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 7 ms.
[2025-05-30 12:45:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality12676718752566133976.gal : 5 ms
[2025-05-30 12:45:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10702573028062824402.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/CTLCardinality12676718752566133976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10702573028062824402.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96704e+10,0.255925,12904,709,89,16165,1576,1009,30171,103,6526,0


Converting to forward existential form...Done !
original formula: AF((AF((((i9.i1.i0.u135.p823!=0)&&(i17.u159.p953!=1))||((i8.u73.p543==1)&&((i8.u76.p550==0)||(i4.u43.p107==1))))) + AX(!(E(((i14.u145.p85...205
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((i9.i1.i0.u135.p823!=0)&&(i17.u159.p953!=1))||((i8.u73.p543==1)&&((i8.u76.p550==0)||(i4.u...262
Reverse transition relation is NOT exact ! Due to transitions t18, t41, t198, t208, t249, t353, t477, t483, t504, t543, i0.t245, i1.t501, i1.u8.t508, i2.t4...777
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
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 an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Graph (trivial) has 563 edges and 525 vertex of which 2 / 525 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 870 edges and 524 vertex of which 516 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 197 rules applied. Total rules applied 199 place count 515 transition count 467
Reduce places removed 196 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 199 rules applied. Total rules applied 398 place count 319 transition count 464
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 400 place count 318 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 401 place count 317 transition count 463
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 401 place count 317 transition count 413
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 501 place count 267 transition count 413
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 510 place count 258 transition count 404
Iterating global reduction 4 with 9 rules applied. Total rules applied 519 place count 258 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 519 place count 258 transition count 401
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 525 place count 255 transition count 401
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 528 place count 252 transition count 398
Iterating global reduction 4 with 3 rules applied. Total rules applied 531 place count 252 transition count 398
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 587 place count 224 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 592 place count 224 transition count 364
Reduce places removed 2 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 5 with 5 rules applied. Total rules applied 597 place count 222 transition count 361
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 6 with 3 rules applied. Total rules applied 600 place count 221 transition count 359
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 7 with 3 rules applied. Total rules applied 603 place count 220 transition count 357
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 605 place count 219 transition count 356
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 611 place count 213 transition count 350
Iterating global reduction 9 with 6 rules applied. Total rules applied 617 place count 213 transition count 350
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 621 place count 211 transition count 348
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 622 place count 210 transition count 347
Iterating global reduction 9 with 1 rules applied. Total rules applied 623 place count 210 transition count 347
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 624 place count 209 transition count 345
Iterating global reduction 9 with 1 rules applied. Total rules applied 625 place count 209 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 626 place count 209 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 10 with 12 rules applied. Total rules applied 638 place count 209 transition count 332
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 645 place count 209 transition count 325
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 652 place count 202 transition count 325
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 654 place count 201 transition count 324
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 655 place count 201 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 657 place count 199 transition count 322
Applied a total of 657 rules in 49 ms. Remains 199 /525 variables (removed 326) and now considering 322/673 (removed 351) transitions.
// Phase 1: matrix 322 rows 199 cols
[2025-05-30 12:45:58] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-30 12:45:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:45:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 12:45:59] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 12:45:59] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2025-05-30 12:45:59] [INFO ] Invariant cache hit.
[2025-05-30 12:45:59] [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/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/519 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 1/520 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 1/521 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/521 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 204 constraints, problems are : Problem set: 0 solved, 309 unsolved in 27966 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 321/519 variables, 198/202 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/519 variables, 308/510 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 1/520 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/521 variables, and 512 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58020ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 58021ms
Starting structural reductions in SI_CTL mode, iteration 1 : 199/525 places, 322/673 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58273 ms. Remains : 199/525 places, 322/673 transitions.
[2025-05-30 12:46:57] [INFO ] Flatten gal took : 7 ms
[2025-05-30 12:46:57] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:46:57] [INFO ] Input system was already deterministic with 322 transitions.
[2025-05-30 12:46:57] [INFO ] Flatten gal took : 4 ms
[2025-05-30 12:46:57] [INFO ] Flatten gal took : 5 ms
[2025-05-30 12:46:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality9309781603357767034.gal : 1 ms
[2025-05-30 12:46:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality6135060222920656467.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/CTLCardinality9309781603357767034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6135060222920656467.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.11259e+08,0.161464,10108,2,1264,5,25997,6,0,1104,17099,0


Converting to forward existential form...Done !
original formula: AF(AG(((p174==0)||(p622==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p174==0)||(p622==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t44, t74, t81, t86, t108, t119, t125, t194, Intersection with reachable at each step ena...209
(forward)formula 0,0,7.3996,218644,1,0,491,928705,671,312,6741,1.41449e+06,761
FORMULA CO4-PT-17-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 673/673 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 522 transition count 673
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 34 place count 491 transition count 642
Iterating global reduction 1 with 31 rules applied. Total rules applied 65 place count 491 transition count 642
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 491 transition count 638
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 82 place count 478 transition count 625
Iterating global reduction 2 with 13 rules applied. Total rules applied 95 place count 478 transition count 625
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 472 transition count 618
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 472 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 471 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 471 transition count 617
Applied a total of 109 rules in 35 ms. Remains 471 /525 variables (removed 54) and now considering 617/673 (removed 56) transitions.
// Phase 1: matrix 617 rows 471 cols
[2025-05-30 12:47:04] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:47:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-30 12:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 12:47:04] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 616 sub problems to find dead transitions.
[2025-05-30 12:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (OVERLAPS) 617/1088 variables, 471/475 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:32] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 12:47:33] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 477 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 616 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 1 (OVERLAPS) 1/471 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 4 (OVERLAPS) 617/1088 variables, 471/477 constraints. Problems are: Problem set: 0 solved, 616 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1088 variables, 616/1093 constraints. Problems are: Problem set: 0 solved, 616 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 1093 constraints, problems are : Problem set: 0 solved, 616 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 616/616 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 616 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 471/525 places, 617/673 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60506 ms. Remains : 471/525 places, 617/673 transitions.
[2025-05-30 12:48:05] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:48:05] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:48:05] [INFO ] Input system was already deterministic with 617 transitions.
[2025-05-30 12:48:05] [INFO ] Flatten gal took : 8 ms
[2025-05-30 12:48:05] [INFO ] Flatten gal took : 9 ms
[2025-05-30 12:48:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality13873241178643895147.gal : 3 ms
[2025-05-30 12:48:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15265233151730767617.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/CTLCardinality13873241178643895147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15265233151730767617.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.87379e+10,1.46968,45496,2,8645,5,152681,6,0,2497,201422,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.55213,45496,1,0,6,152681,7,1,3025,201422,1
FORMULA CO4-PT-17-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-05-30 12:48:06] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:48:06] [INFO ] Flatten gal took : 10 ms
[2025-05-30 12:48:06] [INFO ] Applying decomposition
[2025-05-30 12:48:06] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8524213353628316724.txt' '-o' '/tmp/graph8524213353628316724.bin' '-w' '/tmp/graph8524213353628316724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8524213353628316724.bin' '-l' '-1' '-v' '-w' '/tmp/graph8524213353628316724.weights' '-q' '0' '-e' '0.001'
[2025-05-30 12:48:06] [INFO ] Decomposing Gal with order
[2025-05-30 12:48:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 12:48:06] [INFO ] Removed a total of 227 redundant transitions.
[2025-05-30 12:48:06] [INFO ] Flatten gal took : 21 ms
[2025-05-30 12:48:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 7 ms.
[2025-05-30 12:48:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12845175639207693303.gal : 5 ms
[2025-05-30 12:48:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality17758928838634687523.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/CTLCardinality12845175639207693303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17758928838634687523.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 3 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.10788e+10,0.247924,13072,736,95,16617,1268,1268,27925,110,4684,0


Converting to forward existential form...Done !
original formula: (EF((i14.u158.p800==1)) + (AF(EX((i12.u119.p639==0))) * (AF(!(A((i5.u91.p522==0) U (i9.i0.i2.u99.p558==0)))) + EX(AF(((i18.u190.p950==0)&...184
=> equivalent forward existential formula: ([FwdG((Init * !(E(TRUE U (i14.u158.p800==1)))),!(EX((i12.u119.p639==0))))] = FALSE * [FwdG(((Init * !(E(TRUE U ...376
Reverse transition relation is NOT exact ! Due to transitions t18, t49, t205, t223, t234, t265, t376, t396, t512, t548, t577, t578, t667, i0.i0.i0.u6.t672,...867
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
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 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,1,44.153,908528,1,0,1.19687e+06,3682,8714,6.02155e+06,581,19306,764060
FORMULA CO4-PT-17-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((EF(EX(TRUE)) * (i18.u193.p959!=0)) * (EF(!(E((i6.u80.p485==1) U (i4.i0.i0.u34.p214==1)))) + AF(EX(((i8.u62.p386!=0)&&(i0.i0.i0.u6.p9...166
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U EX(TRUE)) * (i18.u193.p959!=0)) * (E(TRUE U !(E((i6.u80.p485==1) U (i4.i0.i0.u34.p214==1...229
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
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found 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 1,0,80.7272,1549564,1,0,2.22833e+06,4148,9187,8.88835e+06,620,23077,1565621
FORMULA CO4-PT-17-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((AF((((i16.i0.i0.u164.p823!=0)&&(i18.u191.p953!=1))||((i9.i0.i0.u108.p543==1)&&((i9.i0.i2.u99.p550==0)||(i4.i0.i0.u12.p107==1))))) + A...238
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((((i16.i0.i0.u164.p823!=0)&&(i18.u191.p953!=1))||((i9.i0.i0.u108.p543==1)&&((i9.i0.i2.u99.p...295
(forward)formula 2,0,119.369,2079740,1,0,3.06443e+06,5208,9300,1.14416e+07,622,33924,2101129
FORMULA CO4-PT-17-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1223205 ms.

BK_STOP 1748609406577

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

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