Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K 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 336K 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-20-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-15
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-00
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-01
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-02
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-03
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-04
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-05
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-06
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-07
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-08
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-09
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-10
FORMULA_NAME CO4-PT-20-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748611152094

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 13:19:13] [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 13:19:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:19:13] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2025-05-30 13:19:13] [INFO ] Transformed 1178 places.
[2025-05-30 13:19:13] [INFO ] Transformed 1463 transitions.
[2025-05-30 13:19:13] [INFO ] Found NUPN structural information;
[2025-05-30 13:19:13] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-20-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 89 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 970 transition count 1207
Discarding 146 places :
Symmetric choice reduction at 1 with 146 rule applications. Total rules 172 place count 824 transition count 1059
Iterating global reduction 1 with 146 rules applied. Total rules applied 318 place count 824 transition count 1059
Discarding 115 places :
Symmetric choice reduction at 1 with 115 rule applications. Total rules 433 place count 709 transition count 933
Iterating global reduction 1 with 115 rules applied. Total rules applied 548 place count 709 transition count 933
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 555 place count 709 transition count 926
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 608 place count 656 transition count 869
Iterating global reduction 2 with 53 rules applied. Total rules applied 661 place count 656 transition count 869
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 663 place count 656 transition count 867
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 699 place count 620 transition count 831
Iterating global reduction 3 with 36 rules applied. Total rules applied 735 place count 620 transition count 831
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 741 place count 620 transition count 825
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 756 place count 605 transition count 810
Iterating global reduction 4 with 15 rules applied. Total rules applied 771 place count 605 transition count 810
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 772 place count 605 transition count 809
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 775 place count 602 transition count 806
Iterating global reduction 5 with 3 rules applied. Total rules applied 778 place count 602 transition count 806
Applied a total of 778 rules in 257 ms. Remains 602 /991 variables (removed 389) and now considering 806/1212 (removed 406) transitions.
// Phase 1: matrix 806 rows 602 cols
[2025-05-30 13:19:13] [INFO ] Computed 7 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:19:14] [INFO ] Implicit Places using invariants in 416 ms returned [6, 520]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 470 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 600/991 places, 806/1212 transitions.
Applied a total of 0 rules in 21 ms. Remains 600 /600 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 762 ms. Remains : 600/991 places, 806/1212 transitions.
Support contains 89 out of 600 places after structural reductions.
[2025-05-30 13:19:14] [INFO ] Flatten gal took : 114 ms
[2025-05-30 13:19:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-30 13:19:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-20-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 13:19:14] [INFO ] Flatten gal took : 44 ms
[2025-05-30 13:19:14] [INFO ] Input system was already deterministic with 806 transitions.
Support contains 69 out of 600 places (down from 89) after GAL structural reductions.
FORMULA CO4-PT-20-CTLCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (736 resets) in 2181 ms. (18 steps per ms) remains 20/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (12 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (13 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (12 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (12 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (13 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
// Phase 1: matrix 806 rows 600 cols
[2025-05-30 13:19:15] [INFO ] Computed 5 invariants in 10 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 25/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 15/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 189/260 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 413/673 variables, 145/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 395/1068 variables, 192/413 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1068 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 234/1302 variables, 126/539 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1302 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 83/1385 variables, 53/592 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1385 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 19/1404 variables, 11/603 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1404 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 2/1406 variables, 2/605 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1406 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 0/1406 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1406/1406 variables, and 605 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2899 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 25/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 15/71 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 189/260 variables, 71/76 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 413/673 variables, 145/222 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 19/241 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 395/1068 variables, 192/433 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1068 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 234/1302 variables, 126/559 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1302 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 83/1385 variables, 53/612 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1385 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 19/1404 variables, 11/623 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1404 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 2/1406 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1406/1406 variables, and 625 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7965ms problems are : Problem set: 0 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 806/806 transitions.
Graph (trivial) has 579 edges and 600 vertex of which 3 / 600 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 1140 edges and 598 vertex of which 582 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 582 transition count 517
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 263 rules applied. Total rules applied 537 place count 327 transition count 509
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 546 place count 323 transition count 504
Reduce places removed 3 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 10 rules applied. Total rules applied 556 place count 320 transition count 497
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 563 place count 313 transition count 497
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 34 Pre rules applied. Total rules applied 563 place count 313 transition count 463
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 631 place count 279 transition count 463
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 642 place count 268 transition count 451
Iterating global reduction 5 with 11 rules applied. Total rules applied 653 place count 268 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 654 place count 268 transition count 450
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 654 place count 268 transition count 448
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 658 place count 266 transition count 448
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 662 place count 262 transition count 442
Iterating global reduction 6 with 4 rules applied. Total rules applied 666 place count 262 transition count 442
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 668 place count 262 transition count 440
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 669 place count 261 transition count 439
Iterating global reduction 7 with 1 rules applied. Total rules applied 670 place count 261 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 671 place count 261 transition count 438
Performed 76 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 8 with 152 rules applied. Total rules applied 823 place count 185 transition count 349
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 835 place count 185 transition count 337
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 844 place count 176 transition count 323
Iterating global reduction 9 with 9 rules applied. Total rules applied 853 place count 176 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 854 place count 176 transition count 322
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 856 place count 175 transition count 321
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 857 place count 174 transition count 319
Iterating global reduction 10 with 1 rules applied. Total rules applied 858 place count 174 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 859 place count 174 transition count 318
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 11 with 70 rules applied. Total rules applied 929 place count 139 transition count 351
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 941 place count 139 transition count 339
Discarding 18 places :
Symmetric choice reduction at 12 with 18 rule applications. Total rules 959 place count 121 transition count 267
Iterating global reduction 12 with 18 rules applied. Total rules applied 977 place count 121 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 982 place count 121 transition count 262
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 985 place count 118 transition count 244
Iterating global reduction 13 with 3 rules applied. Total rules applied 988 place count 118 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 989 place count 118 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 997 place count 118 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 997 place count 118 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 999 place count 117 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1001 place count 116 transition count 233
Free-agglomeration rule applied 18 times.
Iterating global reduction 14 with 18 rules applied. Total rules applied 1019 place count 116 transition count 215
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 19 rules applied. Total rules applied 1038 place count 98 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 1043 place count 98 transition count 209
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 15 with 6 rules applied. Total rules applied 1049 place count 98 transition count 209
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1051 place count 98 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1052 place count 97 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1053 place count 96 transition count 208
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 16 with 4 rules applied. Total rules applied 1057 place count 94 transition count 206
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1059 place count 94 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 17 with 10 rules applied. Total rules applied 1069 place count 94 transition count 194
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 1070 place count 93 transition count 192
Iterating global reduction 17 with 1 rules applied. Total rules applied 1071 place count 93 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1072 place count 93 transition count 191
Free-agglomeration rule applied 3 times.
Iterating global reduction 18 with 3 rules applied. Total rules applied 1075 place count 93 transition count 188
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1078 place count 90 transition count 188
Applied a total of 1078 rules in 251 ms. Remains 90 /600 variables (removed 510) and now considering 188/806 (removed 618) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 90/600 places, 188/806 transitions.
RANDOM walk for 40000 steps (8 resets) in 449 ms. (88 steps per ms) remains 0/20 properties
[2025-05-30 13:19:24] [INFO ] Flatten gal took : 33 ms
[2025-05-30 13:19:24] [INFO ] Flatten gal took : 30 ms
[2025-05-30 13:19:24] [INFO ] Input system was already deterministic with 806 transitions.
Computed a total of 24 stabilizing places and 39 stable transitions
Graph (complete) has 1143 edges and 600 vertex of which 591 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.8 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Graph (trivial) has 633 edges and 600 vertex of which 3 / 600 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1141 edges and 598 vertex of which 589 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 286 place count 588 transition count 510
Reduce places removed 284 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 292 rules applied. Total rules applied 578 place count 304 transition count 502
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 582 place count 300 transition count 502
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 582 place count 300 transition count 467
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 652 place count 265 transition count 467
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 665 place count 252 transition count 453
Iterating global reduction 3 with 13 rules applied. Total rules applied 678 place count 252 transition count 453
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 678 place count 252 transition count 450
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 684 place count 249 transition count 450
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 689 place count 244 transition count 442
Iterating global reduction 3 with 5 rules applied. Total rules applied 694 place count 244 transition count 442
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 695 place count 244 transition count 441
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 775 place count 204 transition count 401
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 786 place count 204 transition count 390
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 791 place count 201 transition count 388
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 800 place count 192 transition count 374
Iterating global reduction 6 with 9 rules applied. Total rules applied 809 place count 192 transition count 374
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 2 rules applied. Total rules applied 811 place count 192 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 812 place count 191 transition count 372
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 814 place count 190 transition count 371
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 815 place count 189 transition count 369
Iterating global reduction 8 with 1 rules applied. Total rules applied 816 place count 189 transition count 369
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 817 place count 188 transition count 367
Iterating global reduction 8 with 1 rules applied. Total rules applied 818 place count 188 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 819 place count 188 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 843 place count 188 transition count 342
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 9 with 15 rules applied. Total rules applied 858 place count 188 transition count 327
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 873 place count 173 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 873 place count 173 transition count 325
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 877 place count 171 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 879 place count 170 transition count 324
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 880 place count 170 transition count 324
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 881 place count 170 transition count 323
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 883 place count 168 transition count 321
Applied a total of 883 rules in 115 ms. Remains 168 /600 variables (removed 432) and now considering 321/806 (removed 485) transitions.
// Phase 1: matrix 321 rows 168 cols
[2025-05-30 13:19:24] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:19:24] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-30 13:19:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:19:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:19:24] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:19:24] [INFO ] Redundant transitions in 16 ms returned []
Running 298 sub problems to find dead transitions.
[2025-05-30 13:19:24] [INFO ] Invariant cache hit.
[2025-05-30 13:19:24] [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/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 320/488 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 1/489 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/489 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 0/489 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 489/489 variables, and 174 constraints, problems are : Problem set: 0 solved, 298 unsolved in 19130 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 168/168 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 320/488 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 298/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (OVERLAPS) 1/489 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/489 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/489 variables, and 472 constraints, problems are : Problem set: 0 solved, 298 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 168/168 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49244ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 49246ms
Starting structural reductions in SI_CTL mode, iteration 1 : 168/600 places, 321/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49697 ms. Remains : 168/600 places, 321/806 transitions.
[2025-05-30 13:20:13] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:20:13] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:20:13] [INFO ] Input system was already deterministic with 321 transitions.
[2025-05-30 13:20:13] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:20:13] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:20:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality5973435757056209201.gal : 8 ms
[2025-05-30 13:20:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11336089088712827217.ctl : 5 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/CTLCardinality5973435757056209201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11336089088712827217.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,4.1352e+08,0.122652,8240,2,1212,5,17833,6,0,979,12746,0


Converting to forward existential form...Done !
original formula: EF(AG(((p1097!=0)&&(p227!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p1097!=0)&&(p227!=1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t15, t28, t45, t70, t83, t97, t102, t166, t311, t312, Intersection with reachable at...224
(forward)formula 0,0,3.70697,123016,1,0,444,657078,663,229,6845,450929,651
FORMULA CO4-PT-20-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 599 transition count 806
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 560 transition count 766
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 560 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 560 transition count 765
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 108 place count 532 transition count 735
Iterating global reduction 2 with 28 rules applied. Total rules applied 136 place count 532 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 532 transition count 734
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 150 place count 519 transition count 720
Iterating global reduction 3 with 13 rules applied. Total rules applied 163 place count 519 transition count 720
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 165 place count 519 transition count 718
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 171 place count 513 transition count 712
Iterating global reduction 4 with 6 rules applied. Total rules applied 177 place count 513 transition count 712
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 180 place count 513 transition count 709
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 182 place count 511 transition count 707
Iterating global reduction 5 with 2 rules applied. Total rules applied 184 place count 511 transition count 707
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 185 place count 510 transition count 706
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 510 transition count 706
Applied a total of 186 rules in 71 ms. Remains 510 /600 variables (removed 90) and now considering 706/806 (removed 100) transitions.
// Phase 1: matrix 706 rows 510 cols
[2025-05-30 13:20:17] [INFO ] Computed 5 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:17] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-30 13:20:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:18] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 705 sub problems to find dead transitions.
[2025-05-30 13:20:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (OVERLAPS) 1/510 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 3 (OVERLAPS) 706/1216 variables, 510/515 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 515 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 705 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 1 (OVERLAPS) 1/510 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 3 (OVERLAPS) 706/1216 variables, 510/515 constraints. Problems are: Problem set: 0 solved, 705 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1216 variables, 705/1220 constraints. Problems are: Problem set: 0 solved, 705 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:21:16] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 1221 constraints, problems are : Problem set: 0 solved, 705 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 510/510 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 705 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 510/600 places, 706/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60764 ms. Remains : 510/600 places, 706/806 transitions.
[2025-05-30 13:21:18] [INFO ] Flatten gal took : 21 ms
[2025-05-30 13:21:18] [INFO ] Flatten gal took : 21 ms
[2025-05-30 13:21:18] [INFO ] Input system was already deterministic with 706 transitions.
[2025-05-30 13:21:18] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:21:18] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:21:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality8195687784492615305.gal : 8 ms
[2025-05-30 13:21:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15886827887242741551.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/CTLCardinality8195687784492615305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15886827887242741551.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.40223e+12,16.8327,426492,2,31703,5,1.26989e+06,6,0,2740,2.09136e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:21:48] [INFO ] Flatten gal took : 20 ms
[2025-05-30 13:21:48] [INFO ] Applying decomposition
[2025-05-30 13:21:48] [INFO ] Flatten gal took : 17 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/graph9543668968265819972.txt' '-o' '/tmp/graph9543668968265819972.bin' '-w' '/tmp/graph9543668968265819972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9543668968265819972.bin' '-l' '-1' '-v' '-w' '/tmp/graph9543668968265819972.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:21:48] [INFO ] Decomposing Gal with order
[2025-05-30 13:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:21:49] [INFO ] Removed a total of 416 redundant transitions.
[2025-05-30 13:21:49] [INFO ] Flatten gal took : 77 ms
[2025-05-30 13:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 17 ms.
[2025-05-30 13:21:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality16201586262235480812.gal : 12 ms
[2025-05-30 13:21:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality1308270047772884816.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/CTLCardinality16201586262235480812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1308270047772884816.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.40223e+12,4.52847,132308,2571,173,199174,6919,1245,826637,118,61952,0


Converting to forward existential form...Done !
original formula: AG(A((((AX(((i12.u90.p590==1)||(i13.u121.p709==1))) * AF(((i2.i0.i3.u32.p232==0)||(i11.i1.i1.u156.p864==1)))) * (!(EG(EX(TRUE))) * (i8.u8...321
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!((E(!(EG(!((i2.i1.i1.u15.p152==1)))) U !(EG(!((i11.i0.i0.u105.p655==1))))) + EG((i1.u...646
Reverse transition relation is NOT exact ! Due to transitions t21, t32, t56, t87, t96, t97, t141, t175, t187, t237, t274, t326, t363, t372, t416, t537, t56...1136
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 599 transition count 806
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 39 place count 561 transition count 767
Iterating global reduction 1 with 38 rules applied. Total rules applied 77 place count 561 transition count 767
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 561 transition count 766
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 107 place count 532 transition count 736
Iterating global reduction 2 with 29 rules applied. Total rules applied 136 place count 532 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 532 transition count 735
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 152 place count 517 transition count 719
Iterating global reduction 3 with 15 rules applied. Total rules applied 167 place count 517 transition count 719
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 517 transition count 717
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 177 place count 509 transition count 709
Iterating global reduction 4 with 8 rules applied. Total rules applied 185 place count 509 transition count 709
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 188 place count 509 transition count 706
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 189 place count 508 transition count 705
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 508 transition count 705
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 191 place count 507 transition count 704
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 507 transition count 704
Applied a total of 192 rules in 62 ms. Remains 507 /600 variables (removed 93) and now considering 704/806 (removed 102) transitions.
// Phase 1: matrix 704 rows 507 cols
[2025-05-30 13:22:19] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:22:19] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-30 13:22:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:22:19] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2025-05-30 13:22:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 704/1211 variables, 507/512 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/1211 variables, and 512 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 704/1211 variables, 507/512 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1211 variables, 703/1215 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:23:15] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:23:16] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/1211 variables, and 1217 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 507/600 places, 704/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60671 ms. Remains : 507/600 places, 704/806 transitions.
[2025-05-30 13:23:19] [INFO ] Flatten gal took : 16 ms
[2025-05-30 13:23:19] [INFO ] Flatten gal took : 15 ms
[2025-05-30 13:23:19] [INFO ] Input system was already deterministic with 704 transitions.
[2025-05-30 13:23:19] [INFO ] Flatten gal took : 15 ms
[2025-05-30 13:23:19] [INFO ] Flatten gal took : 17 ms
[2025-05-30 13:23:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality393183196765002915.gal : 3 ms
[2025-05-30 13:23:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15509463664087647773.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/CTLCardinality393183196765002915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15509463664087647773.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.43552e+12,22.7188,485680,2,30072,5,1.39441e+06,6,0,2726,2.5192e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:23:49] [INFO ] Flatten gal took : 14 ms
[2025-05-30 13:23:49] [INFO ] Applying decomposition
[2025-05-30 13:23:50] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17149171889518629164.txt' '-o' '/tmp/graph17149171889518629164.bin' '-w' '/tmp/graph17149171889518629164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17149171889518629164.bin' '-l' '-1' '-v' '-w' '/tmp/graph17149171889518629164.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:23:50] [INFO ] Decomposing Gal with order
[2025-05-30 13:23:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:23:50] [INFO ] Removed a total of 413 redundant transitions.
[2025-05-30 13:23:50] [INFO ] Flatten gal took : 34 ms
[2025-05-30 13:23:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 8 ms.
[2025-05-30 13:23:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality1256524340526412862.gal : 6 ms
[2025-05-30 13:23:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality14932198289910709504.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/CTLCardinality1256524340526412862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14932198289910709504.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.43552e+12,1.72683,61188,2311,177,89389,5707,1218,344859,125,47955,0


Converting to forward existential form...Done !
original formula: ((AF(((((i7.u80.p549!=0)&&(i9.u110.p692!=1))||(i1.i1.i2.u16.p192!=0)) + AF((i11.i1.i1.u136.p763!=0)))) * AF(AX(E((i13.i0.i1.u93.p615==1) ...342
=> equivalent forward existential formula: (([FwdG(Init,!(((((i7.u80.p549!=0)&&(i9.u110.p692!=1))||(i1.i1.i2.u16.p192!=0)) + !(EG(!((i11.i1.i1.u136.p763!=0...459
Reverse transition relation is NOT exact ! Due to transitions t18, t29, t53, t84, t93, t94, t138, t172, t309, t321, t359, t368, t491, t563, t564, t596, t60...1150
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 599 transition count 806
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 45 place count 555 transition count 761
Iterating global reduction 1 with 44 rules applied. Total rules applied 89 place count 555 transition count 761
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 90 place count 555 transition count 760
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 124 place count 521 transition count 724
Iterating global reduction 2 with 34 rules applied. Total rules applied 158 place count 521 transition count 724
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 521 transition count 723
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 175 place count 505 transition count 706
Iterating global reduction 3 with 16 rules applied. Total rules applied 191 place count 505 transition count 706
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 505 transition count 704
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 202 place count 496 transition count 695
Iterating global reduction 4 with 9 rules applied. Total rules applied 211 place count 496 transition count 695
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 496 transition count 692
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 216 place count 494 transition count 690
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 494 transition count 690
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 219 place count 493 transition count 689
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 493 transition count 689
Applied a total of 220 rules in 47 ms. Remains 493 /600 variables (removed 107) and now considering 689/806 (removed 117) transitions.
// Phase 1: matrix 689 rows 493 cols
[2025-05-30 13:24:20] [INFO ] Computed 5 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:24:20] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-30 13:24:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:24:20] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 688 sub problems to find dead transitions.
[2025-05-30 13:24:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (OVERLAPS) 689/1182 variables, 493/498 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 498 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:25:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:25:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/500 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 688/1188 constraints. Problems are: Problem set: 0 solved, 688 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 1182/1182 variables, and 1188 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 493/600 places, 689/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 493/600 places, 689/806 transitions.
[2025-05-30 13:25:20] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:25:20] [INFO ] Flatten gal took : 18 ms
[2025-05-30 13:25:20] [INFO ] Input system was already deterministic with 689 transitions.
[2025-05-30 13:25:20] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:25:20] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:25:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality17983436679297711939.gal : 4 ms
[2025-05-30 13:25:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality12288406323403769408.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/CTLCardinality17983436679297711939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12288406323403769408.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.2873e+12,17.5901,418472,2,29610,5,1.24554e+06,6,0,2655,2.08006e+06,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,17.6852,418472,1,0,6,1.24554e+06,7,1,3264,2.08006e+06,1
FORMULA CO4-PT-20-CTLCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Graph (trivial) has 630 edges and 600 vertex of which 3 / 600 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1141 edges and 598 vertex of which 589 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 285 place count 588 transition count 511
Reduce places removed 283 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 291 rules applied. Total rules applied 576 place count 305 transition count 503
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 581 place count 301 transition count 502
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 582 place count 300 transition count 502
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 582 place count 300 transition count 468
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 650 place count 266 transition count 468
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 663 place count 253 transition count 454
Iterating global reduction 4 with 13 rules applied. Total rules applied 676 place count 253 transition count 454
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 676 place count 253 transition count 451
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 682 place count 250 transition count 451
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 686 place count 246 transition count 444
Iterating global reduction 4 with 4 rules applied. Total rules applied 690 place count 246 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 691 place count 246 transition count 443
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 771 place count 206 transition count 403
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 782 place count 206 transition count 392
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 787 place count 203 transition count 390
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 796 place count 194 transition count 376
Iterating global reduction 7 with 9 rules applied. Total rules applied 805 place count 194 transition count 376
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 2 rules applied. Total rules applied 807 place count 194 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 808 place count 193 transition count 374
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 9 with 2 rules applied. Total rules applied 810 place count 192 transition count 373
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 811 place count 191 transition count 371
Iterating global reduction 9 with 1 rules applied. Total rules applied 812 place count 191 transition count 371
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 813 place count 190 transition count 369
Iterating global reduction 9 with 1 rules applied. Total rules applied 814 place count 190 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 815 place count 190 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 841 place count 190 transition count 342
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 10 with 16 rules applied. Total rules applied 857 place count 190 transition count 326
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 873 place count 174 transition count 326
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 873 place count 174 transition count 323
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 879 place count 171 transition count 323
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 881 place count 170 transition count 322
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 883 place count 168 transition count 320
Applied a total of 883 rules in 79 ms. Remains 168 /600 variables (removed 432) and now considering 320/806 (removed 486) transitions.
// Phase 1: matrix 320 rows 168 cols
[2025-05-30 13:25:38] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-30 13:25:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:25:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:25:38] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:25:38] [INFO ] Redundant transitions in 4 ms returned []
Running 297 sub problems to find dead transitions.
[2025-05-30 13:25:38] [INFO ] Invariant cache hit.
[2025-05-30 13:25:38] [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/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 319/487 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 1/488 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 0/488 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 174 constraints, problems are : Problem set: 0 solved, 297 unsolved in 19159 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 168/168 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 319/487 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 297/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 1/488 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 471 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 168/168 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49233ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 49234ms
Starting structural reductions in SI_CTL mode, iteration 1 : 168/600 places, 320/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49508 ms. Remains : 168/600 places, 320/806 transitions.
[2025-05-30 13:26:28] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:26:28] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:26:28] [INFO ] Input system was already deterministic with 320 transitions.
[2025-05-30 13:26:28] [INFO ] Flatten gal took : 22 ms
[2025-05-30 13:26:28] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:26:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality103314129961502611.gal : 3 ms
[2025-05-30 13:26:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality4086098523676097401.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/CTLCardinality103314129961502611.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4086098523676097401.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.59795e+08,0.164371,9936,2,2073,5,24831,6,0,978,18380,0


Converting to forward existential form...Done !
original formula: AF(EG((((p1170==0)&&(p805==1)) + (AF((p434==0)) * AF(((p684==0)||(p1143==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((p1170==0)&&(p805==1)) + (!(EG(!((p434==0)))) * !(EG(!(((p684==0)||(p1143==1))))))))))] = FALS...156
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t8, t14, t27, t45, t70, t84, t98, t103, t141, t165, t304, t309, t310, t313, ...254
Detected timeout of ITS tools.
[2025-05-30 13:26:58] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:26:58] [INFO ] Applying decomposition
[2025-05-30 13:26:58] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17333522794922918130.txt' '-o' '/tmp/graph17333522794922918130.bin' '-w' '/tmp/graph17333522794922918130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17333522794922918130.bin' '-l' '-1' '-v' '-w' '/tmp/graph17333522794922918130.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:26:58] [INFO ] Decomposing Gal with order
[2025-05-30 13:26:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:26:58] [INFO ] Removed a total of 247 redundant transitions.
[2025-05-30 13:26:58] [INFO ] Flatten gal took : 32 ms
[2025-05-30 13:26:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 127 labels/synchronizations in 5 ms.
[2025-05-30 13:26:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13070783560496374275.gal : 2 ms
[2025-05-30 13:26:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14687611226186400957.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/CTLCardinality13070783560496374275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14687611226186400957.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,4.59795e+08,0.113235,5796,140,83,2639,743,586,4315,133,2278,0


Converting to forward existential form...Done !
original formula: AF(EG((((i7.u58.p1170==0)&&(i4.i1.u39.p805==1)) + (AF((i4.i0.u24.p434==0)) * AF(((i2.i1.u30.p684==0)||(i5.i1.u57.p1143==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((i7.u58.p1170==0)&&(i4.i1.u39.p805==1)) + (!(EG(!((i4.i0.u24.p434==0)))) * !(EG(!(((i2.i1.u30....203
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u4.t103, i0.i3.u19.t84, i1.i1.u9.t165, i1.i4.u15.t98, i3.i3.u46.t45, i5.i1.t303, i5.i1....403
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 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
Using saturation style SCC detection
Using saturation style SCC detection
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
(forward)formula 0,1,18.9957,468772,1,0,541095,28987,3597,2.84026e+06,718,199655,309693
FORMULA CO4-PT-20-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 563 transition count 768
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 563 transition count 768
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 563 transition count 767
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 103 place count 535 transition count 737
Iterating global reduction 1 with 28 rules applied. Total rules applied 131 place count 535 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 132 place count 535 transition count 736
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 143 place count 524 transition count 725
Iterating global reduction 2 with 11 rules applied. Total rules applied 154 place count 524 transition count 725
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 524 transition count 723
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 162 place count 518 transition count 717
Iterating global reduction 3 with 6 rules applied. Total rules applied 168 place count 518 transition count 717
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 518 transition count 714
Applied a total of 171 rules in 63 ms. Remains 518 /600 variables (removed 82) and now considering 714/806 (removed 92) transitions.
// Phase 1: matrix 714 rows 518 cols
[2025-05-30 13:27:17] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:27:17] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-30 13:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:27:18] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 713 sub problems to find dead transitions.
[2025-05-30 13:27:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/517 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:27:38] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:27:38] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/517 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/1232 variables, and 7 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/518 constraints, PredecessorRefiner: 713/713 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 713 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/517 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/517 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 4 (OVERLAPS) 714/1231 variables, 517/524 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 712/1236 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 1236 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 517/518 constraints, PredecessorRefiner: 712/713 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 713 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Starting structural reductions in LTL mode, iteration 1 : 518/600 places, 714/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60835 ms. Remains : 518/600 places, 714/806 transitions.
[2025-05-30 13:28:18] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:28:18] [INFO ] Flatten gal took : 20 ms
[2025-05-30 13:28:18] [INFO ] Input system was already deterministic with 714 transitions.
[2025-05-30 13:28:18] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:28:18] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:28:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2891539524142336385.gal : 2 ms
[2025-05-30 13:28:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality7329805292586256441.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/CTLCardinality2891539524142336385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7329805292586256441.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.64458e+12,17.5522,444024,2,27304,5,1.24212e+06,6,0,2776,2.26466e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:28:48] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:28:48] [INFO ] Applying decomposition
[2025-05-30 13:28:48] [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/graph5176081888057741868.txt' '-o' '/tmp/graph5176081888057741868.bin' '-w' '/tmp/graph5176081888057741868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5176081888057741868.bin' '-l' '-1' '-v' '-w' '/tmp/graph5176081888057741868.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:28:48] [INFO ] Decomposing Gal with order
[2025-05-30 13:28:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:28:48] [INFO ] Removed a total of 419 redundant transitions.
[2025-05-30 13:28:48] [INFO ] Flatten gal took : 27 ms
[2025-05-30 13:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 18 ms.
[2025-05-30 13:28:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17689009623394175727.gal : 8 ms
[2025-05-30 13:28:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10967435413664408997.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/CTLCardinality17689009623394175727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10967435413664408997.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.64458e+12,7.60029,281456,2417,201,291273,7646,1196,2.65069e+06,128,74323,0


Converting to forward existential form...Done !
original formula: A(EF((i18.i0.i3.u163.p921!=0)) U E(EX((i20.u177.p1014==0)) U ((EF((i4.u30.p249==1)) * !(((i10.u99.p626==0)&&(i13.u126.p748==0)))) * (!(((...359
=> equivalent forward existential formula: [((Init * !(EG(!(E(EX((i20.u177.p1014==0)) U ((E(TRUE U (i4.u30.p249==1)) * !(((i10.u99.p626==0)&&(i13.u126.p748...1074
Reverse transition relation is NOT exact ! Due to transitions t19, t30, t54, t85, t99, t100, t192, t276, t368, t377, t421, t570, t571, t608, t609, t637, t6...1102
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Graph (trivial) has 635 edges and 600 vertex of which 3 / 600 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1141 edges and 598 vertex of which 589 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 285 rules applied. Total rules applied 287 place count 588 transition count 509
Reduce places removed 285 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 293 rules applied. Total rules applied 580 place count 303 transition count 501
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 584 place count 299 transition count 501
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 584 place count 299 transition count 466
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 654 place count 264 transition count 466
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 667 place count 251 transition count 452
Iterating global reduction 3 with 13 rules applied. Total rules applied 680 place count 251 transition count 452
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 680 place count 251 transition count 449
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 686 place count 248 transition count 449
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 691 place count 243 transition count 441
Iterating global reduction 3 with 5 rules applied. Total rules applied 696 place count 243 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 697 place count 243 transition count 440
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 777 place count 203 transition count 400
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 788 place count 203 transition count 389
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 793 place count 200 transition count 387
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 802 place count 191 transition count 373
Iterating global reduction 6 with 9 rules applied. Total rules applied 811 place count 191 transition count 373
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 2 rules applied. Total rules applied 813 place count 191 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 814 place count 190 transition count 371
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 816 place count 189 transition count 370
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 817 place count 188 transition count 368
Iterating global reduction 8 with 1 rules applied. Total rules applied 818 place count 188 transition count 368
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 819 place count 187 transition count 366
Iterating global reduction 8 with 1 rules applied. Total rules applied 820 place count 187 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 821 place count 187 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 847 place count 187 transition count 339
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 16 rules applied. Total rules applied 863 place count 187 transition count 323
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 879 place count 171 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 879 place count 171 transition count 320
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 885 place count 168 transition count 320
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 887 place count 167 transition count 319
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 889 place count 165 transition count 317
Applied a total of 889 rules in 125 ms. Remains 165 /600 variables (removed 435) and now considering 317/806 (removed 489) transitions.
// Phase 1: matrix 317 rows 165 cols
[2025-05-30 13:29:19] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:29:19] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 13:29:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:29:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:29:19] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:29:19] [INFO ] Redundant transitions in 3 ms returned []
Running 294 sub problems to find dead transitions.
[2025-05-30 13:29:19] [INFO ] Invariant cache hit.
[2025-05-30 13:29:19] [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/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 316/481 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 1/482 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 171 constraints, problems are : Problem set: 0 solved, 294 unsolved in 18236 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 316/481 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 294/464 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 1/482 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 465 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48298ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 48300ms
Starting structural reductions in SI_CTL mode, iteration 1 : 165/600 places, 317/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48788 ms. Remains : 165/600 places, 317/806 transitions.
[2025-05-30 13:30:07] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:30:07] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:30:07] [INFO ] Input system was already deterministic with 317 transitions.
[2025-05-30 13:30:07] [INFO ] Flatten gal took : 6 ms
[2025-05-30 13:30:07] [INFO ] Flatten gal took : 8 ms
[2025-05-30 13:30:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality1738472030150109835.gal : 1 ms
[2025-05-30 13:30:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15535714093838755362.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/CTLCardinality1738472030150109835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15535714093838755362.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,3.0653e+08,0.105096,7964,2,1173,5,16399,6,0,963,11016,0


Converting to forward existential form...Done !
original formula: EG(AF((p903==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p903==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t12, t27, t44, t69, t82, t96, t101, t162, t306, t307, t310, Intersection with reachable ...226
Detected timeout of ITS tools.
[2025-05-30 13:30:37] [INFO ] Flatten gal took : 9 ms
[2025-05-30 13:30:37] [INFO ] Applying decomposition
[2025-05-30 13:30: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/graph12766417340183502351.txt' '-o' '/tmp/graph12766417340183502351.bin' '-w' '/tmp/graph12766417340183502351.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12766417340183502351.bin' '-l' '-1' '-v' '-w' '/tmp/graph12766417340183502351.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:30:37] [INFO ] Decomposing Gal with order
[2025-05-30 13:30:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:30:37] [INFO ] Removed a total of 272 redundant transitions.
[2025-05-30 13:30:37] [INFO ] Flatten gal took : 25 ms
[2025-05-30 13:30:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 6 ms.
[2025-05-30 13:30:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality12239248883141299255.gal : 2 ms
[2025-05-30 13:30:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality9362018267231152748.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/CTLCardinality12239248883141299255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9362018267231152748.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.0653e+08,0.065362,6072,145,44,3437,583,582,4925,121,1807,0


Converting to forward existential form...Done !
original formula: EG(AF((i6.i1.u51.p903==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((i6.i1.u51.p903==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u10.t162, i0.i3.u25.t69, i0.i3.u25.t306, i1.i1.u4.t101, i1.i2.u16.t96, i1.i3.u19.t82, i...345
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
(forward)formula 0,0,11.829,417328,1,0,428722,7723,3459,3.93645e+06,613,64087,141131
FORMULA CO4-PT-20-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 599 transition count 806
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 37 place count 563 transition count 769
Iterating global reduction 1 with 36 rules applied. Total rules applied 73 place count 563 transition count 769
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 563 transition count 768
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 100 place count 537 transition count 741
Iterating global reduction 2 with 26 rules applied. Total rules applied 126 place count 537 transition count 741
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 137 place count 526 transition count 729
Iterating global reduction 2 with 11 rules applied. Total rules applied 148 place count 526 transition count 729
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 150 place count 526 transition count 727
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 156 place count 520 transition count 721
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 520 transition count 721
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 518 transition count 719
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 518 transition count 719
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 517 transition count 718
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 517 transition count 718
Applied a total of 168 rules in 70 ms. Remains 517 /600 variables (removed 83) and now considering 718/806 (removed 88) transitions.
// Phase 1: matrix 718 rows 517 cols
[2025-05-30 13:30:49] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:50] [INFO ] Implicit Places using invariants in 383 ms returned []
[2025-05-30 13:30:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:30:50] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Running 717 sub problems to find dead transitions.
[2025-05-30 13:30: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/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (OVERLAPS) 1/517 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 717 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:31:10] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:31:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/517 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/1235 variables, and 7 constraints, problems are : Problem set: 0 solved, 717 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/517 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 717 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (OVERLAPS) 1/517 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/517 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 4 (OVERLAPS) 718/1235 variables, 517/524 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1235 variables, 717/1241 constraints. Problems are: Problem set: 0 solved, 717 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:31:43] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1235/1235 variables, and 1242 constraints, problems are : Problem set: 0 solved, 717 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 517/517 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 717 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 517/600 places, 718/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60913 ms. Remains : 517/600 places, 718/806 transitions.
[2025-05-30 13:31:50] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:31:50] [INFO ] Flatten gal took : 12 ms
[2025-05-30 13:31:50] [INFO ] Input system was already deterministic with 718 transitions.
[2025-05-30 13:31:50] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:31:50] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:31:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality8799823500584858267.gal : 2 ms
[2025-05-30 13:31:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality9823406000881062558.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/CTLCardinality8799823500584858267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9823406000881062558.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.90526e+12,18.5974,463176,2,29884,5,1.37131e+06,6,0,2780,2.34715e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:32:20] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:32:20] [INFO ] Applying decomposition
[2025-05-30 13:32:20] [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/graph14544757097467642289.txt' '-o' '/tmp/graph14544757097467642289.bin' '-w' '/tmp/graph14544757097467642289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14544757097467642289.bin' '-l' '-1' '-v' '-w' '/tmp/graph14544757097467642289.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:32:20] [INFO ] Decomposing Gal with order
[2025-05-30 13:32:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:32:21] [INFO ] Removed a total of 429 redundant transitions.
[2025-05-30 13:32:21] [INFO ] Flatten gal took : 39 ms
[2025-05-30 13:32:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 21 ms.
[2025-05-30 13:32:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality12280522707074645416.gal : 4 ms
[2025-05-30 13:32:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality8504252470350922392.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/CTLCardinality12280522707074645416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8504252470350922392.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.90526e+12,5.19241,170196,2353,167,209608,8092,1187,1.31179e+06,130,80732,0


Converting to forward existential form...Done !
original formula: AX((!(A(!(((i17.u134.p779==1)||(i17.u95.p594==1))) U !((((i6.u61.p398==1)||(i19.u180.p1052==0))||(i8.u76.p478!=1))))) * AF((((((i11.i0.i0...288
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(!((((i6.u61.p398==1)||(i19.u180.p1052==0))||(i8.u76.p478!=1))))))) * !(E(!(!((((i6.u61.p39...509
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
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 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t83, t92, t93, t137, t183, t233, t271, t336, t363, t383, t431, t477, t508, t548, t5...1187
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 599 transition count 806
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 560 transition count 766
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 560 transition count 766
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 109 place count 530 transition count 735
Iterating global reduction 1 with 30 rules applied. Total rules applied 139 place count 530 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 140 place count 530 transition count 734
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 154 place count 516 transition count 719
Iterating global reduction 2 with 14 rules applied. Total rules applied 168 place count 516 transition count 719
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 169 place count 516 transition count 718
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 177 place count 508 transition count 710
Iterating global reduction 3 with 8 rules applied. Total rules applied 185 place count 508 transition count 710
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 187 place count 508 transition count 708
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 189 place count 506 transition count 706
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 506 transition count 706
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 505 transition count 705
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 505 transition count 705
Applied a total of 193 rules in 55 ms. Remains 505 /600 variables (removed 95) and now considering 705/806 (removed 101) transitions.
// Phase 1: matrix 705 rows 505 cols
[2025-05-30 13:32:51] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:51] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 13:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:32:51] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 704 sub problems to find dead transitions.
[2025-05-30 13:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/505 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (OVERLAPS) 705/1210 variables, 505/510 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1210/1210 variables, and 510 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/505 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:35] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:35] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 4 (OVERLAPS) 705/1210 variables, 505/512 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1210 variables, 704/1216 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:33:51] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/1210 variables, and 1217 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60148ms problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 505/600 places, 705/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60685 ms. Remains : 505/600 places, 705/806 transitions.
[2025-05-30 13:33:51] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:33:51] [INFO ] Flatten gal took : 19 ms
[2025-05-30 13:33:51] [INFO ] Input system was already deterministic with 705 transitions.
[2025-05-30 13:33:51] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:33:51] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:33:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10099234947526401458.gal : 3 ms
[2025-05-30 13:33:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17776496969732525439.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/CTLCardinality10099234947526401458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17776496969732525439.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.53569e+12,15.9435,420144,2,29438,5,1.24212e+06,6,0,2719,2.10095e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:34:22] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:34:22] [INFO ] Applying decomposition
[2025-05-30 13:34:22] [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/graph16299265672286416245.txt' '-o' '/tmp/graph16299265672286416245.bin' '-w' '/tmp/graph16299265672286416245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16299265672286416245.bin' '-l' '-1' '-v' '-w' '/tmp/graph16299265672286416245.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:34:22] [INFO ] Decomposing Gal with order
[2025-05-30 13:34:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:34:22] [INFO ] Removed a total of 432 redundant transitions.
[2025-05-30 13:34:22] [INFO ] Flatten gal took : 56 ms
[2025-05-30 13:34:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 5 ms.
[2025-05-30 13:34:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality1083660062946511706.gal : 20 ms
[2025-05-30 13:34:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality14143480345914052448.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/CTLCardinality1083660062946511706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14143480345914052448.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.53569e+12,6.51187,219380,2333,169,247320,7797,1238,1.8822e+06,121,75479,0


Converting to forward existential form...Done !
original formula: AF(((AG(AF(((i11.i1.i1.u123.p722==0)||(i20.u186.p1086==1)))) * (((i10.u102.p640==0) + !(A(((i20.u183.p1040==0)||(i0.i1.i2.u17.p187==1)) U...254
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(!(EG(!(((i11.i1.i1.u123.p722==0)||(i20.u186.p1086==1)))))))) * (((i10.u102.p640==0) ...378
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t59, t87, t96, t97, t141, t175, t187, t225, t274, t315, t364, t375, t419, t453...1154
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Graph (trivial) has 635 edges and 600 vertex of which 3 / 600 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1141 edges and 598 vertex of which 589 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 285 transitions
Trivial Post-agglo rules discarded 285 transitions
Performed 285 trivial Post agglomeration. Transition count delta: 285
Iterating post reduction 0 with 285 rules applied. Total rules applied 287 place count 588 transition count 509
Reduce places removed 285 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 293 rules applied. Total rules applied 580 place count 303 transition count 501
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 584 place count 299 transition count 501
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 584 place count 299 transition count 466
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 654 place count 264 transition count 466
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 667 place count 251 transition count 452
Iterating global reduction 3 with 13 rules applied. Total rules applied 680 place count 251 transition count 452
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 680 place count 251 transition count 449
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 686 place count 248 transition count 449
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 691 place count 243 transition count 441
Iterating global reduction 3 with 5 rules applied. Total rules applied 696 place count 243 transition count 441
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 697 place count 243 transition count 440
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 777 place count 203 transition count 400
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 11 rules applied. Total rules applied 788 place count 203 transition count 389
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 793 place count 200 transition count 387
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 802 place count 191 transition count 373
Iterating global reduction 6 with 9 rules applied. Total rules applied 811 place count 191 transition count 373
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 2 rules applied. Total rules applied 813 place count 191 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 814 place count 190 transition count 371
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 816 place count 189 transition count 370
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 817 place count 188 transition count 368
Iterating global reduction 8 with 1 rules applied. Total rules applied 818 place count 188 transition count 368
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 819 place count 187 transition count 366
Iterating global reduction 8 with 1 rules applied. Total rules applied 820 place count 187 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 821 place count 187 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 847 place count 187 transition count 339
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 16 rules applied. Total rules applied 863 place count 187 transition count 323
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 879 place count 171 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 879 place count 171 transition count 320
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 885 place count 168 transition count 320
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 887 place count 167 transition count 319
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 889 place count 165 transition count 317
Applied a total of 889 rules in 54 ms. Remains 165 /600 variables (removed 435) and now considering 317/806 (removed 489) transitions.
// Phase 1: matrix 317 rows 165 cols
[2025-05-30 13:34:52] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:34:52] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-30 13:34:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:34:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 13:34:52] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:34:52] [INFO ] Redundant transitions in 2 ms returned []
Running 294 sub problems to find dead transitions.
[2025-05-30 13:34:52] [INFO ] Invariant cache hit.
[2025-05-30 13:34:52] [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/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 316/481 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 1/482 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 171 constraints, problems are : Problem set: 0 solved, 294 unsolved in 18455 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 316/481 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 294/464 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 1/482 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 465 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48545ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 48545ms
Starting structural reductions in SI_CTL mode, iteration 1 : 165/600 places, 317/806 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48937 ms. Remains : 165/600 places, 317/806 transitions.
[2025-05-30 13:35:41] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:35:41] [INFO ] Flatten gal took : 5 ms
[2025-05-30 13:35:41] [INFO ] Input system was already deterministic with 317 transitions.
[2025-05-30 13:35:41] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:35:41] [INFO ] Flatten gal took : 6 ms
[2025-05-30 13:35:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality9138059420706430751.gal : 1 ms
[2025-05-30 13:35:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality6541502066232722806.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/CTLCardinality9138059420706430751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6541502066232722806.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.09174e+08,0.112649,7836,2,1162,5,15889,6,0,963,10877,0


Converting to forward existential form...Done !
original formula: EG((p152==0))
=> equivalent forward existential formula: [FwdG(Init,(p152==0))] != FALSE
Hit Full ! (commute/partial/dont) 315/0/2
(forward)formula 0,1,0.71529,28296,1,0,10,139827,19,4,5095,56506,8
FORMULA CO4-PT-20-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 806/806 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 599 transition count 806
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 43 place count 557 transition count 763
Iterating global reduction 1 with 42 rules applied. Total rules applied 85 place count 557 transition count 763
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 557 transition count 762
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 119 place count 524 transition count 727
Iterating global reduction 2 with 33 rules applied. Total rules applied 152 place count 524 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 524 transition count 726
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 169 place count 508 transition count 709
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 508 transition count 709
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 187 place count 508 transition count 707
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 196 place count 499 transition count 698
Iterating global reduction 4 with 9 rules applied. Total rules applied 205 place count 499 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 208 place count 499 transition count 695
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 210 place count 497 transition count 693
Iterating global reduction 5 with 2 rules applied. Total rules applied 212 place count 497 transition count 693
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 213 place count 496 transition count 692
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 496 transition count 692
Applied a total of 214 rules in 45 ms. Remains 496 /600 variables (removed 104) and now considering 692/806 (removed 114) transitions.
// Phase 1: matrix 692 rows 496 cols
[2025-05-30 13:35:41] [INFO ] Computed 5 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:35:42] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 13:35:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:35:42] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2025-05-30 13:35:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:36:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 691 unsolved
SMT process timed out in 30136ms, After SMT, problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 30138ms
Starting structural reductions in LTL mode, iteration 1 : 496/600 places, 692/806 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30575 ms. Remains : 496/600 places, 692/806 transitions.
[2025-05-30 13:36:12] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:36:12] [INFO ] Flatten gal took : 10 ms
[2025-05-30 13:36:12] [INFO ] Input system was already deterministic with 692 transitions.
[2025-05-30 13:36:12] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:36:12] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:36:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality5201994213568173950.gal : 2 ms
[2025-05-30 13:36:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality6775113051005759869.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/CTLCardinality5201994213568173950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6775113051005759869.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.30316e+12,18.1021,460208,2,33667,5,1.33007e+06,6,0,2670,2.38488e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 13:36:42] [INFO ] Flatten gal took : 11 ms
[2025-05-30 13:36:42] [INFO ] Applying decomposition
[2025-05-30 13:36: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/graph17407433100220697051.txt' '-o' '/tmp/graph17407433100220697051.bin' '-w' '/tmp/graph17407433100220697051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17407433100220697051.bin' '-l' '-1' '-v' '-w' '/tmp/graph17407433100220697051.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:36:42] [INFO ] Decomposing Gal with order
[2025-05-30 13:36:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:36:42] [INFO ] Removed a total of 416 redundant transitions.
[2025-05-30 13:36:42] [INFO ] Flatten gal took : 38 ms
[2025-05-30 13:36:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 5 ms.
[2025-05-30 13:36:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality3703984641994491758.gal : 4 ms
[2025-05-30 13:36:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12685349714323715228.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/CTLCardinality3703984641994491758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12685349714323715228.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.30316e+12,5.82369,197392,2578,175,248683,9127,1269,1.55428e+06,128,89902,0


Converting to forward existential form...Done !
original formula: A(!(((i11.u144.p868==1) + !(A(((i17.i1.i1.u148.p899==0)||(i6.i0.i1.u45.p344==1)) U EX(TRUE))))) U (i10.u73.p536==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i10.u73.p536==1))))) * !(E(!((i10.u73.p536==1)) U (!(!(((i11.u144.p868==1) + !(!((E(!(EX(TRUE)...290
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t83, t92, t93, t138, t184, t230, t266, t356, t365, t409, t455, t554, t555, t591, t5...1189
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
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
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
Detected timeout of ITS tools.
[2025-05-30 13:37:12] [INFO ] Flatten gal took : 14 ms
[2025-05-30 13:37:12] [INFO ] Flatten gal took : 13 ms
[2025-05-30 13:37:12] [INFO ] Applying decomposition
[2025-05-30 13:37:12] [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/graph2268948559354219313.txt' '-o' '/tmp/graph2268948559354219313.bin' '-w' '/tmp/graph2268948559354219313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2268948559354219313.bin' '-l' '-1' '-v' '-w' '/tmp/graph2268948559354219313.weights' '-q' '0' '-e' '0.001'
[2025-05-30 13:37:12] [INFO ] Decomposing Gal with order
[2025-05-30 13:37:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 13:37:13] [INFO ] Removed a total of 454 redundant transitions.
[2025-05-30 13:37:13] [INFO ] Flatten gal took : 45 ms
[2025-05-30 13:37:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2025-05-30 13:37:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2129563361256592534.gal : 21 ms
[2025-05-30 13:37:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality958683167760367015.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/CTLCardinality2129563361256592534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality958683167760367015.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 -...261
No direction supplied, using forward translation only.
Parsed 6 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.98542e+12,9.02589,260176,3388,235,356777,45296,1340,1.52602e+06,130,392547,0


Converting to forward existential form...Done !
original formula: AG(A((((AX(((i10.u110.p590==1)||(i14.u144.p709==1))) * AF(((i6.i1.i0.u34.p232==0)||(i11.u184.p864==1)))) * (!(EG(EX(TRUE))) * (i9.u96.p50...311
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!((E(!(EG(!((i2.i1.i0.u15.p152==1)))) U !(EG(!((i13.u127.p655==1))))) + EG((i1.u3.p117...624
Reverse transition relation is NOT exact ! Due to transitions t25, t36, t61, t98, t113, t114, t163, t209, t255, t270, t434, t484, t567, t643, t644, t724, t...1390
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
[2025-05-30 14:03:12] [INFO ] Applying decomposition
[2025-05-30 14:03:12] [INFO ] Flatten gal took : 15 ms
[2025-05-30 14:03:12] [INFO ] Decomposing Gal with order
[2025-05-30 14:03:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 14:03:12] [INFO ] Removed a total of 286 redundant transitions.
[2025-05-30 14:03:12] [INFO ] Flatten gal took : 25 ms
[2025-05-30 14:03:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 289 labels/synchronizations in 4 ms.
[2025-05-30 14:03:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10373692004187919177.gal : 2 ms
[2025-05-30 14:03:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality12746892557415923341.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/CTLCardinality10373692004187919177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12746892557415923341.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 6 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.98542e+12,9.00105,228256,1125,4211,172861,231431,317,893063,1780,1.3713e+06,0


Converting to forward existential form...Done !
original formula: AG(A((((AX(((i0.i1.i0.i1.u11.p590==1)||(i0.i1.i0.i1.u11.p709==1))) * AF(((i0.i0.i0.u5.p232==0)||(i0.i1.i0.i1.u11.p864==1)))) * (!(EG(EX(T...369
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!((E(!(EG(!((i0.i0.i0.u5.p152==1)))) U !(EG(!((i0.i1.i0.i1.u11.p655==1))))) + EG((i0.i...706
Reverse transition relation is NOT exact ! Due to transitions t771, i0.t648, i0.t255, i0.i0.i0.t434, i0.i0.i0.u5.t453, i0.i0.i0.u5.t459, i0.i0.i0.u5.t470, ...2030

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-20"
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-20, 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-174854028600529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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