Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 AutonomousCar-PT-10a-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2023-15
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-00
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-01
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-02
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-03
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-04
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-05
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-06
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-07
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-08
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-09
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-10
FORMULA_NAME AutonomousCar-PT-10a-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748660100252

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-31 02:55:01] [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-31 02:55:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 02:55:01] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-05-31 02:55:01] [INFO ] Transformed 97 places.
[2025-05-31 02:55:01] [INFO ] Transformed 1921 transitions.
[2025-05-31 02:55:01] [INFO ] Found NUPN structural information;
[2025-05-31 02:55:01] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Applied a total of 0 rules in 40 ms. Remains 97 /97 variables (removed 0) and now considering 1498/1498 (removed 0) transitions.
[2025-05-31 02:55:01] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2025-05-31 02:55:01] [INFO ] Computed 15 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:02] [INFO ] Implicit Places using invariants in 597 ms returned []
[2025-05-31 02:55:02] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
[2025-05-31 02:55:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:02] [INFO ] State equation strengthened by 403 read => feed constraints.
[2025-05-31 02:55:03] [INFO ] Implicit Places using invariants and state equation in 992 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1633 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 96/97 places, 1498/1498 transitions.
Applied a total of 0 rules in 11 ms. Remains 96 /96 variables (removed 0) and now considering 1498/1498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1700 ms. Remains : 96/97 places, 1498/1498 transitions.
Support contains 62 out of 96 places after structural reductions.
[2025-05-31 02:55:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-31 02:55:04] [INFO ] Flatten gal took : 446 ms
[2025-05-31 02:55:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 02:55:04] [INFO ] Flatten gal took : 240 ms
[2025-05-31 02:55:04] [INFO ] Input system was already deterministic with 1498 transitions.
Support contains 59 out of 96 places (down from 62) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 43 to 42
RANDOM walk for 40000 steps (1821 resets) in 2571 ms. (15 steps per ms) remains 5/42 properties
BEST_FIRST walk for 40002 steps (121 resets) in 154 ms. (258 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (123 resets) in 115 ms. (344 steps per ms) remains 1/4 properties
[2025-05-31 02:55:06] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 96 cols
[2025-05-31 02:55:06] [INFO ] Computed 14 invariants in 20 ms
[2025-05-31 02:55:06] [INFO ] State equation strengthened by 403 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/27 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/93 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 66/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1494/1587 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1587 variables, 402/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1587 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/1591 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1591 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1591 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1592 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1592 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1592 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1593 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1593 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1593 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1593/1593 variables, and 609 constraints, problems are : Problem set: 0 solved, 1 unsolved in 997 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 96/96 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 24/27 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/93 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 66/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1494/1587 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1587 variables, 402/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:08] [INFO ] Deduced a trap along path composed of 2 places in 177 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:08] [INFO ] Deduced a trap along path composed of 2 places in 119 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:08] [INFO ] Deduced a trap along path composed of 2 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1587 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1587 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/1591 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1591 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1591 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1592 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1592 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1592 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1593 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1593 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1593 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1593/1593 variables, and 612 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1779 ms.
Refiners :[Domain max(s): 96/96 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 96/96 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2860ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 217 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Graph (complete) has 1250 edges and 96 vertex of which 94 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 94 transition count 1484
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 85 transition count 1484
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 85 transition count 1482
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 83 transition count 1482
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 37 place count 72 transition count 1371
Iterating global reduction 2 with 11 rules applied. Total rules applied 48 place count 72 transition count 1371
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 70 transition count 1369
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 70 transition count 1359
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 162 place count 60 transition count 1269
Applied a total of 162 rules in 378 ms. Remains 60 /96 variables (removed 36) and now considering 1269/1498 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 60/96 places, 1269/1498 transitions.
RANDOM walk for 40000 steps (19 resets) in 960 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (194 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 827253 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :0 out of 1
Probabilistic random walk after 827253 steps, saw 113021 distinct states, run finished after 3004 ms. (steps per millisecond=275 ) properties seen :0
// Phase 1: matrix 1269 rows 60 cols
[2025-05-31 02:55:13] [INFO ] Computed 15 invariants in 14 ms
[2025-05-31 02:55:13] [INFO ] State equation strengthened by 212 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/60 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1269/1329 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1329 variables, 212/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1329 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1329 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:14] [INFO ] Deduced a trap composed of 5 places in 555 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 39/60 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1269/1329 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1329 variables, 212/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:14] [INFO ] Deduced a trap along path composed of 2 places in 180 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:15] [INFO ] Deduced a trap along path composed of 2 places in 140 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:15] [INFO ] Deduced a trap along path composed of 2 places in 116 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:15] [INFO ] Deduced a trap along path composed of 2 places in 80 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:15] [INFO ] Deduced a trap along path composed of 2 places in 94 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:15] [INFO ] Deduced a trap along path composed of 2 places in 60 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1329 variables, 6/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1329 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1329 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1329/1329 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 212/212 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 2538ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 203 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1269/1269 transitions.
Applied a total of 0 rules in 56 ms. Remains 60 /60 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 60/60 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 1269/1269 transitions.
Applied a total of 0 rules in 54 ms. Remains 60 /60 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2025-05-31 02:55:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:16] [INFO ] Implicit Places using invariants in 684 ms returned [1, 58, 59]
[2025-05-31 02:55:16] [INFO ] Actually due to overlaps returned [1, 58]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 689 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/60 places, 1269/1269 transitions.
Applied a total of 0 rules in 52 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 796 ms. Remains : 58/60 places, 1269/1269 transitions.
RANDOM walk for 40000 steps (14 resets) in 1116 ms. (35 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (192 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 899743 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :0 out of 1
Probabilistic random walk after 899743 steps, saw 121745 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
// Phase 1: matrix 1269 rows 58 cols
[2025-05-31 02:55:20] [INFO ] Computed 13 invariants in 12 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/58 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1269/1327 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:20] [INFO ] Deduced a trap along path composed of 2 places in 240 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1327 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1327 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1327/1327 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 697 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:21] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 37/58 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1269/1327 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1327 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:21] [INFO ] Deduced a trap along path composed of 2 places in 120 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:21] [INFO ] Deduced a trap along path composed of 2 places in 124 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:21] [INFO ] Deduced a trap along path composed of 2 places in 92 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:21] [INFO ] Deduced a trap along path composed of 2 places in 72 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:22] [INFO ] Deduced a trap along path composed of 2 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1327 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1327 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1327 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1327/1327 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 1975ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 56 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 58/58 places, 1269/1269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 1269/1269 transitions.
Applied a total of 0 rules in 52 ms. Remains 58 /58 variables (removed 0) and now considering 1269/1269 (removed 0) transitions.
[2025-05-31 02:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:22] [INFO ] Implicit Places using invariants in 480 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 485 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/58 places, 1269/1269 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 1268
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 1268
Applied a total of 2 rules in 74 ms. Remains 56 /57 variables (removed 1) and now considering 1268/1269 (removed 1) transitions.
// Phase 1: matrix 1268 rows 56 cols
[2025-05-31 02:55:22] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:23] [INFO ] Implicit Places using invariants in 525 ms returned []
[2025-05-31 02:55:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:24] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 56/58 places, 1268/1269 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2041 ms. Remains : 56/58 places, 1268/1269 transitions.
RANDOM walk for 40000 steps (11 resets) in 672 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (193 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 895051 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 1
Probabilistic random walk after 895051 steps, saw 121228 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2025-05-31 02:55:27] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1268/1324 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:28] [INFO ] Deduced a trap along path composed of 2 places in 99 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1324 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/56 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1268/1324 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:28] [INFO ] Deduced a trap along path composed of 2 places in 242 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:29] [INFO ] Deduced a trap along path composed of 2 places in 153 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:29] [INFO ] Deduced a trap along path composed of 2 places in 133 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:29] [INFO ] Deduced a trap along path composed of 2 places in 105 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:29] [INFO ] Deduced a trap along path composed of 2 places in 104 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:29] [INFO ] Deduced a trap along path composed of 2 places in 61 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:29] [INFO ] Deduced a trap along path composed of 2 places in 53 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 02:55:29] [INFO ] Deduced a trap along path composed of 2 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1324 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1324 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1616 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 2244ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2570 steps, including 147 resets, run visited all 1 properties in 57 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 62 ms.
[2025-05-31 02:55:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-31 02:55:30] [INFO ] Flatten gal took : 228 ms
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-31 02:55:30] [INFO ] Flatten gal took : 182 ms
[2025-05-31 02:55:30] [INFO ] Input system was already deterministic with 1498 transitions.
Support contains 58 out of 96 places (down from 59) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 88 transition count 1410
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 88 transition count 1410
Applied a total of 16 rules in 17 ms. Remains 88 /96 variables (removed 8) and now considering 1410/1498 (removed 88) transitions.
[2025-05-31 02:55:30] [INFO ] Flow matrix only has 1409 transitions (discarded 1 similar events)
// Phase 1: matrix 1409 rows 88 cols
[2025-05-31 02:55:30] [INFO ] Computed 14 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:31] [INFO ] Implicit Places using invariants in 536 ms returned []
[2025-05-31 02:55:31] [INFO ] Flow matrix only has 1409 transitions (discarded 1 similar events)
[2025-05-31 02:55:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:55:31] [INFO ] State equation strengthened by 323 read => feed constraints.
[2025-05-31 02:55:32] [INFO ] Implicit Places using invariants and state equation in 981 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1526 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/96 places, 1410/1498 transitions.
Applied a total of 0 rules in 9 ms. Remains 87 /87 variables (removed 0) and now considering 1410/1410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1554 ms. Remains : 87/96 places, 1410/1498 transitions.
[2025-05-31 02:55:32] [INFO ] Flatten gal took : 185 ms
[2025-05-31 02:55:32] [INFO ] Flatten gal took : 170 ms
[2025-05-31 02:55:33] [INFO ] Input system was already deterministic with 1410 transitions.
[2025-05-31 02:55:33] [INFO ] Flatten gal took : 170 ms
[2025-05-31 02:55:33] [INFO ] Flatten gal took : 172 ms
[2025-05-31 02:55:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality572854717267183480.gal : 69 ms
[2025-05-31 02:55:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9141407675871880071.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality572854717267183480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9141407675871880071.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.
Detected timeout of ITS tools.
[2025-05-31 02:56:03] [INFO ] Flatten gal took : 190 ms
[2025-05-31 02:56:03] [INFO ] Applying decomposition
[2025-05-31 02:56:03] [INFO ] Flatten gal took : 168 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/graph6151014450239073365.txt' '-o' '/tmp/graph6151014450239073365.bin' '-w' '/tmp/graph6151014450239073365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6151014450239073365.bin' '-l' '-1' '-v' '-w' '/tmp/graph6151014450239073365.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:56:04] [INFO ] Decomposing Gal with order
[2025-05-31 02:56:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:56:05] [INFO ] Removed a total of 12943 redundant transitions.
[2025-05-31 02:56:05] [INFO ] Flatten gal took : 487 ms
[2025-05-31 02:56:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 177 ms.
[2025-05-31 02:56:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality6750645044442508521.gal : 22 ms
[2025-05-31 02:56:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality1690580199145362785.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/CTLCardinality6750645044442508521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1690580199145362785.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 96 transition count 1488
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 86 transition count 1488
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 86 transition count 1487
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 85 transition count 1487
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 75 transition count 1377
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 75 transition count 1377
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 73 transition count 1375
Applied a total of 46 rules in 210 ms. Remains 73 /96 variables (removed 23) and now considering 1375/1498 (removed 123) transitions.
[2025-05-31 02:56:35] [INFO ] Flow matrix only has 1374 transitions (discarded 1 similar events)
// Phase 1: matrix 1374 rows 73 cols
[2025-05-31 02:56:35] [INFO ] Computed 14 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:56:36] [INFO ] Implicit Places using invariants in 712 ms returned [1, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 718 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/96 places, 1375/1498 transitions.
Applied a total of 0 rules in 90 ms. Remains 71 /71 variables (removed 0) and now considering 1375/1375 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1020 ms. Remains : 71/96 places, 1375/1498 transitions.
[2025-05-31 02:56:36] [INFO ] Flatten gal took : 159 ms
[2025-05-31 02:56:36] [INFO ] Flatten gal took : 166 ms
[2025-05-31 02:56:37] [INFO ] Input system was already deterministic with 1375 transitions.
[2025-05-31 02:56:37] [INFO ] Flatten gal took : 171 ms
[2025-05-31 02:56:37] [INFO ] Flatten gal took : 169 ms
[2025-05-31 02:56:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality12011252174489140779.gal : 23 ms
[2025-05-31 02:56:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality11938300655451105438.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/CTLCardinality12011252174489140779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11938300655451105438.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.
Detected timeout of ITS tools.
[2025-05-31 02:57:07] [INFO ] Flatten gal took : 154 ms
[2025-05-31 02:57:07] [INFO ] Applying decomposition
[2025-05-31 02:57:07] [INFO ] Flatten gal took : 155 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/graph2402319924636985813.txt' '-o' '/tmp/graph2402319924636985813.bin' '-w' '/tmp/graph2402319924636985813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2402319924636985813.bin' '-l' '-1' '-v' '-w' '/tmp/graph2402319924636985813.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:57:08] [INFO ] Decomposing Gal with order
[2025-05-31 02:57:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:57:08] [INFO ] Removed a total of 12317 redundant transitions.
[2025-05-31 02:57:08] [INFO ] Flatten gal took : 246 ms
[2025-05-31 02:57:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 93 ms.
[2025-05-31 02:57:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality14051393702857041835.gal : 10 ms
[2025-05-31 02:57:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality4250792544277374834.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/CTLCardinality14051393702857041835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4250792544277374834.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.26481e+09,15.4331,610140,12550,102,255299,1409,3288,6.36304e+06,83,8447,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 1432
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 1432
Applied a total of 12 rules in 10 ms. Remains 90 /96 variables (removed 6) and now considering 1432/1498 (removed 66) transitions.
[2025-05-31 02:57:38] [INFO ] Flow matrix only has 1431 transitions (discarded 1 similar events)
// Phase 1: matrix 1431 rows 90 cols
[2025-05-31 02:57:38] [INFO ] Computed 14 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:57:39] [INFO ] Implicit Places using invariants in 584 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 587 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 1432/1498 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 1432/1432 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 604 ms. Remains : 89/96 places, 1432/1498 transitions.
[2025-05-31 02:57:39] [INFO ] Flatten gal took : 169 ms
[2025-05-31 02:57:39] [INFO ] Flatten gal took : 191 ms
[2025-05-31 02:57:40] [INFO ] Input system was already deterministic with 1432 transitions.
[2025-05-31 02:57:40] [INFO ] Flatten gal took : 174 ms
[2025-05-31 02:57:40] [INFO ] Flatten gal took : 174 ms
[2025-05-31 02:57:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13007051377744578393.gal : 23 ms
[2025-05-31 02:57:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality16060026346864317596.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/CTLCardinality13007051377744578393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16060026346864317596.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.
Detected timeout of ITS tools.
[2025-05-31 02:58:10] [INFO ] Flatten gal took : 157 ms
[2025-05-31 02:58:10] [INFO ] Applying decomposition
[2025-05-31 02:58:11] [INFO ] Flatten gal took : 184 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/graph9035309510980977524.txt' '-o' '/tmp/graph9035309510980977524.bin' '-w' '/tmp/graph9035309510980977524.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9035309510980977524.bin' '-l' '-1' '-v' '-w' '/tmp/graph9035309510980977524.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:58:11] [INFO ] Decomposing Gal with order
[2025-05-31 02:58:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:58:11] [INFO ] Removed a total of 12904 redundant transitions.
[2025-05-31 02:58:11] [INFO ] Flatten gal took : 199 ms
[2025-05-31 02:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 49 ms.
[2025-05-31 02:58:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality9567133260526511206.gal : 5 ms
[2025-05-31 02:58:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8042084865830728296.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/CTLCardinality9567133260526511206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8042084865830728296.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 87 transition count 1399
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 87 transition count 1399
Applied a total of 18 rules in 10 ms. Remains 87 /96 variables (removed 9) and now considering 1399/1498 (removed 99) transitions.
[2025-05-31 02:58:41] [INFO ] Flow matrix only has 1398 transitions (discarded 1 similar events)
// Phase 1: matrix 1398 rows 87 cols
[2025-05-31 02:58:41] [INFO ] Computed 14 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:58:42] [INFO ] Implicit Places using invariants in 653 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 658 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/96 places, 1399/1498 transitions.
Applied a total of 0 rules in 9 ms. Remains 86 /86 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 677 ms. Remains : 86/96 places, 1399/1498 transitions.
[2025-05-31 02:58:42] [INFO ] Flatten gal took : 172 ms
[2025-05-31 02:58:42] [INFO ] Flatten gal took : 155 ms
[2025-05-31 02:58:43] [INFO ] Input system was already deterministic with 1399 transitions.
[2025-05-31 02:58:43] [INFO ] Flatten gal took : 154 ms
[2025-05-31 02:58:43] [INFO ] Flatten gal took : 181 ms
[2025-05-31 02:58:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5259953525622002684.gal : 20 ms
[2025-05-31 02:58:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality2119360021513902207.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/CTLCardinality5259953525622002684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2119360021513902207.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.
Detected timeout of ITS tools.
[2025-05-31 02:59:13] [INFO ] Flatten gal took : 160 ms
[2025-05-31 02:59:13] [INFO ] Applying decomposition
[2025-05-31 02:59:13] [INFO ] Flatten gal took : 160 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/graph9629832283294864001.txt' '-o' '/tmp/graph9629832283294864001.bin' '-w' '/tmp/graph9629832283294864001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9629832283294864001.bin' '-l' '-1' '-v' '-w' '/tmp/graph9629832283294864001.weights' '-q' '0' '-e' '0.001'
[2025-05-31 02:59:14] [INFO ] Decomposing Gal with order
[2025-05-31 02:59:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 02:59:14] [INFO ] Removed a total of 12335 redundant transitions.
[2025-05-31 02:59:14] [INFO ] Flatten gal took : 222 ms
[2025-05-31 02:59:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 49 ms.
[2025-05-31 02:59:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10564151641594393110.gal : 5 ms
[2025-05-31 02:59:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality10312109814467627428.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/CTLCardinality10564151641594393110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10312109814467627428.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.54952e+10,24.5599,872836,18020,158,483623,2295,1748,9.38282e+06,90,13426,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 94 transition count 1486
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 83 transition count 1486
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 33 place count 73 transition count 1386
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 73 transition count 1386
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 50 place count 69 transition count 1383
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 69 transition count 1382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 68 transition count 1382
Applied a total of 52 rules in 140 ms. Remains 68 /96 variables (removed 28) and now considering 1382/1498 (removed 116) transitions.
// Phase 1: matrix 1382 rows 68 cols
[2025-05-31 02:59:44] [INFO ] Computed 11 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:59:45] [INFO ] Implicit Places using invariants in 522 ms returned []
[2025-05-31 02:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 02:59:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 02:59:45] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 02:59:46] [INFO ] Redundant transitions in 88 ms returned []
Running 1381 sub problems to find dead transitions.
[2025-05-31 02:59:46] [INFO ] Invariant cache hit.
[2025-05-31 02:59:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (OVERLAPS) 1381/1449 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:03] [INFO ] Deduced a trap composed of 3 places in 643 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:00:19] [INFO ] Deduced a trap composed of 22 places in 613 ms of which 39 ms to minimize.
SMT process timed out in 33228ms, After SMT, problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 33241ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/96 places, 1382/1498 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34718 ms. Remains : 68/96 places, 1382/1498 transitions.
[2025-05-31 03:00:19] [INFO ] Flatten gal took : 148 ms
[2025-05-31 03:00:19] [INFO ] Flatten gal took : 153 ms
[2025-05-31 03:00:19] [INFO ] Input system was already deterministic with 1382 transitions.
[2025-05-31 03:00:20] [INFO ] Flatten gal took : 152 ms
[2025-05-31 03:00:20] [INFO ] Flatten gal took : 152 ms
[2025-05-31 03:00:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality14729396920226530986.gal : 20 ms
[2025-05-31 03:00:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality16397089300749486338.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/CTLCardinality14729396920226530986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16397089300749486338.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.
Detected timeout of ITS tools.
[2025-05-31 03:00:50] [INFO ] Flatten gal took : 155 ms
[2025-05-31 03:00:50] [INFO ] Applying decomposition
[2025-05-31 03:00:50] [INFO ] Flatten gal took : 153 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/graph3482038875886389750.txt' '-o' '/tmp/graph3482038875886389750.bin' '-w' '/tmp/graph3482038875886389750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3482038875886389750.bin' '-l' '-1' '-v' '-w' '/tmp/graph3482038875886389750.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:00:50] [INFO ] Decomposing Gal with order
[2025-05-31 03:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:00:51] [INFO ] Removed a total of 11823 redundant transitions.
[2025-05-31 03:00:51] [INFO ] Flatten gal took : 168 ms
[2025-05-31 03:00:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 84 ms.
[2025-05-31 03:00:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality11663511286624573578.gal : 8 ms
[2025-05-31 03:00:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality13369938079116929723.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/CTLCardinality11663511286624573578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13369938079116929723.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.03593e+09,12.8745,438496,6720,129,176298,1634,3236,4.66189e+06,82,10204,0


Converting to forward existential form...Done !
original formula: EG(((i0.u14.p66==0)||(u10.p51==1)))
=> equivalent forward existential formula: [FwdG(Init,((i0.u14.p66==0)||(u10.p51==1)))] != FALSE
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.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 85 transition count 1387
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 85 transition count 1387
Applied a total of 22 rules in 22 ms. Remains 85 /96 variables (removed 11) and now considering 1387/1498 (removed 111) transitions.
// Phase 1: matrix 1387 rows 85 cols
[2025-05-31 03:01:21] [INFO ] Computed 13 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:01:21] [INFO ] Implicit Places using invariants in 614 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 619 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/96 places, 1387/1498 transitions.
Applied a total of 0 rules in 11 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 653 ms. Remains : 84/96 places, 1387/1498 transitions.
[2025-05-31 03:01:22] [INFO ] Flatten gal took : 115 ms
[2025-05-31 03:01:22] [INFO ] Flatten gal took : 120 ms
[2025-05-31 03:01:22] [INFO ] Input system was already deterministic with 1387 transitions.
[2025-05-31 03:01:22] [INFO ] Flatten gal took : 117 ms
[2025-05-31 03:01:22] [INFO ] Flatten gal took : 117 ms
[2025-05-31 03:01:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6121133263242943683.gal : 21 ms
[2025-05-31 03:01:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality17839901896256775952.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/CTLCardinality6121133263242943683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17839901896256775952.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.
Detected timeout of ITS tools.
[2025-05-31 03:01:52] [INFO ] Flatten gal took : 115 ms
[2025-05-31 03:01:52] [INFO ] Applying decomposition
[2025-05-31 03:01:53] [INFO ] Flatten gal took : 139 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/graph5458893780109243961.txt' '-o' '/tmp/graph5458893780109243961.bin' '-w' '/tmp/graph5458893780109243961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5458893780109243961.bin' '-l' '-1' '-v' '-w' '/tmp/graph5458893780109243961.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:01:53] [INFO ] Decomposing Gal with order
[2025-05-31 03:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:01:53] [INFO ] Removed a total of 12828 redundant transitions.
[2025-05-31 03:01:53] [INFO ] Flatten gal took : 182 ms
[2025-05-31 03:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 44 ms.
[2025-05-31 03:01:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality5857391950794523338.gal : 4 ms
[2025-05-31 03:01:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality1594073247629929931.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/CTLCardinality5857391950794523338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1594073247629929931.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33267e+10,11.2887,438180,10050,124,261499,2352,1735,4.42307e+06,86,11035,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t350, t351, t352, t353, t354, t355, t356, t357, t358, t359, t360, t361, t362, t363, t364, t36...3685
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 85 transition count 1387
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 85 transition count 1387
Applied a total of 22 rules in 19 ms. Remains 85 /96 variables (removed 11) and now considering 1387/1498 (removed 111) transitions.
[2025-05-31 03:02:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:02:24] [INFO ] Implicit Places using invariants in 594 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 598 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/96 places, 1387/1498 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 1387/1387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 625 ms. Remains : 84/96 places, 1387/1498 transitions.
[2025-05-31 03:02:24] [INFO ] Flatten gal took : 118 ms
[2025-05-31 03:02:24] [INFO ] Flatten gal took : 126 ms
[2025-05-31 03:02:24] [INFO ] Input system was already deterministic with 1387 transitions.
[2025-05-31 03:02:24] [INFO ] Flatten gal took : 124 ms
[2025-05-31 03:02:25] [INFO ] Flatten gal took : 125 ms
[2025-05-31 03:02:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16415673160047776412.gal : 22 ms
[2025-05-31 03:02:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3577433383332762879.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/CTLCardinality16415673160047776412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3577433383332762879.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.
Detected timeout of ITS tools.
[2025-05-31 03:02:55] [INFO ] Flatten gal took : 119 ms
[2025-05-31 03:02:55] [INFO ] Applying decomposition
[2025-05-31 03:02:55] [INFO ] Flatten gal took : 119 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/graph8919741706711283560.txt' '-o' '/tmp/graph8919741706711283560.bin' '-w' '/tmp/graph8919741706711283560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8919741706711283560.bin' '-l' '-1' '-v' '-w' '/tmp/graph8919741706711283560.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:02:55] [INFO ] Decomposing Gal with order
[2025-05-31 03:02:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:02:56] [INFO ] Removed a total of 12316 redundant transitions.
[2025-05-31 03:02:56] [INFO ] Flatten gal took : 182 ms
[2025-05-31 03:02:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 42 ms.
[2025-05-31 03:02:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6113094048452401651.gal : 4 ms
[2025-05-31 03:02:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality577795811185485265.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/CTLCardinality6113094048452401651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality577795811185485265.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 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.33267e+10,8.06017,294596,7484,130,314433,3283,1749,2.46477e+06,86,21356,0


Converting to forward existential form...Done !
original formula: A((((u15.p69==0)||(u19.p77==1))||(u11.p49==0)) U E(((u22.p13==1) + EG(((u22.p11==0)||(u9.p47==1)))) U !(AX((i4.u3.p21!=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(((u22.p13==1) + EG(((u22.p11==0)||(u9.p47==1)))) U !(!(EX(!((i4.u3.p21!=1)))))))))) * !(E(!(E...388
Reverse transition relation is NOT exact ! Due to transitions t350, t351, t354, t355, t358, t359, t362, t363, t366, t367, t370, t371, t374, t375, t378, t37...3684
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 96 transition count 1493
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 91 transition count 1493
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 91 transition count 1492
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 90 transition count 1492
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 20 place count 82 transition count 1414
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 82 transition count 1414
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 2 with 4 rules applied. Total rules applied 32 place count 80 transition count 1412
Applied a total of 32 rules in 135 ms. Remains 80 /96 variables (removed 16) and now considering 1412/1498 (removed 86) transitions.
// Phase 1: matrix 1412 rows 80 cols
[2025-05-31 03:03:26] [INFO ] Computed 13 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:03:26] [INFO ] Implicit Places using invariants in 603 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 610 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/96 places, 1412/1498 transitions.
Applied a total of 0 rules in 82 ms. Remains 79 /79 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 827 ms. Remains : 79/96 places, 1412/1498 transitions.
[2025-05-31 03:03:27] [INFO ] Flatten gal took : 117 ms
[2025-05-31 03:03:27] [INFO ] Flatten gal took : 125 ms
[2025-05-31 03:03:27] [INFO ] Input system was already deterministic with 1412 transitions.
[2025-05-31 03:03:27] [INFO ] Flatten gal took : 118 ms
[2025-05-31 03:03:27] [INFO ] Flatten gal took : 120 ms
[2025-05-31 03:03:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3502044207969098395.gal : 21 ms
[2025-05-31 03:03:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality16558554034583355950.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/CTLCardinality3502044207969098395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16558554034583355950.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.0726e+09,29.9898,817240,2,27403,5,1.63146e+06,6,0,1724,1.51078e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 03:03:57] [INFO ] Flatten gal took : 115 ms
[2025-05-31 03:03:57] [INFO ] Applying decomposition
[2025-05-31 03:03:58] [INFO ] Flatten gal took : 117 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/graph1661757764097827725.txt' '-o' '/tmp/graph1661757764097827725.bin' '-w' '/tmp/graph1661757764097827725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1661757764097827725.bin' '-l' '-1' '-v' '-w' '/tmp/graph1661757764097827725.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:03:58] [INFO ] Decomposing Gal with order
[2025-05-31 03:03:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:03:58] [INFO ] Removed a total of 12374 redundant transitions.
[2025-05-31 03:03:58] [INFO ] Flatten gal took : 196 ms
[2025-05-31 03:03:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 59 ms.
[2025-05-31 03:03:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality607544845794489896.gal : 7 ms
[2025-05-31 03:03:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality12903355093405284221.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/CTLCardinality607544845794489896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12903355093405284221.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 96 transition count 1488
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 86 transition count 1488
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 27 place count 79 transition count 1421
Iterating global reduction 2 with 7 rules applied. Total rules applied 34 place count 79 transition count 1421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 76 transition count 1418
Applied a total of 40 rules in 144 ms. Remains 76 /96 variables (removed 20) and now considering 1418/1498 (removed 80) transitions.
// Phase 1: matrix 1418 rows 76 cols
[2025-05-31 03:04:28] [INFO ] Computed 13 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:04:29] [INFO ] Implicit Places using invariants in 611 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 617 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 75/96 places, 1418/1498 transitions.
Applied a total of 0 rules in 94 ms. Remains 75 /75 variables (removed 0) and now considering 1418/1418 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 855 ms. Remains : 75/96 places, 1418/1498 transitions.
[2025-05-31 03:04:29] [INFO ] Flatten gal took : 141 ms
[2025-05-31 03:04:29] [INFO ] Flatten gal took : 152 ms
[2025-05-31 03:04:30] [INFO ] Input system was already deterministic with 1418 transitions.
[2025-05-31 03:04:30] [INFO ] Flatten gal took : 148 ms
[2025-05-31 03:04:30] [INFO ] Flatten gal took : 147 ms
[2025-05-31 03:04:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality12860171249860372056.gal : 20 ms
[2025-05-31 03:04:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality9992554394724136487.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/CTLCardinality12860171249860372056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9992554394724136487.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.
Detected timeout of ITS tools.
[2025-05-31 03:05:00] [INFO ] Flatten gal took : 153 ms
[2025-05-31 03:05:00] [INFO ] Applying decomposition
[2025-05-31 03:05:00] [INFO ] Flatten gal took : 153 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/graph5429580373674470960.txt' '-o' '/tmp/graph5429580373674470960.bin' '-w' '/tmp/graph5429580373674470960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5429580373674470960.bin' '-l' '-1' '-v' '-w' '/tmp/graph5429580373674470960.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:05:01] [INFO ] Decomposing Gal with order
[2025-05-31 03:05:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:05:01] [INFO ] Removed a total of 11880 redundant transitions.
[2025-05-31 03:05:01] [INFO ] Flatten gal took : 187 ms
[2025-05-31 03:05:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 57 ms.
[2025-05-31 03:05:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality4815521250638859330.gal : 7 ms
[2025-05-31 03:05:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality13356734314140684318.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/CTLCardinality4815521250638859330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13356734314140684318.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.15205e+09,1.41177,64004,6614,132,114076,1426,2303,264541,88,8973,0


Converting to forward existential form...Done !
original formula: AF(!(E(!((((u17.p71==0)||(u3.p27==1))&&(!(((i0.u0.p18==0)||(u21.p11==0))||(i0.u4.p32==1))))) U AF((E((u12.p60==1) U (i4.u10.p53==1)) * ((...184
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!((((u17.p71==0)||(u3.p27==1))&&(!(((i0.u0.p18==0)||(u21.p11==0))||(i0.u4.p32==1))))) U !(EG(!(...235
Reverse transition relation is NOT exact ! Due to transitions t107, t109, t115, t117, t123, t125, t131, t133, t235, t237, t243, t245, t251, t253, t259, t26...867
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 94 transition count 1487
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 84 transition count 1487
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 31 place count 74 transition count 1377
Iterating global reduction 2 with 10 rules applied. Total rules applied 41 place count 74 transition count 1377
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 48 place count 70 transition count 1374
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 70 transition count 1373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 69 transition count 1373
Applied a total of 50 rules in 121 ms. Remains 69 /96 variables (removed 27) and now considering 1373/1498 (removed 125) transitions.
[2025-05-31 03:05:31] [INFO ] Flow matrix only has 1372 transitions (discarded 1 similar events)
// Phase 1: matrix 1372 rows 69 cols
[2025-05-31 03:05:31] [INFO ] Computed 12 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:05:32] [INFO ] Implicit Places using invariants in 547 ms returned []
[2025-05-31 03:05:32] [INFO ] Flow matrix only has 1372 transitions (discarded 1 similar events)
[2025-05-31 03:05:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:05:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-31 03:05:33] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1404 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 03:05:33] [INFO ] Redundant transitions in 36 ms returned []
Running 1372 sub problems to find dead transitions.
[2025-05-31 03:05:33] [INFO ] Flow matrix only has 1372 transitions (discarded 1 similar events)
[2025-05-31 03:05:33] [INFO ] Invariant cache hit.
[2025-05-31 03:05:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:05:39] [INFO ] Deduced a trap composed of 3 places in 547 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 03:05:46] [INFO ] Deduced a trap composed of 22 places in 686 ms of which 43 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 3 (OVERLAPS) 1371/1440 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1440/1441 variables, and 83 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1372/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1372 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 3 (OVERLAPS) 1371/1440 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1440 variables, 7/90 constraints. Problems are: Problem set: 0 solved, 1372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1440/1441 variables, and 90 constraints, problems are : Problem set: 0 solved, 1372 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1372/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62634ms problems are : Problem set: 0 solved, 1372 unsolved
Search for dead transitions found 0 dead transitions in 62639ms
Starting structural reductions in SI_CTL mode, iteration 1 : 69/96 places, 1373/1498 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64214 ms. Remains : 69/96 places, 1373/1498 transitions.
[2025-05-31 03:06:35] [INFO ] Flatten gal took : 146 ms
[2025-05-31 03:06:36] [INFO ] Flatten gal took : 152 ms
[2025-05-31 03:06:36] [INFO ] Input system was already deterministic with 1373 transitions.
[2025-05-31 03:06:36] [INFO ] Flatten gal took : 168 ms
[2025-05-31 03:06:36] [INFO ] Flatten gal took : 154 ms
[2025-05-31 03:06:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality2918627753403620714.gal : 21 ms
[2025-05-31 03:06:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality7234659999457243413.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/CTLCardinality2918627753403620714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7234659999457243413.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.03982e+09,24.0831,535968,2,11949,5,1.00687e+06,6,0,1644,899262,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 03:07:06] [INFO ] Flatten gal took : 152 ms
[2025-05-31 03:07:06] [INFO ] Applying decomposition
[2025-05-31 03:07:07] [INFO ] Flatten gal took : 157 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/graph1459681280372515927.txt' '-o' '/tmp/graph1459681280372515927.bin' '-w' '/tmp/graph1459681280372515927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1459681280372515927.bin' '-l' '-1' '-v' '-w' '/tmp/graph1459681280372515927.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:07:07] [INFO ] Decomposing Gal with order
[2025-05-31 03:07:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:07:07] [INFO ] Removed a total of 11804 redundant transitions.
[2025-05-31 03:07:07] [INFO ] Flatten gal took : 161 ms
[2025-05-31 03:07:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 54 ms.
[2025-05-31 03:07:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality12330416327385142971.gal : 7 ms
[2025-05-31 03:07:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality2624432965080743454.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/CTLCardinality12330416327385142971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2624432965080743454.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.03982e+09,5.03237,176680,6625,92,192883,1631,3244,1.34628e+06,85,9240,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(((i9.u22.p93==0)||(u11.p49==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((i9.u22.p93==0)||(u11.p49==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51,...6512
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 1498/1498 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 88 transition count 1410
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 88 transition count 1410
Applied a total of 16 rules in 16 ms. Remains 88 /96 variables (removed 8) and now considering 1410/1498 (removed 88) transitions.
[2025-05-31 03:07:37] [INFO ] Flow matrix only has 1409 transitions (discarded 1 similar events)
// Phase 1: matrix 1409 rows 88 cols
[2025-05-31 03:07:37] [INFO ] Computed 14 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 03:07:38] [INFO ] Implicit Places using invariants in 557 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 561 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/96 places, 1410/1498 transitions.
Applied a total of 0 rules in 9 ms. Remains 87 /87 variables (removed 0) and now considering 1410/1410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 587 ms. Remains : 87/96 places, 1410/1498 transitions.
[2025-05-31 03:07:38] [INFO ] Flatten gal took : 155 ms
[2025-05-31 03:07:38] [INFO ] Flatten gal took : 161 ms
[2025-05-31 03:07:38] [INFO ] Input system was already deterministic with 1410 transitions.
[2025-05-31 03:07:39] [INFO ] Flatten gal took : 156 ms
[2025-05-31 03:07:39] [INFO ] Flatten gal took : 157 ms
[2025-05-31 03:07:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5065285702543453497.gal : 20 ms
[2025-05-31 03:07:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality791548701333518615.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/CTLCardinality5065285702543453497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality791548701333518615.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.
Detected timeout of ITS tools.
[2025-05-31 03:08:09] [INFO ] Flatten gal took : 182 ms
[2025-05-31 03:08:09] [INFO ] Applying decomposition
[2025-05-31 03:08:09] [INFO ] Flatten gal took : 155 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/graph10233260837113470172.txt' '-o' '/tmp/graph10233260837113470172.bin' '-w' '/tmp/graph10233260837113470172.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10233260837113470172.bin' '-l' '-1' '-v' '-w' '/tmp/graph10233260837113470172.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:08:09] [INFO ] Decomposing Gal with order
[2025-05-31 03:08:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:08:10] [INFO ] Removed a total of 12866 redundant transitions.
[2025-05-31 03:08:10] [INFO ] Flatten gal took : 181 ms
[2025-05-31 03:08:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 61 ms.
[2025-05-31 03:08:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality551483573661474970.gal : 8 ms
[2025-05-31 03:08:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality3118372486388615107.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/CTLCardinality551483573661474970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3118372486388615107.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 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.80218e+10,20.9429,671412,14892,138,367755,3448,3283,6.37714e+06,87,15522,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 03:08:40] [INFO ] Flatten gal took : 163 ms
[2025-05-31 03:08:40] [INFO ] Flatten gal took : 164 ms
[2025-05-31 03:08:40] [INFO ] Applying decomposition
[2025-05-31 03:08:40] [INFO ] Flatten gal took : 189 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/graph4172853199373812984.txt' '-o' '/tmp/graph4172853199373812984.bin' '-w' '/tmp/graph4172853199373812984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4172853199373812984.bin' '-l' '-1' '-v' '-w' '/tmp/graph4172853199373812984.weights' '-q' '0' '-e' '0.001'
[2025-05-31 03:08:41] [INFO ] Decomposing Gal with order
[2025-05-31 03:08:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:08:41] [INFO ] Removed a total of 12614 redundant transitions.
[2025-05-31 03:08:41] [INFO ] Flatten gal took : 213 ms
[2025-05-31 03:08:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 83 ms.
[2025-05-31 03:08:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality3286333244289556254.gal : 8 ms
[2025-05-31 03:08:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3326472550083180922.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/CTLCardinality3286333244289556254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3326472550083180922.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.06653e+10,1186.37,9377544,39507,142,2.22998e+06,803,5410,1.16539e+08,90,3559,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-31 03:33:15] [INFO ] Applying decomposition
[2025-05-31 03:33:15] [INFO ] Flatten gal took : 166 ms
[2025-05-31 03:33:15] [INFO ] Decomposing Gal with order
[2025-05-31 03:33:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 03:33:15] [INFO ] Removed a total of 12795 redundant transitions.
[2025-05-31 03:33:16] [INFO ] Flatten gal took : 246 ms
[2025-05-31 03:33:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 28 ms.
[2025-05-31 03:33:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality9406928027549497114.gal : 1 ms
[2025-05-31 03:33:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality2656538277544939286.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/CTLCardinality9406928027549497114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2656538277544939286.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.06653e+10,0.073375,7012,150,96,7750,479,122,8289,82,1985,0


Converting to forward existential form...Done !
original formula: AG(A(((!((u10.p67==0)||(u1.p1==1)))||(((u9.p56==0)||(u2.p13==1))&&(((u15.p94==0)||(u4.p23==1))||(u4.p27==1)))) U ((u2.p12==0) * AX((u15.p...165
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(((u2.p12==0) * !(EX(!((u15.p93==1))))))) * !(((!((u10.p67==0)||(u1.p1==1)))||(((u9.p...541
Reverse transition relation is NOT exact ! Due to transitions t61, t101, t171, t181, t231, t271, t311, t361, t411, t431, t1495, u2.t457, u3.t50, u3.t51, u3...497
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,0.538478,28900,1,0,62449,850,830,67490,369,3930,85786
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG(((u15.p93==0) + AG((u13.p90==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((u15.p93==0) + !(E(TRUE U !((u13.p90==1))))))] != FALSE
(forward)formula 1,1,0.624193,33508,1,0,74434,931,909,79568,383,4180,107636
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((u14.p92!=1) + ((!(((u10.p68==0) * (((u15.p93==0)||(u5.p30==1)) + AF(((u2.p2==0)||(u12.p83==1)))))) * (u9.p57==1)) * !(AG((u12.p81==1...361
=> equivalent forward existential formula: [((Init * !(EG(!(EG((EX((!((E(!((u3.p14==1)) U (!((u9.p58==1)) * !((u3.p14==1)))) + EG(!((u3.p14==1))))) + ((u11...863
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 2,1,5.33755,254948,1,0,555655,1949,1069,701395,399,9473,545953
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(A((u15.p93!=1) U EF(EX(EX((u10.p63==1))))) U (AG(!(AF(((u2.p13==0)||(u5.p30==1))))) * (u2.p3==0)))
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(!(!(EG(!(((u2.p13==0)||(u5.p30==1))))))))) * (u2.p3==0)))))) * !(E(!((!(E(TRUE U ...448
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 3,0,9.68633,426376,1,0,918520,2112,1111,1.2352e+06,400,10604,904699
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(((u10.p66==0)||(u8.p51==1)))
=> equivalent forward existential formula: [FwdG(Init,((u10.p66==0)||(u8.p51==1)))] != FALSE
(forward)formula 4,1,9.94391,440840,1,0,956530,2132,1198,1.27547e+06,416,11291,951508
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
(forward)formula 5,0,11.0441,490888,1,0,1.08389e+06,2187,1201,1.41198e+06,416,11623,1108811
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A((((u10.p69==0)||(u12.p77==1))||(u8.p49==0)) U E(((u2.p13==1) + EG(((u2.p11==0)||(u7.p47==1)))) U !(AX((u4.p21!=1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(((u2.p13==1) + EG(((u2.p11==0)||(u7.p47==1)))) U !(!(EX(!((u4.p21!=1)))))))))) * !(E(!(E(((u2...372
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 6,1,16.9522,738256,1,0,1.62314e+06,2590,1249,2.07672e+06,420,15258,1563046
FORMULA AutonomousCar-PT-10a-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((EF(AG((((u7.p42!=1)||(u2.p9==0))||(u13.p90==1)))) + AF(((((u4.p22==0)&&(u8.p50==1))||(((u10.p66==0)&&(u2.p4==1))&&(((u2.p4==0)||(u11....273
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((((u7.p42!=1)||(u2.p9==0))||(u13.p90==1)))))))),!(((((u4.p22==0...346
(forward)formula 7,1,18.5926,769444,1,0,1.69266e+06,3145,1297,2.17815e+06,422,22723,1664296
FORMULA AutonomousCar-PT-10a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(!(E(!((((u11.p71==0)||(u4.p27==1))&&(!(((u3.p18==0)||(u2.p11==0))||(u5.p32==1))))) U AF((E((u9.p60==1) U (u8.p53==1)) * ((u2.p6==0)||(...170
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!((((u11.p71==0)||(u4.p27==1))&&(!(((u3.p18==0)||(u2.p11==0))||(u5.p32==1))))) U !(EG(!((E((u9....221
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 14
Fast SCC detection found an SCC at level 15
(forward)formula 8,0,30.2399,1113416,1,0,2.35618e+06,3570,1378,3.38944e+06,428,29851,2245521
FORMULA AutonomousCar-PT-10a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EF(AG(((u15.p93==0)||(u8.p49==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((u15.p93==0)||(u8.p49==1)))))))] != FALSE
(forward)formula 9,1,31.0371,1147080,1,0,2.43392e+06,3624,1384,3.4974e+06,428,30024,2355689
FORMULA AutonomousCar-PT-10a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((EX((((u11.p76==0) + !(A(((u10.p63==0)||(u4.p25==1)) U (u4.p25==1)))) + ((u5.p31==1)||(u6.p35==0)))) + AX(((((u13.p84==0)&&(u2.p7==1))...272
=> equivalent forward existential formula: [FwdG(Init,(EX((((u11.p76==0) + !(!((E(!((u4.p25==1)) U (!(((u10.p63==0)||(u4.p25==1))) * !((u4.p25==1)))) + EG(...372
(forward)formula 10,1,32.5103,1217864,1,0,2.59164e+06,3669,1475,3.68932e+06,430,30583,2524680
FORMULA AutonomousCar-PT-10a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

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

BK_STOP 1748662428812

--------------------
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="AutonomousCar-PT-10a"
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 AutonomousCar-PT-10a, 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 r002-tall-174853729900745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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