Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r550-tall-171734898700153.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CO4-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 336K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717355773137

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 19:16:14] [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]
[2024-06-02 19:16:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:16:14] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-02 19:16:14] [INFO ] Transformed 1178 places.
[2024-06-02 19:16:14] [INFO ] Transformed 1463 transitions.
[2024-06-02 19:16:14] [INFO ] Found NUPN structural information;
[2024-06-02 19:16:14] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 187 places in 17 ms
Reduce places removed 187 places and 251 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-20-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 970 transition count 1208
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 176 place count 819 transition count 1055
Iterating global reduction 1 with 151 rules applied. Total rules applied 327 place count 819 transition count 1055
Discarding 112 places :
Symmetric choice reduction at 1 with 112 rule applications. Total rules 439 place count 707 transition count 932
Iterating global reduction 1 with 112 rules applied. Total rules applied 551 place count 707 transition count 932
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 555 place count 707 transition count 928
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 604 place count 658 transition count 875
Iterating global reduction 2 with 49 rules applied. Total rules applied 653 place count 658 transition count 875
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 655 place count 658 transition count 873
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 686 place count 627 transition count 842
Iterating global reduction 3 with 31 rules applied. Total rules applied 717 place count 627 transition count 842
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 721 place count 627 transition count 838
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 733 place count 615 transition count 826
Iterating global reduction 4 with 12 rules applied. Total rules applied 745 place count 615 transition count 826
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 746 place count 615 transition count 825
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 748 place count 613 transition count 823
Iterating global reduction 5 with 2 rules applied. Total rules applied 750 place count 613 transition count 823
Applied a total of 750 rules in 266 ms. Remains 613 /991 variables (removed 378) and now considering 823/1212 (removed 389) transitions.
// Phase 1: matrix 823 rows 613 cols
[2024-06-02 19:16:14] [INFO ] Computed 7 invariants in 25 ms
[2024-06-02 19:16:15] [INFO ] Implicit Places using invariants in 351 ms returned [6, 525]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 381 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 611/991 places, 823/1212 transitions.
Applied a total of 0 rules in 13 ms. Remains 611 /611 variables (removed 0) and now considering 823/823 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 676 ms. Remains : 611/991 places, 823/1212 transitions.
Support contains 85 out of 611 places after structural reductions.
[2024-06-02 19:16:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:16:15] [INFO ] Flatten gal took : 82 ms
[2024-06-02 19:16:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-20-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:16:15] [INFO ] Flatten gal took : 45 ms
[2024-06-02 19:16:15] [INFO ] Input system was already deterministic with 823 transitions.
Support contains 77 out of 611 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (376 resets) in 1924 ms. (20 steps per ms) remains 29/47 properties
BEST_FIRST walk for 4004 steps (13 resets) in 39 ms. (100 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (14 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (12 resets) in 27 ms. (142 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (12 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (13 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
// Phase 1: matrix 823 rows 611 cols
[2024-06-02 19:16:16] [INFO ] Computed 5 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 15/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 30/88 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 222/310 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 464/774 variables, 160/253 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 400/1174 variables, 211/464 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1174 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 179/1353 variables, 103/567 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1353 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 56/1409 variables, 33/600 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1409 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 20/1429 variables, 12/612 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1429 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (OVERLAPS) 5/1434 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1434 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 19 (OVERLAPS) 0/1434 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1434/1434 variables, and 616 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3903 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 611/611 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 15/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 30/88 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 222/310 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 464/774 variables, 160/253 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 28/281 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 400/1174 variables, 211/492 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1174 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (OVERLAPS) 179/1353 variables, 103/595 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1353 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 56/1409 variables, 33/628 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1409 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (OVERLAPS) 20/1429 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1429 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (OVERLAPS) 5/1434 variables, 4/644 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1434 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1434/1434 variables, and 644 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 611/611 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 8962ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 611 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 611/611 places, 823/823 transitions.
Graph (trivial) has 579 edges and 611 vertex of which 3 / 611 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1156 edges and 609 vertex of which 591 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 248 transitions
Trivial Post-agglo rules discarded 248 transitions
Performed 248 trivial Post agglomeration. Transition count delta: 248
Iterating post reduction 0 with 274 rules applied. Total rules applied 276 place count 591 transition count 532
Reduce places removed 248 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 253 rules applied. Total rules applied 529 place count 343 transition count 527
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 533 place count 341 transition count 525
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 3 with 6 rules applied. Total rules applied 539 place count 340 transition count 520
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 544 place count 335 transition count 520
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 544 place count 335 transition count 481
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 622 place count 296 transition count 481
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 631 place count 287 transition count 470
Iterating global reduction 5 with 9 rules applied. Total rules applied 640 place count 287 transition count 470
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 642 place count 287 transition count 468
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 642 place count 287 transition count 466
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 646 place count 285 transition count 466
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 647 place count 284 transition count 464
Iterating global reduction 6 with 1 rules applied. Total rules applied 648 place count 284 transition count 464
Performed 78 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 6 with 156 rules applied. Total rules applied 804 place count 206 transition count 371
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 814 place count 206 transition count 361
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 821 place count 199 transition count 351
Iterating global reduction 7 with 7 rules applied. Total rules applied 828 place count 199 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 829 place count 199 transition count 350
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 830 place count 198 transition count 349
Iterating global reduction 8 with 1 rules applied. Total rules applied 831 place count 198 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 832 place count 198 transition count 348
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 898 place count 165 transition count 379
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 906 place count 165 transition count 371
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 916 place count 155 transition count 331
Iterating global reduction 10 with 10 rules applied. Total rules applied 926 place count 155 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 929 place count 155 transition count 328
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 932 place count 152 transition count 314
Iterating global reduction 11 with 3 rules applied. Total rules applied 935 place count 152 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 937 place count 152 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 946 place count 152 transition count 303
Free-agglomeration rule applied 22 times.
Iterating global reduction 12 with 22 rules applied. Total rules applied 968 place count 152 transition count 281
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 12 with 22 rules applied. Total rules applied 990 place count 130 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 991 place count 130 transition count 280
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 996 place count 130 transition count 280
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 999 place count 130 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1000 place count 130 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1001 place count 129 transition count 278
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 46 edges and 126 vertex of which 6 / 126 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 4 rules applied. Total rules applied 1005 place count 122 transition count 278
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 1014 place count 122 transition count 269
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1015 place count 121 transition count 267
Iterating global reduction 16 with 1 rules applied. Total rules applied 1016 place count 121 transition count 267
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 16 with 4 rules applied. Total rules applied 1020 place count 119 transition count 265
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 1022 place count 119 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 17 with 22 rules applied. Total rules applied 1044 place count 119 transition count 241
Discarding 4 places :
Symmetric choice reduction at 17 with 4 rule applications. Total rules 1048 place count 115 transition count 233
Iterating global reduction 17 with 4 rules applied. Total rules applied 1052 place count 115 transition count 233
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1055 place count 115 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 1056 place count 115 transition count 229
Free-agglomeration rule applied 15 times.
Iterating global reduction 18 with 15 rules applied. Total rules applied 1071 place count 115 transition count 214
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 18 with 15 rules applied. Total rules applied 1086 place count 100 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 1088 place count 100 transition count 212
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 1089 place count 100 transition count 211
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 1092 place count 99 transition count 209
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 1095 place count 99 transition count 209
Applied a total of 1095 rules in 258 ms. Remains 99 /611 variables (removed 512) and now considering 209/823 (removed 614) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 99/611 places, 209/823 transitions.
RANDOM walk for 40000 steps (8 resets) in 501 ms. (79 steps per ms) remains 3/28 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/3 properties
BEST_FIRST walk for 30143 steps (6 resets) in 26 ms. (1116 steps per ms) remains 0/2 properties
[2024-06-02 19:16:26] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:16:26] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:16:26] [INFO ] Input system was already deterministic with 823 transitions.
Computed a total of 27 stabilizing places and 42 stable transitions
Graph (complete) has 1159 edges and 611 vertex of which 605 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Graph (trivial) has 649 edges and 611 vertex of which 3 / 611 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1157 edges and 609 vertex of which 603 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 286 transitions
Trivial Post-agglo rules discarded 286 transitions
Performed 286 trivial Post agglomeration. Transition count delta: 286
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 602 transition count 527
Reduce places removed 286 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 292 rules applied. Total rules applied 581 place count 316 transition count 521
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 584 place count 313 transition count 521
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 584 place count 313 transition count 483
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 660 place count 275 transition count 483
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 677 place count 258 transition count 462
Iterating global reduction 3 with 17 rules applied. Total rules applied 694 place count 258 transition count 462
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 696 place count 258 transition count 460
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 696 place count 258 transition count 456
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 704 place count 254 transition count 456
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 710 place count 248 transition count 446
Iterating global reduction 4 with 6 rules applied. Total rules applied 716 place count 248 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 718 place count 248 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 719 place count 247 transition count 444
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 805 place count 204 transition count 400
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 12 rules applied. Total rules applied 817 place count 204 transition count 388
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 824 place count 200 transition count 385
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 831 place count 193 transition count 375
Iterating global reduction 8 with 7 rules applied. Total rules applied 838 place count 193 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 839 place count 193 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 841 place count 192 transition count 373
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 842 place count 191 transition count 371
Iterating global reduction 9 with 1 rules applied. Total rules applied 843 place count 191 transition count 371
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 844 place count 190 transition count 369
Iterating global reduction 9 with 1 rules applied. Total rules applied 845 place count 190 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 846 place count 190 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 10 with 25 rules applied. Total rules applied 871 place count 190 transition count 343
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 10 with 15 rules applied. Total rules applied 886 place count 190 transition count 328
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 901 place count 175 transition count 328
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 901 place count 175 transition count 325
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 907 place count 172 transition count 325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 909 place count 171 transition count 324
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 910 place count 171 transition count 324
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 912 place count 169 transition count 322
Applied a total of 912 rules in 111 ms. Remains 169 /611 variables (removed 442) and now considering 322/823 (removed 501) transitions.
// Phase 1: matrix 322 rows 169 cols
[2024-06-02 19:16:26] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:16:26] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 19:16:26] [INFO ] Invariant cache hit.
[2024-06-02 19:16:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:16:26] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 19:16:26] [INFO ] Redundant transitions in 17 ms returned []
Running 299 sub problems to find dead transitions.
[2024-06-02 19:16:26] [INFO ] Invariant cache hit.
[2024-06-02 19:16:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 321/490 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 1/491 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/491 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 175 constraints, problems are : Problem set: 0 solved, 299 unsolved in 10223 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 321/490 variables, 169/174 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 299/473 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (OVERLAPS) 1/491 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/491 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 491/491 variables, and 474 constraints, problems are : Problem set: 0 solved, 299 unsolved in 14214 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 24578ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 24583ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/611 places, 322/823 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24937 ms. Remains : 169/611 places, 322/823 transitions.
[2024-06-02 19:16:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:16:51] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:16:51] [INFO ] Input system was already deterministic with 322 transitions.
[2024-06-02 19:16:51] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:16:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:16:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality3955336907425663138.gal : 14 ms
[2024-06-02 19:16:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14094782446662397296.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3955336907425663138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14094782446662397296.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.29236e+08,0.383787,16820,2,3390,5,56842,6,0,984,46009,0


Converting to forward existential form...Done !
original formula: AG(E(((p344==1)&&(p937==1)) U (p226==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p344==1)&&(p937==1)) U (p226==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t13, t25, t42, t66, t76, t95, t100, t151, t310, t311, t313, Intersection with reachable ...226
(forward)formula 0,0,4.57166,148936,1,0,447,748474,663,233,6695,499529,654
FORMULA CO4-PT-20-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 57 place count 555 transition count 765
Iterating global reduction 1 with 55 rules applied. Total rules applied 112 place count 555 transition count 765
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 555 transition count 761
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 154 place count 517 transition count 721
Iterating global reduction 2 with 38 rules applied. Total rules applied 192 place count 517 transition count 721
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 194 place count 517 transition count 719
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 212 place count 499 transition count 701
Iterating global reduction 3 with 18 rules applied. Total rules applied 230 place count 499 transition count 701
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 235 place count 499 transition count 696
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 240 place count 494 transition count 691
Iterating global reduction 4 with 5 rules applied. Total rules applied 245 place count 494 transition count 691
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 246 place count 494 transition count 690
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 247 place count 493 transition count 689
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 493 transition count 689
Applied a total of 248 rules in 51 ms. Remains 493 /611 variables (removed 118) and now considering 689/823 (removed 134) transitions.
// Phase 1: matrix 689 rows 493 cols
[2024-06-02 19:16:56] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:16:56] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 19:16:56] [INFO ] Invariant cache hit.
[2024-06-02 19:16:56] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 688 sub problems to find dead transitions.
[2024-06-02 19:16:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:17:10] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 7 ms to minimize.
[2024-06-02 19:17:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/500 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:17:21] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 4 ms to minimize.
[2024-06-02 19:17:22] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-06-02 19:17:23] [INFO ] Deduced a trap composed of 187 places in 89 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 503 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/503 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 688/1191 constraints. Problems are: Problem set: 0 solved, 688 unsolved
[2024-06-02 19:17:42] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 1192 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 6/6 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Starting structural reductions in LTL mode, iteration 1 : 493/611 places, 689/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60814 ms. Remains : 493/611 places, 689/823 transitions.
[2024-06-02 19:17:57] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:17:57] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:17:57] [INFO ] Input system was already deterministic with 689 transitions.
[2024-06-02 19:17:57] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:17:57] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:17:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality4603873952480237039.gal : 27 ms
[2024-06-02 19:17:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7796539479116478159.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4603873952480237039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7796539479116478159.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.2873e+12,16.0127,417476,2,29610,5,1.24554e+06,6,0,2655,2.08006e+06,0


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

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

Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 46 place count 566 transition count 777
Iterating global reduction 1 with 44 rules applied. Total rules applied 90 place count 566 transition count 777
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 566 transition count 773
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 124 place count 536 transition count 741
Iterating global reduction 2 with 30 rules applied. Total rules applied 154 place count 536 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 536 transition count 740
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 170 place count 521 transition count 725
Iterating global reduction 3 with 15 rules applied. Total rules applied 185 place count 521 transition count 725
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 189 place count 521 transition count 721
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 193 place count 517 transition count 717
Iterating global reduction 4 with 4 rules applied. Total rules applied 197 place count 517 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 198 place count 517 transition count 716
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 199 place count 516 transition count 715
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 516 transition count 715
Applied a total of 200 rules in 56 ms. Remains 516 /611 variables (removed 95) and now considering 715/823 (removed 108) transitions.
// Phase 1: matrix 715 rows 516 cols
[2024-06-02 19:18:13] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 19:18:13] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 19:18:13] [INFO ] Invariant cache hit.
[2024-06-02 19:18:13] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 714 sub problems to find dead transitions.
[2024-06-02 19:18:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (OVERLAPS) 1/516 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-06-02 19:18:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:18:29] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 4 (OVERLAPS) 715/1231 variables, 516/523 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-06-02 19:18:41] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-06-02 19:18:41] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-06-02 19:18:42] [INFO ] Deduced a trap composed of 202 places in 86 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1231/1231 variables, and 526 constraints, problems are : Problem set: 0 solved, 714 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 714 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/515 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 1 (OVERLAPS) 1/516 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/516 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/516 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 4 (OVERLAPS) 715/1231 variables, 516/526 constraints. Problems are: Problem set: 0 solved, 714 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 714/1240 constraints. Problems are: Problem set: 0 solved, 714 unsolved
[2024-06-02 19:19:00] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1231 variables, and 1241 constraints, problems are : Problem set: 0 solved, 714 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 714/714 constraints, Known Traps: 6/6 constraints]
After SMT, in 60302ms problems are : Problem set: 0 solved, 714 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in LTL mode, iteration 1 : 516/611 places, 715/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60805 ms. Remains : 516/611 places, 715/823 transitions.
[2024-06-02 19:19:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:19:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:19:14] [INFO ] Input system was already deterministic with 715 transitions.
[2024-06-02 19:19:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:19:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:19:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality17617101804282740382.gal : 19 ms
[2024-06-02 19:19:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality15211399098869744180.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17617101804282740382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15211399098869744180.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.11575e+12,21.8803,561388,2,40407,5,1.48093e+06,6,0,2773,3.00419e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:19:44] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:19:44] [INFO ] Applying decomposition
[2024-06-02 19:19:44] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15878015703133651781.txt' '-o' '/tmp/graph15878015703133651781.bin' '-w' '/tmp/graph15878015703133651781.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15878015703133651781.bin' '-l' '-1' '-v' '-w' '/tmp/graph15878015703133651781.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:19:44] [INFO ] Decomposing Gal with order
[2024-06-02 19:19:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:19:44] [INFO ] Removed a total of 429 redundant transitions.
[2024-06-02 19:19:44] [INFO ] Flatten gal took : 85 ms
[2024-06-02 19:19:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 19 ms.
[2024-06-02 19:19:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality793377360560011847.gal : 11 ms
[2024-06-02 19:19:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality11846310354312506840.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality793377360560011847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11846310354312506840.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.11575e+12,9.79518,243096,3121,178,301653,7126,1327,1.90729e+06,121,70704,0


Converting to forward existential form...Done !
original formula: A(((!((EX((i17.i0.i2.u193.p1094==1)) * !(((i8.u96.p627==1)||(i10.u123.p732==1))))) * E(!(((EF((i5.i0.i0.u40.p313==1)) * (i11.u68.p432==0)...401
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U (i0.i1.i1.u17.p189==1))) * EX(TRUE)))))) * !(E(!((!(E(TRUE U (i0.i1.i1.u17.p189==1)...586
Reverse transition relation is NOT exact ! Due to transitions t0, t19, t92, t98, t99, t145, t191, t231, t279, t344, t369, t378, t406, t424, t501, t502, t55...1468
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 563 transition count 773
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 563 transition count 773
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 563 transition count 770
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 132 place count 530 transition count 735
Iterating global reduction 1 with 33 rules applied. Total rules applied 165 place count 530 transition count 735
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 167 place count 530 transition count 733
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 182 place count 515 transition count 718
Iterating global reduction 2 with 15 rules applied. Total rules applied 197 place count 515 transition count 718
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 201 place count 515 transition count 714
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 204 place count 512 transition count 711
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 512 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 512 transition count 710
Applied a total of 208 rules in 34 ms. Remains 512 /611 variables (removed 99) and now considering 710/823 (removed 113) transitions.
// Phase 1: matrix 710 rows 512 cols
[2024-06-02 19:20:15] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:20:15] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 19:20:15] [INFO ] Invariant cache hit.
[2024-06-02 19:20:15] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 709 sub problems to find dead transitions.
[2024-06-02 19:20:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/511 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 3 (OVERLAPS) 710/1221 variables, 511/516 constraints. Problems are: Problem set: 0 solved, 709 unsolved
[2024-06-02 19:20:41] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 7 ms to minimize.
[2024-06-02 19:20:41] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-06-02 19:20:43] [INFO ] Deduced a trap composed of 192 places in 82 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1221/1222 variables, and 519 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 511/512 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/511 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 4 (OVERLAPS) 710/1221 variables, 511/519 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1221 variables, 672/1191 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1221/1222 variables, and 1191 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 511/512 constraints, PredecessorRefiner: 672/709 constraints, Known Traps: 3/3 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 512/611 places, 710/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60693 ms. Remains : 512/611 places, 710/823 transitions.
[2024-06-02 19:21:15] [INFO ] Flatten gal took : 33 ms
[2024-06-02 19:21:15] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:21:15] [INFO ] Input system was already deterministic with 710 transitions.
[2024-06-02 19:21:15] [INFO ] Flatten gal took : 34 ms
[2024-06-02 19:21:15] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:21:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality5873649838818586414.gal : 23 ms
[2024-06-02 19:21:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality6473944240156199113.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5873649838818586414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6473944240156199113.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.64568e+12,16.0137,424212,2,29083,5,1.26161e+06,6,0,2749,2.16244e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:21:46] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:21:46] [INFO ] Applying decomposition
[2024-06-02 19:21:46] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16505110628999976778.txt' '-o' '/tmp/graph16505110628999976778.bin' '-w' '/tmp/graph16505110628999976778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16505110628999976778.bin' '-l' '-1' '-v' '-w' '/tmp/graph16505110628999976778.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:21:46] [INFO ] Decomposing Gal with order
[2024-06-02 19:21:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:21:46] [INFO ] Removed a total of 430 redundant transitions.
[2024-06-02 19:21:46] [INFO ] Flatten gal took : 50 ms
[2024-06-02 19:21:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 13 ms.
[2024-06-02 19:21:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality4607229395813992890.gal : 13 ms
[2024-06-02 19:21:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17969518301552282467.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4607229395813992890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17969518301552282467.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.64568e+12,2.66063,92212,2736,199,119295,7237,1263,589788,130,69399,0


Converting to forward existential form...Done !
original formula: ((AX(EF(AX(FALSE))) + AG(((((i12.u129.p762==1)&&(i6.u75.p468==0))&&(i2.u25.p223==1)) + ((((i5.u61.p407==0)&&(i3.i0.i2.u14.p159==1))||((i1...361
=> equivalent forward existential formula: ([((FwdU(((Init * !((EX(EG((i5.u62.p410==0))) + EG((((i16.u70.p442==0)||(i19.u188.p1080==1))&&(i4.i0.i2.u50.p354...689
Reverse transition relation is NOT exact ! Due to transitions t19, t30, t45, t90, t99, t100, t147, t193, t232, t240, t276, t365, t374, t420, t500, t541, t5...1193
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 53 place count 559 transition count 769
Iterating global reduction 1 with 51 rules applied. Total rules applied 104 place count 559 transition count 769
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 107 place count 559 transition count 766
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 142 place count 524 transition count 729
Iterating global reduction 2 with 35 rules applied. Total rules applied 177 place count 524 transition count 729
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 179 place count 524 transition count 727
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 196 place count 507 transition count 710
Iterating global reduction 3 with 17 rules applied. Total rules applied 213 place count 507 transition count 710
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 217 place count 507 transition count 706
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 222 place count 502 transition count 701
Iterating global reduction 4 with 5 rules applied. Total rules applied 227 place count 502 transition count 701
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 502 transition count 700
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 229 place count 501 transition count 699
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 501 transition count 699
Applied a total of 230 rules in 48 ms. Remains 501 /611 variables (removed 110) and now considering 699/823 (removed 124) transitions.
// Phase 1: matrix 699 rows 501 cols
[2024-06-02 19:22:16] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:22:16] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 19:22:16] [INFO ] Invariant cache hit.
[2024-06-02 19:22:16] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 698 sub problems to find dead transitions.
[2024-06-02 19:22:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 698 unsolved
[2024-06-02 19:22:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (OVERLAPS) 699/1200 variables, 501/507 constraints. Problems are: Problem set: 0 solved, 698 unsolved
[2024-06-02 19:22:43] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-02 19:22:43] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:22:44] [INFO ] Deduced a trap composed of 190 places in 89 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 510 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 698 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 1 (OVERLAPS) 1/501 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/501 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 4 (OVERLAPS) 699/1200 variables, 501/510 constraints. Problems are: Problem set: 0 solved, 698 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1200 variables, 698/1208 constraints. Problems are: Problem set: 0 solved, 698 unsolved
[2024-06-02 19:23:07] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 1)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1200/1200 variables, and 1209 constraints, problems are : Problem set: 0 solved, 698 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 698/698 constraints, Known Traps: 5/5 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 698 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 501/611 places, 699/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60731 ms. Remains : 501/611 places, 699/823 transitions.
[2024-06-02 19:23:17] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:23:17] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:23:17] [INFO ] Input system was already deterministic with 699 transitions.
[2024-06-02 19:23:17] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:23:17] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:23:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12454653542643699847.gal : 19 ms
[2024-06-02 19:23:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality11645857572956978474.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12454653542643699847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11645857572956978474.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5232e+12,21.9444,499968,2,33382,5,1.48977e+06,6,0,2697,2.54835e+06,0


Converting to forward existential form...Done !
original formula: AG((EX((p1142!=1)) * ((AG((p1074==0)) + (p980==0)) + (p554==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX((p1142!=1))))] = FALSE * [(FwdU(((FwdU(Init,TRUE) * !((p554==0))) * !((p980==0))),TRUE...183
(forward)formula 0,0,29.2625,499968,1,0,15,1.48977e+06,14,6,4947,2.54835e+06,5
FORMULA CO4-PT-20-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 54 place count 558 transition count 768
Iterating global reduction 1 with 52 rules applied. Total rules applied 106 place count 558 transition count 768
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 110 place count 558 transition count 764
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 145 place count 523 transition count 727
Iterating global reduction 2 with 35 rules applied. Total rules applied 180 place count 523 transition count 727
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 523 transition count 725
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 199 place count 506 transition count 708
Iterating global reduction 3 with 17 rules applied. Total rules applied 216 place count 506 transition count 708
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 221 place count 506 transition count 703
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 224 place count 503 transition count 700
Iterating global reduction 4 with 3 rules applied. Total rules applied 227 place count 503 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 503 transition count 699
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 229 place count 502 transition count 698
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 502 transition count 698
Applied a total of 230 rules in 42 ms. Remains 502 /611 variables (removed 109) and now considering 698/823 (removed 125) transitions.
// Phase 1: matrix 698 rows 502 cols
[2024-06-02 19:23:46] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 19:23:47] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 19:23:47] [INFO ] Invariant cache hit.
[2024-06-02 19:23:47] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 697 sub problems to find dead transitions.
[2024-06-02 19:23:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/502 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 3 (OVERLAPS) 698/1200 variables, 502/507 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-02 19:24:13] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 4 ms to minimize.
[2024-06-02 19:24:13] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:24:14] [INFO ] Deduced a trap composed of 192 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1200/1200 variables, and 510 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 697 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/502 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/502 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 4 (OVERLAPS) 698/1200 variables, 502/510 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1200 variables, 697/1207 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-02 19:24:32] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1200/1200 variables, and 1208 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 502/502 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 4/4 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 697 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in LTL mode, iteration 1 : 502/611 places, 698/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 502/611 places, 698/823 transitions.
[2024-06-02 19:24:47] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:24:47] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:24:47] [INFO ] Input system was already deterministic with 698 transitions.
[2024-06-02 19:24:47] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:47] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality4327317728018058223.gal : 3 ms
[2024-06-02 19:24:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality2336615088509791030.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4327317728018058223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2336615088509791030.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.34446e+12,19.1405,419684,2,29985,5,1.26748e+06,6,0,2700,2.10659e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:25:17] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:25:17] [INFO ] Applying decomposition
[2024-06-02 19:25:17] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15331965533465238310.txt' '-o' '/tmp/graph15331965533465238310.bin' '-w' '/tmp/graph15331965533465238310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15331965533465238310.bin' '-l' '-1' '-v' '-w' '/tmp/graph15331965533465238310.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:25:17] [INFO ] Decomposing Gal with order
[2024-06-02 19:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:25:17] [INFO ] Removed a total of 419 redundant transitions.
[2024-06-02 19:25:17] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 7 ms.
[2024-06-02 19:25:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality2379212209075991027.gal : 5 ms
[2024-06-02 19:25:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5687874129633613686.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2379212209075991027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5687874129633613686.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.34446e+12,5.11934,161320,2259,173,247918,7308,1259,1.07634e+06,123,67105,0


Converting to forward existential form...Done !
original formula: (AF(AX(EF(EG(((i17.u161.p940==0)||(i3.i0.i0.u20.p208==1)))))) + AX(!(A(EG(AX(((i4.u58.p398==0)||(i7.i1.i0.u92.p626==1)))) U (EX((i6.u90.p...220
=> equivalent forward existential formula: [((EY((Init * !(!(EG(!(!(EX(!(E(TRUE U EG(((i17.u161.p940==0)||(i3.i0.i0.u20.p208==1))))))))))))) * !(EG(!((EX((...468
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t92, t93, t137, t173, t185, t267, t359, t368, t458, t491, t559, t560, t595, t5...1188
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 50 place count 562 transition count 772
Iterating global reduction 1 with 48 rules applied. Total rules applied 98 place count 562 transition count 772
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 102 place count 562 transition count 768
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 133 place count 531 transition count 736
Iterating global reduction 2 with 31 rules applied. Total rules applied 164 place count 531 transition count 736
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 531 transition count 734
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 180 place count 517 transition count 720
Iterating global reduction 3 with 14 rules applied. Total rules applied 194 place count 517 transition count 720
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 199 place count 517 transition count 715
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 202 place count 514 transition count 712
Iterating global reduction 4 with 3 rules applied. Total rules applied 205 place count 514 transition count 712
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 514 transition count 711
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 207 place count 513 transition count 710
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 513 transition count 710
Applied a total of 208 rules in 46 ms. Remains 513 /611 variables (removed 98) and now considering 710/823 (removed 113) transitions.
// Phase 1: matrix 710 rows 513 cols
[2024-06-02 19:25:48] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 19:25:48] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 19:25:48] [INFO ] Invariant cache hit.
[2024-06-02 19:25:48] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 709 sub problems to find dead transitions.
[2024-06-02 19:25:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/513 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 3 (OVERLAPS) 710/1223 variables, 513/518 constraints. Problems are: Problem set: 0 solved, 709 unsolved
[2024-06-02 19:26:15] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2024-06-02 19:26:15] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:26:16] [INFO ] Deduced a trap composed of 198 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1223/1223 variables, and 521 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/513 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 709 unsolved
[2024-06-02 19:26:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:26:28] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 5 (OVERLAPS) 710/1223 variables, 513/523 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1223 variables, 709/1232 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1223/1223 variables, and 1232 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 5/5 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in LTL mode, iteration 1 : 513/611 places, 710/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60740 ms. Remains : 513/611 places, 710/823 transitions.
[2024-06-02 19:26:48] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:26:48] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:26:48] [INFO ] Input system was already deterministic with 710 transitions.
[2024-06-02 19:26:48] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:26:48] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:26:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality12262965435673616328.gal : 3 ms
[2024-06-02 19:26:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10575074503455679733.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12262965435673616328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10575074503455679733.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42802e+12,15.7148,415028,2,31720,5,1.26467e+06,6,0,2756,2.05613e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:27:18] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:27:18] [INFO ] Applying decomposition
[2024-06-02 19:27:18] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph752366777465908860.txt' '-o' '/tmp/graph752366777465908860.bin' '-w' '/tmp/graph752366777465908860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph752366777465908860.bin' '-l' '-1' '-v' '-w' '/tmp/graph752366777465908860.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:27:18] [INFO ] Decomposing Gal with order
[2024-06-02 19:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:27:19] [INFO ] Removed a total of 426 redundant transitions.
[2024-06-02 19:27:19] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 8 ms.
[2024-06-02 19:27:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12030323050078928722.gal : 5 ms
[2024-06-02 19:27:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality4338605348430828855.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12030323050078928722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4338605348430828855.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.42802e+12,2.63699,95140,1952,173,115080,7219,1243,695701,123,70803,0


Converting to forward existential form...Done !
original formula: (AF((EF(((i3.u34.p292!=0)&&(i9.u80.p541!=1))) * EX(TRUE))) * EX(((A(((i17.u190.p1131==1)||(i10.i1.i1.u163.p906==1)) U EG((i9.u100.p625==0...387
=> equivalent forward existential formula: ([FwdG(Init,!((E(TRUE U ((i3.u34.p292!=0)&&(i9.u80.p541!=1))) * EX(TRUE))))] = FALSE * [(Init * !(EX(((!((E(!(EG...859
Reverse transition relation is NOT exact ! Due to transitions t20, t31, t55, t86, t95, t96, t140, t232, t364, t373, t417, t466, t568, t569, t606, t607, t63...1102
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 56 place count 556 transition count 766
Iterating global reduction 1 with 54 rules applied. Total rules applied 110 place count 556 transition count 766
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 556 transition count 763
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 150 place count 519 transition count 724
Iterating global reduction 2 with 37 rules applied. Total rules applied 187 place count 519 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 189 place count 519 transition count 722
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 206 place count 502 transition count 705
Iterating global reduction 3 with 17 rules applied. Total rules applied 223 place count 502 transition count 705
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 227 place count 502 transition count 701
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 232 place count 497 transition count 696
Iterating global reduction 4 with 5 rules applied. Total rules applied 237 place count 497 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 238 place count 497 transition count 695
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 239 place count 496 transition count 694
Iterating global reduction 5 with 1 rules applied. Total rules applied 240 place count 496 transition count 694
Applied a total of 240 rules in 45 ms. Remains 496 /611 variables (removed 115) and now considering 694/823 (removed 129) transitions.
// Phase 1: matrix 694 rows 496 cols
[2024-06-02 19:27:49] [INFO ] Computed 5 invariants in 7 ms
[2024-06-02 19:27:49] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 19:27:49] [INFO ] Invariant cache hit.
[2024-06-02 19:27:49] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2024-06-02 19:27:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
[2024-06-02 19:28:04] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-02 19:28:04] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 694/1190 variables, 496/503 constraints. Problems are: Problem set: 0 solved, 693 unsolved
[2024-06-02 19:28:15] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:28:16] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-02 19:28:17] [INFO ] Deduced a trap composed of 187 places in 83 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 506 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 694/1190 variables, 496/506 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1190 variables, 693/1199 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 1199 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 5/5 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Starting structural reductions in LTL mode, iteration 1 : 496/611 places, 694/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60694 ms. Remains : 496/611 places, 694/823 transitions.
[2024-06-02 19:28:49] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:28:49] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:28:49] [INFO ] Input system was already deterministic with 694 transitions.
[2024-06-02 19:28:49] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:28:49] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:28:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality14533008916515651863.gal : 2 ms
[2024-06-02 19:28:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality16816488230830016140.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14533008916515651863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16816488230830016140.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4224e+12,15.6484,403964,2,29379,5,1.21386e+06,6,0,2672,1.99691e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:29:19] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:29:19] [INFO ] Applying decomposition
[2024-06-02 19:29:19] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12577818464782410219.txt' '-o' '/tmp/graph12577818464782410219.bin' '-w' '/tmp/graph12577818464782410219.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12577818464782410219.bin' '-l' '-1' '-v' '-w' '/tmp/graph12577818464782410219.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:29:20] [INFO ] Decomposing Gal with order
[2024-06-02 19:29:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:29:20] [INFO ] Removed a total of 420 redundant transitions.
[2024-06-02 19:29:20] [INFO ] Flatten gal took : 38 ms
[2024-06-02 19:29:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 29 ms.
[2024-06-02 19:29:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality1406075502153314915.gal : 5 ms
[2024-06-02 19:29:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality398441341650620667.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1406075502153314915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality398441341650620667.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.4224e+12,1.67056,64880,2046,176,84161,6258,1207,418313,123,57385,0


Converting to forward existential form...Done !
original formula: A(!(EG(EX(TRUE))) U !(EF((i8.u66.p457==0))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (i8.u66.p457==0))))))) * !(E(!(!(E(TRUE U (i8.u66.p457==0)))) U (!(!(EG(EX(TRUE)))) ...203
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t137, t183, t265, t306, t318, t354, t367, t445, t528, t556, t55...1132
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 50 place count 562 transition count 772
Iterating global reduction 1 with 48 rules applied. Total rules applied 98 place count 562 transition count 772
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 102 place count 562 transition count 768
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 136 place count 528 transition count 732
Iterating global reduction 2 with 34 rules applied. Total rules applied 170 place count 528 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 171 place count 528 transition count 731
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 188 place count 511 transition count 714
Iterating global reduction 3 with 17 rules applied. Total rules applied 205 place count 511 transition count 714
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 210 place count 511 transition count 709
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 214 place count 507 transition count 705
Iterating global reduction 4 with 4 rules applied. Total rules applied 218 place count 507 transition count 705
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 219 place count 506 transition count 704
Iterating global reduction 4 with 1 rules applied. Total rules applied 220 place count 506 transition count 704
Applied a total of 220 rules in 64 ms. Remains 506 /611 variables (removed 105) and now considering 704/823 (removed 119) transitions.
// Phase 1: matrix 704 rows 506 cols
[2024-06-02 19:29:50] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:29:50] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 19:29:50] [INFO ] Invariant cache hit.
[2024-06-02 19:29:50] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 703 sub problems to find dead transitions.
[2024-06-02 19:29:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/506 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-02 19:30:05] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:30:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/506 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (OVERLAPS) 704/1210 variables, 506/513 constraints. Problems are: Problem set: 0 solved, 703 unsolved
[2024-06-02 19:30:17] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:30:17] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 3 ms to minimize.
[2024-06-02 19:30:18] [INFO ] Deduced a trap composed of 188 places in 87 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1210/1210 variables, and 516 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (OVERLAPS) 1/506 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/506 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (OVERLAPS) 704/1210 variables, 506/516 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1210 variables, 703/1219 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/1210 variables, and 1219 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 5/5 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60262ms
Starting structural reductions in LTL mode, iteration 1 : 506/611 places, 704/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60731 ms. Remains : 506/611 places, 704/823 transitions.
[2024-06-02 19:30:50] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:30:50] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:30:51] [INFO ] Input system was already deterministic with 704 transitions.
[2024-06-02 19:30:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:30:51] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:30:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality15727297409786366162.gal : 2 ms
[2024-06-02 19:30:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality11801016427984687450.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15727297409786366162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11801016427984687450.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63068e+12,20.5161,518532,2,32943,5,1.4401e+06,6,0,2722,2.7342e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:31:21] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:31:21] [INFO ] Applying decomposition
[2024-06-02 19:31:21] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1793551316575798690.txt' '-o' '/tmp/graph1793551316575798690.bin' '-w' '/tmp/graph1793551316575798690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1793551316575798690.bin' '-l' '-1' '-v' '-w' '/tmp/graph1793551316575798690.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:31:21] [INFO ] Decomposing Gal with order
[2024-06-02 19:31:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:31:21] [INFO ] Removed a total of 425 redundant transitions.
[2024-06-02 19:31:21] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:31:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2024-06-02 19:31:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality2334142748577432551.gal : 5 ms
[2024-06-02 19:31:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality4251268018705707884.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2334142748577432551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4251268018705707884.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.63068e+12,4.25177,133444,2325,198,165286,9019,1263,972105,124,97029,0


Converting to forward existential form...Done !
original formula: ((AF((EG(((i0.i0.i0.u11.p148==0)&&(i2.u38.p315==1))) + ((AG(((i3.i0.i1.u55.p377==0)||(i8.u82.p536==1))) * (i0.i1.i0.u15.p162==0)) * (i12....273
=> equivalent forward existential formula: ([(EY((Init * !((!(EG(!((EG(((i0.i0.i0.u11.p148==0)&&(i2.u38.p315==1))) + ((!(E(TRUE U !(((i3.i0.i1.u55.p377==0)...617
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t137, t183, t223, t267, t308, t320, t359, t374, t454, t566, t56...1254
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 52 place count 560 transition count 770
Iterating global reduction 1 with 50 rules applied. Total rules applied 102 place count 560 transition count 770
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 560 transition count 767
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 139 place count 526 transition count 732
Iterating global reduction 2 with 34 rules applied. Total rules applied 173 place count 526 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 175 place count 526 transition count 730
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 190 place count 511 transition count 715
Iterating global reduction 3 with 15 rules applied. Total rules applied 205 place count 511 transition count 715
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 208 place count 511 transition count 712
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 213 place count 506 transition count 707
Iterating global reduction 4 with 5 rules applied. Total rules applied 218 place count 506 transition count 707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 506 transition count 706
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 220 place count 505 transition count 705
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 505 transition count 705
Applied a total of 221 rules in 40 ms. Remains 505 /611 variables (removed 106) and now considering 705/823 (removed 118) transitions.
// Phase 1: matrix 705 rows 505 cols
[2024-06-02 19:31:51] [INFO ] Computed 5 invariants in 9 ms
[2024-06-02 19:31:51] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 19:31:51] [INFO ] Invariant cache hit.
[2024-06-02 19:31:51] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 704 sub problems to find dead transitions.
[2024-06-02 19:31:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/505 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-06-02 19:32:06] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:32:06] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 4 (OVERLAPS) 705/1210 variables, 505/512 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-06-02 19:32:18] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-06-02 19:32:19] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 5 ms to minimize.
[2024-06-02 19:32:20] [INFO ] Deduced a trap composed of 188 places in 89 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1210/1210 variables, and 515 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/505 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 4 (OVERLAPS) 705/1210 variables, 505/515 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1210 variables, 704/1219 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/1210 variables, and 1219 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 505/505 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 5/5 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LTL mode, iteration 1 : 505/611 places, 705/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60718 ms. Remains : 505/611 places, 705/823 transitions.
[2024-06-02 19:32:52] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:32:52] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:32:52] [INFO ] Input system was already deterministic with 705 transitions.
[2024-06-02 19:32:52] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:32:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:32:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality6995139865684177564.gal : 6 ms
[2024-06-02 19:32:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality8915183055361109259.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6995139865684177564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8915183055361109259.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.53569e+12,15.9141,420124,2,29438,5,1.24212e+06,6,0,2719,2.10095e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:33:22] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:33:22] [INFO ] Applying decomposition
[2024-06-02 19:33:22] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7565786306352994478.txt' '-o' '/tmp/graph7565786306352994478.bin' '-w' '/tmp/graph7565786306352994478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7565786306352994478.bin' '-l' '-1' '-v' '-w' '/tmp/graph7565786306352994478.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:33:22] [INFO ] Decomposing Gal with order
[2024-06-02 19:33:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:33:22] [INFO ] Removed a total of 428 redundant transitions.
[2024-06-02 19:33:22] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:33:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 5 ms.
[2024-06-02 19:33:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality7345708952082898679.gal : 4 ms
[2024-06-02 19:33:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality5879259956217018676.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7345708952082898679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5879259956217018676.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.53569e+12,5.58526,191624,2373,180,228955,8458,1249,1.4865e+06,135,91001,0


Converting to forward existential form...Done !
original formula: AF(((AG(AF(((i10.i1.i0.u117.p722==0)||(i18.u180.p1086==1)))) * (((i9.u98.p640==0) + !(A(((i19.u178.p1040==0)||(i2.i1.i1.u15.p187==1)) U (...247
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(!(EG(!(((i10.i1.i0.u117.p722==0)||(i18.u180.p1086==1)))))))) * (((i9.u98.p640==0) + ...373
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t42, t87, t96, t97, t141, t187, t225, t274, t315, t328, t364, t375, t419, t465, t49...1136
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Graph (trivial) has 653 edges and 611 vertex of which 3 / 611 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1157 edges and 609 vertex of which 603 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 290 rules applied. Total rules applied 292 place count 602 transition count 524
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 295 rules applied. Total rules applied 587 place count 313 transition count 518
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 590 place count 310 transition count 518
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 590 place count 310 transition count 480
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 666 place count 272 transition count 480
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 683 place count 255 transition count 459
Iterating global reduction 3 with 17 rules applied. Total rules applied 700 place count 255 transition count 459
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 702 place count 255 transition count 457
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 702 place count 255 transition count 453
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 710 place count 251 transition count 453
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 716 place count 245 transition count 443
Iterating global reduction 4 with 6 rules applied. Total rules applied 722 place count 245 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 724 place count 245 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 725 place count 244 transition count 441
Performed 43 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 811 place count 201 transition count 397
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 12 rules applied. Total rules applied 823 place count 201 transition count 385
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 830 place count 197 transition count 382
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 837 place count 190 transition count 372
Iterating global reduction 8 with 7 rules applied. Total rules applied 844 place count 190 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 845 place count 190 transition count 371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 847 place count 189 transition count 370
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 848 place count 188 transition count 368
Iterating global reduction 9 with 1 rules applied. Total rules applied 849 place count 188 transition count 368
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 850 place count 187 transition count 366
Iterating global reduction 9 with 1 rules applied. Total rules applied 851 place count 187 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 852 place count 187 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 878 place count 187 transition count 339
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 10 with 16 rules applied. Total rules applied 894 place count 187 transition count 323
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 910 place count 171 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 910 place count 171 transition count 320
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 916 place count 168 transition count 320
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 918 place count 167 transition count 319
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 920 place count 165 transition count 317
Applied a total of 920 rules in 100 ms. Remains 165 /611 variables (removed 446) and now considering 317/823 (removed 506) transitions.
// Phase 1: matrix 317 rows 165 cols
[2024-06-02 19:33:52] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:33:52] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-02 19:33:52] [INFO ] Invariant cache hit.
[2024-06-02 19:33:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:33:52] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-02 19:33:52] [INFO ] Redundant transitions in 4 ms returned []
Running 294 sub problems to find dead transitions.
[2024-06-02 19:33:52] [INFO ] Invariant cache hit.
[2024-06-02 19:33:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 316/481 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 1/482 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 171 constraints, problems are : Problem set: 0 solved, 294 unsolved in 9568 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 316/481 variables, 165/170 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 294/464 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 1/482 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 465 constraints, problems are : Problem set: 0 solved, 294 unsolved in 13338 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 23002ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 23005ms
Starting structural reductions in SI_CTL mode, iteration 1 : 165/611 places, 317/823 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23430 ms. Remains : 165/611 places, 317/823 transitions.
[2024-06-02 19:34:15] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:34:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:34:15] [INFO ] Input system was already deterministic with 317 transitions.
[2024-06-02 19:34:15] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:34:15] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:34:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality12319502130587518665.gal : 1 ms
[2024-06-02 19:34:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality3857369283432759360.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12319502130587518665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3857369283432759360.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.09174e+08,0.209739,11340,2,2138,5,32164,6,0,963,25022,0


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

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 611/611 places, 823/823 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 610 transition count 822
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 54 place count 558 transition count 768
Iterating global reduction 1 with 52 rules applied. Total rules applied 106 place count 558 transition count 768
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 110 place count 558 transition count 764
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 148 place count 520 transition count 724
Iterating global reduction 2 with 38 rules applied. Total rules applied 186 place count 520 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 520 transition count 722
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 206 place count 502 transition count 704
Iterating global reduction 3 with 18 rules applied. Total rules applied 224 place count 502 transition count 704
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 229 place count 502 transition count 699
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 234 place count 497 transition count 694
Iterating global reduction 4 with 5 rules applied. Total rules applied 239 place count 497 transition count 694
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 497 transition count 693
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 241 place count 496 transition count 692
Iterating global reduction 5 with 1 rules applied. Total rules applied 242 place count 496 transition count 692
Applied a total of 242 rules in 48 ms. Remains 496 /611 variables (removed 115) and now considering 692/823 (removed 131) transitions.
// Phase 1: matrix 692 rows 496 cols
[2024-06-02 19:34:17] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:34:17] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 19:34:17] [INFO ] Invariant cache hit.
[2024-06-02 19:34:17] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2024-06-02 19:34:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 692/1188 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-02 19:34:42] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 3 ms to minimize.
[2024-06-02 19:34:42] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-06-02 19:34:43] [INFO ] Deduced a trap composed of 187 places in 90 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 504 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 692/1188 variables, 496/504 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1188 variables, 691/1195 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-02 19:35:04] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/1188 variables, and 1196 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 4/4 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Starting structural reductions in LTL mode, iteration 1 : 496/611 places, 692/823 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 496/611 places, 692/823 transitions.
[2024-06-02 19:35:18] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:35:18] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:35:18] [INFO ] Input system was already deterministic with 692 transitions.
[2024-06-02 19:35:18] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:35:18] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:35:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12254284597769762002.gal : 2 ms
[2024-06-02 19:35:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality8096708992366188084.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12254284597769762002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8096708992366188084.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30316e+12,19.9402,461560,2,33667,5,1.33007e+06,6,0,2670,2.38488e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:35:48] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:35:48] [INFO ] Applying decomposition
[2024-06-02 19:35:48] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16847647415363906469.txt' '-o' '/tmp/graph16847647415363906469.bin' '-w' '/tmp/graph16847647415363906469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16847647415363906469.bin' '-l' '-1' '-v' '-w' '/tmp/graph16847647415363906469.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:35:48] [INFO ] Decomposing Gal with order
[2024-06-02 19:35:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:35:48] [INFO ] Removed a total of 417 redundant transitions.
[2024-06-02 19:35:48] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:35:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2024-06-02 19:35:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality2683514837816541343.gal : 4 ms
[2024-06-02 19:35:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality5915738426813396568.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2683514837816541343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5915738426813396568.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.30316e+12,4.36888,137112,2667,166,186762,6611,1142,964092,121,66815,0


Converting to forward existential form...Done !
original formula: A(!(((i12.u148.p868==1) + !(A(((i18.u154.p899==0)||(i6.i1.i1.u48.p344==1)) U EX(TRUE))))) U (i11.u77.p536==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i11.u77.p536==1))))) * !(E(!((i11.u77.p536==1)) U (!(!(((i12.u148.p868==1) + !(!((E(!(EX(TRUE)...284
Reverse transition relation is NOT exact ! Due to transitions t17, t28, t52, t83, t92, t93, t138, t172, t184, t222, t230, t307, t319, t356, t365, t409, t55...1141
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-06-02 19:36:18] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:36:18] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:36:18] [INFO ] Applying decomposition
[2024-06-02 19:36:18] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10675821088071977258.txt' '-o' '/tmp/graph10675821088071977258.bin' '-w' '/tmp/graph10675821088071977258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10675821088071977258.bin' '-l' '-1' '-v' '-w' '/tmp/graph10675821088071977258.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:36:18] [INFO ] Decomposing Gal with order
[2024-06-02 19:36:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:36:18] [INFO ] Removed a total of 463 redundant transitions.
[2024-06-02 19:36:18] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:36:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 5 ms.
[2024-06-02 19:36:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2933486348000747735.gal : 6 ms
[2024-06-02 19:36:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality18116921623584578522.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2933486348000747735.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18116921623584578522.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 8 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.19447e+12,12.2575,368132,4122,234,670223,5156,1508,2.53374e+06,126,30913,0


Converting to forward existential form...Done !
original formula: A(((!((EX((i20.u229.p1094==1)) * !(((i7.i1.i0.u124.p627==1)||(i7.i1.i1.u153.p732==1))))) * E(!(((EF((i4.u45.p313==1)) * (i12.u80.p432==0)...424
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U (i2.i0.i3.u21.p189==1))) * EX(TRUE)))))) * !(E(!((!(E(TRUE U (i2.i0.i3.u21.p189==1)...609
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t27, t39, t117, t125, t178, t321, t336, t381, t422, t442, t472, t484, t491, t543, t...1879
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
[2024-06-02 20:02:59] [INFO ] Applying decomposition
[2024-06-02 20:02:59] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:02:59] [INFO ] Decomposing Gal with order
[2024-06-02 20:02:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 20:02:59] [INFO ] Removed a total of 286 redundant transitions.
[2024-06-02 20:02:59] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:02:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 4 ms.
[2024-06-02 20:02:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15960649823224378234.gal : 3 ms
[2024-06-02 20:02:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7289743202981801724.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15960649823224378234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7289743202981801724.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 8 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.19447e+12,27.2655,786608,1790,8520,782835,573398,330,4.19988e+06,1820,3.93463e+06,0


Converting to forward existential form...Done !
original formula: A(((!((EX((i0.i1.i1.i1.u17.p1094==1)) * !(((i0.i1.i0.i1.u11.p627==1)||(i0.i1.i0.i1.u11.p732==1))))) * E(!(((EF((i0.i0.i0.u5.p313==1)) * (...457
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U (i0.i0.i0.u5.p189==1))) * EX(TRUE)))))) * !(E(!((!(E(TRUE U (i0.i0.i0.u5.p189==1)))...640
Reverse transition relation is NOT exact ! Due to transitions t783, i0.t671, i0.t660, i0.t178, i0.i0.i0.t442, i0.i0.i0.u5.t0, i0.i0.i0.u5.t457, i0.i0.i0.u5...2588

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CO4-PT-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898700153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-20.tgz
mv CO4-PT-20 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;