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-171734898700145.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-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898700145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 8.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 332K 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-19-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-19-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717355243148

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 19:07:24] [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:07:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:07:24] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-02 19:07:24] [INFO ] Transformed 1174 places.
[2024-06-02 19:07:24] [INFO ] Transformed 1447 transitions.
[2024-06-02 19:07:24] [INFO ] Found NUPN structural information;
[2024-06-02 19:07:24] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 201 places in 17 ms
Reduce places removed 201 places and 274 transitions.
FORMULA CO4-PT-19-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 153 places :
Symmetric choice reduction at 1 with 153 rule applications. Total rules 186 place count 795 transition count 1010
Iterating global reduction 1 with 153 rules applied. Total rules applied 339 place count 795 transition count 1010
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 459 place count 675 transition count 888
Iterating global reduction 1 with 120 rules applied. Total rules applied 579 place count 675 transition count 888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 585 place count 675 transition count 882
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 634 place count 626 transition count 827
Iterating global reduction 2 with 49 rules applied. Total rules applied 683 place count 626 transition count 827
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 684 place count 626 transition count 826
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 711 place count 599 transition count 799
Iterating global reduction 3 with 27 rules applied. Total rules applied 738 place count 599 transition count 799
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 741 place count 599 transition count 796
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 753 place count 587 transition count 784
Iterating global reduction 4 with 12 rules applied. Total rules applied 765 place count 587 transition count 784
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 767 place count 587 transition count 782
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 771 place count 583 transition count 778
Iterating global reduction 5 with 4 rules applied. Total rules applied 775 place count 583 transition count 778
Applied a total of 775 rules in 279 ms. Remains 583 /973 variables (removed 390) and now considering 778/1173 (removed 395) transitions.
// Phase 1: matrix 778 rows 583 cols
[2024-06-02 19:07:24] [INFO ] Computed 7 invariants in 22 ms
[2024-06-02 19:07:25] [INFO ] Implicit Places using invariants in 299 ms returned [6, 502]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 326 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 581/973 places, 778/1173 transitions.
Applied a total of 0 rules in 28 ms. Remains 581 /581 variables (removed 0) and now considering 778/778 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 650 ms. Remains : 581/973 places, 778/1173 transitions.
Support contains 60 out of 581 places after structural reductions.
[2024-06-02 19:07:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:07:25] [INFO ] Flatten gal took : 83 ms
FORMULA CO4-PT-19-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:07:25] [INFO ] Flatten gal took : 37 ms
[2024-06-02 19:07:25] [INFO ] Input system was already deterministic with 778 transitions.
Support contains 55 out of 581 places (down from 60) after GAL structural reductions.
RANDOM walk for 40000 steps (496 resets) in 1568 ms. (25 steps per ms) remains 33/41 properties
BEST_FIRST walk for 4003 steps (13 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (14 resets) in 69 ms. (57 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (12 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (14 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (14 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (12 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (13 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (14 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (13 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (11 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (12 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (12 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
// Phase 1: matrix 778 rows 581 cols
[2024-06-02 19:07:26] [INFO ] Computed 5 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 15/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 24/81 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 201/282 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 441/723 variables, 152/238 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/723 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 402/1125 variables, 207/445 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1125 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 161/1286 variables, 95/540 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1286 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 54/1340 variables, 34/574 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1340 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 14/1354 variables, 8/582 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1354 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (OVERLAPS) 5/1359 variables, 4/586 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1359 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (OVERLAPS) 0/1359 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1359/1359 variables, and 586 constraints, problems are : Problem set: 0 solved, 32 unsolved in 4260 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 15/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 24/81 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 201/282 variables, 81/86 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 441/723 variables, 152/238 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/723 variables, 32/270 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-02 19:07:31] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 15 ms to minimize.
[2024-06-02 19:07:31] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/723 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/723 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 402/1125 variables, 207/479 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1125 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 161/1286 variables, 95/574 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 54/1340 variables, 34/608 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1340 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (OVERLAPS) 14/1354 variables, 8/616 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1354 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (OVERLAPS) 5/1359 variables, 4/620 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1359 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 620 constraints, problems are : Problem set: 0 solved, 32 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 2/2 constraints]
After SMT, in 9334ms problems are : Problem set: 0 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 778/778 transitions.
Graph (trivial) has 546 edges and 581 vertex of which 3 / 581 are part of one of the 1 SCC in 4 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 1079 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 239 rules applied. Total rules applied 241 place count 573 transition count 524
Reduce places removed 231 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 235 rules applied. Total rules applied 476 place count 342 transition count 520
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 480 place count 340 transition count 518
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 3 with 9 rules applied. Total rules applied 489 place count 339 transition count 510
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 497 place count 331 transition count 510
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 46 Pre rules applied. Total rules applied 497 place count 331 transition count 464
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 589 place count 285 transition count 464
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 595 place count 279 transition count 457
Iterating global reduction 5 with 6 rules applied. Total rules applied 601 place count 279 transition count 457
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 603 place count 279 transition count 455
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 605 place count 277 transition count 453
Iterating global reduction 6 with 2 rules applied. Total rules applied 607 place count 277 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 608 place count 277 transition count 452
Performed 71 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 750 place count 206 transition count 370
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 760 place count 206 transition count 360
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 767 place count 199 transition count 348
Iterating global reduction 8 with 7 rules applied. Total rules applied 774 place count 199 transition count 348
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 776 place count 198 transition count 347
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 777 place count 197 transition count 345
Iterating global reduction 8 with 1 rules applied. Total rules applied 778 place count 197 transition count 345
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 8 with 72 rules applied. Total rules applied 850 place count 161 transition count 381
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 862 place count 161 transition count 369
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 879 place count 144 transition count 301
Iterating global reduction 9 with 17 rules applied. Total rules applied 896 place count 144 transition count 301
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 903 place count 144 transition count 294
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 904 place count 143 transition count 288
Iterating global reduction 10 with 1 rules applied. Total rules applied 905 place count 143 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 920 place count 143 transition count 273
Free-agglomeration rule applied 34 times.
Iterating global reduction 10 with 34 rules applied. Total rules applied 954 place count 143 transition count 239
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 35 rules applied. Total rules applied 989 place count 109 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 994 place count 109 transition count 233
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 1000 place count 109 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1001 place count 109 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1002 place count 108 transition count 231
Applied a total of 1002 rules in 168 ms. Remains 108 /581 variables (removed 473) and now considering 231/778 (removed 547) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 108/581 places, 231/778 transitions.
RANDOM walk for 40000 steps (8 resets) in 843 ms. (47 steps per ms) remains 5/32 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/2 properties
BEST_FIRST walk for 14702 steps (3 resets) in 15 ms. (918 steps per ms) remains 0/1 properties
[2024-06-02 19:07:36] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:07:36] [INFO ] Flatten gal took : 27 ms
[2024-06-02 19:07:36] [INFO ] Input system was already deterministic with 778 transitions.
Computed a total of 21 stabilizing places and 24 stable transitions
Graph (complete) has 1082 edges and 581 vertex of which 575 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 778/778 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 547 transition count 742
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 547 transition count 742
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 74 place count 547 transition count 736
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 99 place count 522 transition count 711
Iterating global reduction 1 with 25 rules applied. Total rules applied 124 place count 522 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 522 transition count 710
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 137 place count 510 transition count 698
Iterating global reduction 2 with 12 rules applied. Total rules applied 149 place count 510 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 510 transition count 695
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 158 place count 504 transition count 689
Iterating global reduction 3 with 6 rules applied. Total rules applied 164 place count 504 transition count 689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 504 transition count 688
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 169 place count 500 transition count 684
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 500 transition count 684
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 174 place count 499 transition count 683
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 499 transition count 683
Applied a total of 175 rules in 54 ms. Remains 499 /581 variables (removed 82) and now considering 683/778 (removed 95) transitions.
// Phase 1: matrix 683 rows 499 cols
[2024-06-02 19:07:36] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:07:36] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 19:07:36] [INFO ] Invariant cache hit.
[2024-06-02 19:07:37] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 682 sub problems to find dead transitions.
[2024-06-02 19:07:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 1 (OVERLAPS) 1/499 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-06-02 19:07:51] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:07:51] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 4 (OVERLAPS) 683/1182 variables, 499/506 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-06-02 19:08:02] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 3 ms to minimize.
[2024-06-02 19:08:03] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-02 19:08:03] [INFO ] Deduced a trap composed of 196 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 509 constraints, problems are : Problem set: 0 solved, 682 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 682/682 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 682 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 1 (OVERLAPS) 1/499 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 4 (OVERLAPS) 683/1182 variables, 499/509 constraints. Problems are: Problem set: 0 solved, 682 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 682/1191 constraints. Problems are: Problem set: 0 solved, 682 unsolved
[2024-06-02 19:08:22] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 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, 682 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 682/682 constraints, Known Traps: 6/6 constraints]
After SMT, in 60324ms problems are : Problem set: 0 solved, 682 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Starting structural reductions in LTL mode, iteration 1 : 499/581 places, 683/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60789 ms. Remains : 499/581 places, 683/778 transitions.
[2024-06-02 19:08:37] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:08:37] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:08:37] [INFO ] Input system was already deterministic with 683 transitions.
[2024-06-02 19:08:37] [INFO ] Flatten gal took : 46 ms
[2024-06-02 19:08:37] [INFO ] Flatten gal took : 35 ms
[2024-06-02 19:08:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality18093012025881800101.gal : 26 ms
[2024-06-02 19:08:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16845153938622711602.ctl : 2 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/CTLCardinality18093012025881800101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16845153938622711602.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,6.32104e+11,12.1777,323580,2,25250,5,912938,6,0,2673,1.69236e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:09:07] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:09:07] [INFO ] Applying decomposition
[2024-06-02 19:09:07] [INFO ] Flatten gal took : 24 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/graph6144186757660221393.txt' '-o' '/tmp/graph6144186757660221393.bin' '-w' '/tmp/graph6144186757660221393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6144186757660221393.bin' '-l' '-1' '-v' '-w' '/tmp/graph6144186757660221393.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:09:07] [INFO ] Decomposing Gal with order
[2024-06-02 19:09:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:09:08] [INFO ] Removed a total of 392 redundant transitions.
[2024-06-02 19:09:08] [INFO ] Flatten gal took : 115 ms
[2024-06-02 19:09:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2024-06-02 19:09:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7652706772804780018.gal : 11 ms
[2024-06-02 19:09:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6159572353010875742.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/CTLCardinality7652706772804780018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6159572353010875742.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,6.32104e+11,0.3276,17296,1455,111,25172,860,1199,52329,90,2933,0


Converting to forward existential form...Done !
original formula: EF(((!(E(!(((EX((i9.i0.i0.u100.p656==1)) * ((i14.u151.p895==0)||(i14.u154.p908==1))) * (i8.u97.p638==0))) U !(((EX((i6.u63.p469==1)) + (i...243
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (i8.u77.p557==1)) * (i4.i1.i0.u47.p372==0)) * !(E(!(((EX((i9.i0.i0.u100.p656==1)) * ((i14....295
Reverse transition relation is NOT exact ! Due to transitions t26, t49, t80, t90, t135, t181, t219, t263, t304, t355, t445, t556, t557, t592, t593, t620, t...1059
(forward)formula 0,1,1.69073,81976,1,0,178975,1416,6457,318147,362,5564,434369
FORMULA CO4-PT-19-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 778/778 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 546 transition count 741
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 546 transition count 741
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 546 transition count 735
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 521 transition count 710
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 521 transition count 710
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 138 place count 509 transition count 698
Iterating global reduction 1 with 12 rules applied. Total rules applied 150 place count 509 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 153 place count 509 transition count 695
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 159 place count 503 transition count 689
Iterating global reduction 2 with 6 rules applied. Total rules applied 165 place count 503 transition count 689
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 170 place count 498 transition count 684
Iterating global reduction 2 with 5 rules applied. Total rules applied 175 place count 498 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 177 place count 496 transition count 682
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 496 transition count 682
Applied a total of 179 rules in 54 ms. Remains 496 /581 variables (removed 85) and now considering 682/778 (removed 96) transitions.
// Phase 1: matrix 682 rows 496 cols
[2024-06-02 19:09:10] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:09:10] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-02 19:09:10] [INFO ] Invariant cache hit.
[2024-06-02 19:09:10] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-06-02 19:09:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (OVERLAPS) 682/1178 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2024-06-02 19:09:34] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 14 ms to minimize.
[2024-06-02 19:09:34] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-02 19:09:35] [INFO ] Deduced a trap composed of 192 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 504 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (OVERLAPS) 682/1178 variables, 496/504 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1178 variables, 681/1185 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 1185 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 3/3 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 496/581 places, 682/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60815 ms. Remains : 496/581 places, 682/778 transitions.
[2024-06-02 19:10:10] [INFO ] Flatten gal took : 35 ms
[2024-06-02 19:10:10] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:10:10] [INFO ] Input system was already deterministic with 682 transitions.
[2024-06-02 19:10:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:10:10] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:10:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality8319375775889810805.gal : 9 ms
[2024-06-02 19:10:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality10696222712535307921.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/CTLCardinality8319375775889810805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10696222712535307921.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,6.39516e+11,11.0974,305876,2,26530,5,887993,6,0,2660,1.56769e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:10:41] [INFO ] Applying decomposition
[2024-06-02 19:10:41] [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/graph11668905223562256277.txt' '-o' '/tmp/graph11668905223562256277.bin' '-w' '/tmp/graph11668905223562256277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11668905223562256277.bin' '-l' '-1' '-v' '-w' '/tmp/graph11668905223562256277.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:10:41] [INFO ] Decomposing Gal with order
[2024-06-02 19:10:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:10:41] [INFO ] Removed a total of 402 redundant transitions.
[2024-06-02 19:10:41] [INFO ] Flatten gal took : 38 ms
[2024-06-02 19:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2024-06-02 19:10:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality8354732178728311950.gal : 6 ms
[2024-06-02 19:10:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9476547607996902734.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/CTLCardinality8354732178728311950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9476547607996902734.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,6.39516e+11,0.498425,19720,1264,105,28499,954,1210,71095,91,3927,0


Converting to forward existential form...Done !
original formula: (EF(AG((AG(A((i9.u91.p601==1) U (i3.i0.i1.u27.p228==0))) * EX((i7.u70.p450==1))))) + EX(AG(EF(EX((i10.u101.p643==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(!((E(!((i3.i0.i1.u27.p228==0)) U (!((i9.u91.p601==1)) * !((i3.i0...325
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t78, t87, t88, t132, t166, t178, t263, t304, t351, t365, t409, t486, t526, t554, t5...1053
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 778/778 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 545 transition count 740
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 545 transition count 740
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 545 transition count 735
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 102 place count 520 transition count 710
Iterating global reduction 1 with 25 rules applied. Total rules applied 127 place count 520 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 128 place count 520 transition count 709
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 140 place count 508 transition count 697
Iterating global reduction 2 with 12 rules applied. Total rules applied 152 place count 508 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 154 place count 508 transition count 695
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 162 place count 500 transition count 687
Iterating global reduction 3 with 8 rules applied. Total rules applied 170 place count 500 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 171 place count 500 transition count 686
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 177 place count 494 transition count 680
Iterating global reduction 4 with 6 rules applied. Total rules applied 183 place count 494 transition count 680
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 492 transition count 678
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 492 transition count 678
Applied a total of 187 rules in 68 ms. Remains 492 /581 variables (removed 89) and now considering 678/778 (removed 100) transitions.
// Phase 1: matrix 678 rows 492 cols
[2024-06-02 19:11:11] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:11:11] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 19:11:11] [INFO ] Invariant cache hit.
[2024-06-02 19:11:11] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 677 sub problems to find dead transitions.
[2024-06-02 19:11:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 3 (OVERLAPS) 678/1170 variables, 492/497 constraints. Problems are: Problem set: 0 solved, 677 unsolved
[2024-06-02 19:11:35] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-06-02 19:11:35] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:11:36] [INFO ] Deduced a trap composed of 187 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 500 constraints, problems are : Problem set: 0 solved, 677 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 677/677 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 677 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (OVERLAPS) 1/492 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/492 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 4 (OVERLAPS) 678/1170 variables, 492/500 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1170 variables, 677/1177 constraints. Problems are: Problem set: 0 solved, 677 unsolved
[2024-06-02 19:12:07] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 1178 constraints, problems are : Problem set: 0 solved, 677 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 492/492 constraints, PredecessorRefiner: 677/677 constraints, Known Traps: 4/4 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 677 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Starting structural reductions in LTL mode, iteration 1 : 492/581 places, 678/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60700 ms. Remains : 492/581 places, 678/778 transitions.
[2024-06-02 19:12:12] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:12:12] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:12:12] [INFO ] Input system was already deterministic with 678 transitions.
[2024-06-02 19:12:12] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:12:12] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:12:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality14333761709044946555.gal : 3 ms
[2024-06-02 19:12:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality13458813839616518671.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/CTLCardinality14333761709044946555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13458813839616518671.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,6.15032e+11,11.1703,305108,2,24536,5,865517,6,0,2640,1.59174e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:12:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:12:42] [INFO ] Applying decomposition
[2024-06-02 19:12:42] [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/graph12921654625435317988.txt' '-o' '/tmp/graph12921654625435317988.bin' '-w' '/tmp/graph12921654625435317988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12921654625435317988.bin' '-l' '-1' '-v' '-w' '/tmp/graph12921654625435317988.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:12:42] [INFO ] Decomposing Gal with order
[2024-06-02 19:12:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:12:42] [INFO ] Removed a total of 401 redundant transitions.
[2024-06-02 19:12:42] [INFO ] Flatten gal took : 29 ms
[2024-06-02 19:12:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-06-02 19:12:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality4000031029208600712.gal : 6 ms
[2024-06-02 19:12:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2042900815769312422.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/CTLCardinality4000031029208600712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2042900815769312422.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,6.15032e+11,0.572584,29196,1401,105,44335,1076,1199,138637,85,4219,0


Converting to forward existential form...Done !
original formula: AF((AX(AX((i5.u49.p346==1))) * EG(A((i18.u183.p1080!=0) U (i16.i0.i0.u163.p926!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(EX(!((i5.u49.p346==1))))))) * EG(!((E(!((i16.i0.i0.u163.p926!=1)) U (!((i18.u183.p1080!=0...238
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t82, t91, t92, t136, t182, t220, t264, t305, t317, t352, t361, t440, t452, t483, t5...1075
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found 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 : 581/581 places, 778/778 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 546 transition count 741
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 546 transition count 741
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 546 transition count 735
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 100 place count 522 transition count 711
Iterating global reduction 1 with 24 rules applied. Total rules applied 124 place count 522 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 522 transition count 710
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 137 place count 510 transition count 698
Iterating global reduction 2 with 12 rules applied. Total rules applied 149 place count 510 transition count 698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 510 transition count 695
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 159 place count 503 transition count 688
Iterating global reduction 3 with 7 rules applied. Total rules applied 166 place count 503 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 167 place count 503 transition count 687
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 172 place count 498 transition count 682
Iterating global reduction 4 with 5 rules applied. Total rules applied 177 place count 498 transition count 682
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 179 place count 496 transition count 680
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 496 transition count 680
Applied a total of 181 rules in 53 ms. Remains 496 /581 variables (removed 85) and now considering 680/778 (removed 98) transitions.
// Phase 1: matrix 680 rows 496 cols
[2024-06-02 19:13:12] [INFO ] Computed 5 invariants in 6 ms
[2024-06-02 19:13:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 19:13:12] [INFO ] Invariant cache hit.
[2024-06-02 19:13:12] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 679 sub problems to find dead transitions.
[2024-06-02 19:13:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-02 19:13:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:13:26] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 680/1176 variables, 496/503 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-02 19:13:38] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:13:38] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 3 ms to minimize.
[2024-06-02 19:13:39] [INFO ] Deduced a trap composed of 187 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1176/1176 variables, and 506 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 679 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 4 (OVERLAPS) 680/1176 variables, 496/506 constraints. Problems are: Problem set: 0 solved, 679 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1176 variables, 679/1185 constraints. Problems are: Problem set: 0 solved, 679 unsolved
[2024-06-02 19:13:57] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 4 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 Int declared 1176/1176 variables, and 1186 constraints, problems are : Problem set: 0 solved, 679 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 6/6 constraints]
After SMT, in 60212ms problems are : Problem set: 0 solved, 679 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Starting structural reductions in LTL mode, iteration 1 : 496/581 places, 680/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60659 ms. Remains : 496/581 places, 680/778 transitions.
[2024-06-02 19:14:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:14:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:13] [INFO ] Input system was already deterministic with 680 transitions.
[2024-06-02 19:14:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:14:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:14:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality5076273498865858566.gal : 3 ms
[2024-06-02 19:14:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality7013880337301709380.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/CTLCardinality5076273498865858566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7013880337301709380.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,5.76787e+11,10.9226,295004,2,24295,5,852248,6,0,2658,1.5225e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:14:43] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:14:43] [INFO ] Applying decomposition
[2024-06-02 19:14:43] [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/graph14309964877168451057.txt' '-o' '/tmp/graph14309964877168451057.bin' '-w' '/tmp/graph14309964877168451057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14309964877168451057.bin' '-l' '-1' '-v' '-w' '/tmp/graph14309964877168451057.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:14:43] [INFO ] Decomposing Gal with order
[2024-06-02 19:14:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:14:43] [INFO ] Removed a total of 399 redundant transitions.
[2024-06-02 19:14:43] [INFO ] Flatten gal took : 42 ms
[2024-06-02 19:14:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 14 ms.
[2024-06-02 19:14:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3667672405771046185.gal : 5 ms
[2024-06-02 19:14:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality2215024586758186541.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/CTLCardinality3667672405771046185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2215024586758186541.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,5.76787e+11,0.583595,26232,1262,97,40726,874,1159,108579,91,3310,0


Converting to forward existential form...Done !
original formula: AX(E(EX(((i0.i1.i0.u3.p118==0)||(i5.u41.p309==1))) U (i3.u24.p222==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(EX(((i0.i1.i0.u3.p118==0)||(i5.u41.p309==1))) U (i3.u24.p222==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t79, t88, t89, t167, t179, t217, t261, t314, t349, t358, t402, t450, t483, t552, t553, t...1053
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 778/778 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 550 transition count 745
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 550 transition count 745
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 550 transition count 741
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 86 place count 530 transition count 721
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 530 transition count 721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 530 transition count 720
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 117 place count 520 transition count 710
Iterating global reduction 2 with 10 rules applied. Total rules applied 127 place count 520 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 520 transition count 709
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 135 place count 513 transition count 702
Iterating global reduction 3 with 7 rules applied. Total rules applied 142 place count 513 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 513 transition count 701
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 148 place count 508 transition count 696
Iterating global reduction 4 with 5 rules applied. Total rules applied 153 place count 508 transition count 696
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 507 transition count 695
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 507 transition count 695
Applied a total of 155 rules in 55 ms. Remains 507 /581 variables (removed 74) and now considering 695/778 (removed 83) transitions.
// Phase 1: matrix 695 rows 507 cols
[2024-06-02 19:15:13] [INFO ] Computed 5 invariants in 8 ms
[2024-06-02 19:15:13] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 19:15:13] [INFO ] Invariant cache hit.
[2024-06-02 19:15:13] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 694 sub problems to find dead transitions.
[2024-06-02 19:15:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (OVERLAPS) 695/1202 variables, 507/512 constraints. Problems are: Problem set: 0 solved, 694 unsolved
[2024-06-02 19:15:39] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 3 ms to minimize.
[2024-06-02 19:15:39] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-06-02 19:15:40] [INFO ] Deduced a trap composed of 194 places in 82 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 1202/1202 variables, and 515 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (OVERLAPS) 1/507 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (OVERLAPS) 695/1202 variables, 507/515 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 694/1209 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1209 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 3/3 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 694 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Starting structural reductions in LTL mode, iteration 1 : 507/581 places, 695/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60652 ms. Remains : 507/581 places, 695/778 transitions.
[2024-06-02 19:16:14] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:16:14] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:16:14] [INFO ] Input system was already deterministic with 695 transitions.
[2024-06-02 19:16:14] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:16:14] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:16:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12826933135119247956.gal : 2 ms
[2024-06-02 19:16:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality8811666955715976882.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/CTLCardinality12826933135119247956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8811666955715976882.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,7.44807e+11,12.9513,328636,2,28266,5,949651,6,0,2717,1.68425e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:16:44] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:16:44] [INFO ] Applying decomposition
[2024-06-02 19:16:44] [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/graph14633127751915623485.txt' '-o' '/tmp/graph14633127751915623485.bin' '-w' '/tmp/graph14633127751915623485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14633127751915623485.bin' '-l' '-1' '-v' '-w' '/tmp/graph14633127751915623485.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:16:44] [INFO ] Decomposing Gal with order
[2024-06-02 19:16:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:16:44] [INFO ] Removed a total of 406 redundant transitions.
[2024-06-02 19:16:44] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:16:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 7 ms.
[2024-06-02 19:16:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15599374321390133941.gal : 5 ms
[2024-06-02 19:16:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality10346144682436601404.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/CTLCardinality15599374321390133941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10346144682436601404.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.44807e+11,0.79286,34764,1673,112,58146,1302,1210,153915,92,5455,0


Converting to forward existential form...Done !
original formula: (AF((((EX(((i21.u180.p1049==0)&&(i21.u171.p1034==1))) * EX((i21.u183.p1093==0))) * (((i16.u140.p835==1)||((i9.u94.p954==0)&&(i17.i0.i0.u1...296
=> equivalent forward existential formula: ([FwdG(Init,!((((EX(((i21.u180.p1049==0)&&(i21.u171.p1034==1))) * EX((i21.u183.p1093==0))) * (((i16.u140.p835==1...381
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t89, t98, t99, t181, t193, t231, t242, t278, t367, t376, t420, t466, t537, t565, t5...1057
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 778/778 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 544 transition count 739
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 544 transition count 739
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 80 place count 544 transition count 733
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 106 place count 518 transition count 707
Iterating global reduction 1 with 26 rules applied. Total rules applied 132 place count 518 transition count 707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 133 place count 518 transition count 706
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 147 place count 504 transition count 692
Iterating global reduction 2 with 14 rules applied. Total rules applied 161 place count 504 transition count 692
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 164 place count 504 transition count 689
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 172 place count 496 transition count 681
Iterating global reduction 3 with 8 rules applied. Total rules applied 180 place count 496 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 181 place count 496 transition count 680
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 187 place count 490 transition count 674
Iterating global reduction 4 with 6 rules applied. Total rules applied 193 place count 490 transition count 674
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 195 place count 488 transition count 672
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 488 transition count 672
Applied a total of 197 rules in 57 ms. Remains 488 /581 variables (removed 93) and now considering 672/778 (removed 106) transitions.
// Phase 1: matrix 672 rows 488 cols
[2024-06-02 19:17:14] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 19:17:14] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 19:17:14] [INFO ] Invariant cache hit.
[2024-06-02 19:17:14] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 671 sub problems to find dead transitions.
[2024-06-02 19:17:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (OVERLAPS) 672/1160 variables, 488/493 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-06-02 19:17:37] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:17:38] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 3 ms to minimize.
[2024-06-02 19:17:38] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:17:39] [INFO ] Deduced a trap composed of 187 places in 81 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1160/1160 variables, and 497 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (OVERLAPS) 1/488 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (OVERLAPS) 672/1160 variables, 488/497 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1160 variables, 671/1168 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1160/1160 variables, and 1168 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 488/488 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 4/4 constraints]
After SMT, in 60210ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 488/581 places, 672/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60645 ms. Remains : 488/581 places, 672/778 transitions.
[2024-06-02 19:18:15] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:18:15] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:18:15] [INFO ] Input system was already deterministic with 672 transitions.
[2024-06-02 19:18:15] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:18:15] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:18:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality11890537542668078819.gal : 2 ms
[2024-06-02 19:18:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality5880137182377862401.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/CTLCardinality11890537542668078819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5880137182377862401.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,5.49129e+11,11.0405,303892,2,24657,5,873952,6,0,2618,1.57452e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:18:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:18:45] [INFO ] Applying decomposition
[2024-06-02 19:18:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18186317814251725477.txt' '-o' '/tmp/graph18186317814251725477.bin' '-w' '/tmp/graph18186317814251725477.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18186317814251725477.bin' '-l' '-1' '-v' '-w' '/tmp/graph18186317814251725477.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:18:45] [INFO ] Decomposing Gal with order
[2024-06-02 19:18:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:18:45] [INFO ] Removed a total of 408 redundant transitions.
[2024-06-02 19:18:45] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:18:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-06-02 19:18:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13114887287920884357.gal : 4 ms
[2024-06-02 19:18:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13340043178405553063.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/CTLCardinality13114887287920884357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13340043178405553063.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.49129e+11,0.402811,20588,1218,96,30615,1127,1127,73518,89,4191,0


Converting to forward existential form...Done !
original formula: AG(((EX((i10.u95.p617==1)) + AF(((i16.i2.i2.u134.p763==0)||(i0.u16.p163==1)))) + (i11.u97.p633==1)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((i11.u97.p633==1))) * !(EX((i10.u95.p617==1)))),!(((i16.i2.i2.u134.p763==0)||(i0.u16...176
Reverse transition relation is NOT exact ! Due to transitions t24, t47, t77, t86, t87, t131, t165, t177, t215, t259, t300, t312, t347, t356, t400, t434, t4...1044
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,0,2.11217,92924,1,0,182180,1747,7389,419257,430,7301,447272
FORMULA CO4-PT-19-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 778/778 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 550 transition count 746
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 550 transition count 746
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 68 place count 550 transition count 740
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 90 place count 528 transition count 718
Iterating global reduction 1 with 22 rules applied. Total rules applied 112 place count 528 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 113 place count 528 transition count 717
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 127 place count 514 transition count 703
Iterating global reduction 2 with 14 rules applied. Total rules applied 141 place count 514 transition count 703
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 143 place count 514 transition count 701
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 151 place count 506 transition count 693
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 506 transition count 693
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 506 transition count 692
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 166 place count 500 transition count 686
Iterating global reduction 4 with 6 rules applied. Total rules applied 172 place count 500 transition count 686
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 498 transition count 684
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 498 transition count 684
Applied a total of 176 rules in 42 ms. Remains 498 /581 variables (removed 83) and now considering 684/778 (removed 94) transitions.
// Phase 1: matrix 684 rows 498 cols
[2024-06-02 19:18:47] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 19:18:47] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 19:18:47] [INFO ] Invariant cache hit.
[2024-06-02 19:18:47] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 683 sub problems to find dead transitions.
[2024-06-02 19:18:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 3 (OVERLAPS) 684/1182 variables, 498/503 constraints. Problems are: Problem set: 0 solved, 683 unsolved
[2024-06-02 19:19:12] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 3 ms to minimize.
[2024-06-02 19:19:12] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 3 ms to minimize.
[2024-06-02 19:19:13] [INFO ] Deduced a trap composed of 187 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 506 constraints, problems are : Problem set: 0 solved, 683 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 683/683 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 683 unsolved
[2024-06-02 19:19:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:19:27] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 5 (OVERLAPS) 684/1182 variables, 498/508 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1182 variables, 683/1191 constraints. Problems are: Problem set: 0 solved, 683 unsolved
[2024-06-02 19:19:37] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 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, 683 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 683/683 constraints, Known Traps: 6/6 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Starting structural reductions in LTL mode, iteration 1 : 498/581 places, 684/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60636 ms. Remains : 498/581 places, 684/778 transitions.
[2024-06-02 19:19:48] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:19:48] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:19:48] [INFO ] Input system was already deterministic with 684 transitions.
[2024-06-02 19:19:48] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:19:48] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:19:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10584284893745927812.gal : 2 ms
[2024-06-02 19:19:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality14519278990071445808.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/CTLCardinality10584284893745927812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14519278990071445808.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,6.57246e+11,11.1664,299228,2,25542,5,862624,6,0,2670,1.55015e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:20:18] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:20:18] [INFO ] Applying decomposition
[2024-06-02 19:20:18] [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/graph18393725495846968151.txt' '-o' '/tmp/graph18393725495846968151.bin' '-w' '/tmp/graph18393725495846968151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18393725495846968151.bin' '-l' '-1' '-v' '-w' '/tmp/graph18393725495846968151.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:20:18] [INFO ] Decomposing Gal with order
[2024-06-02 19:20:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:20:18] [INFO ] Removed a total of 413 redundant transitions.
[2024-06-02 19:20:18] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:20:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 3 ms.
[2024-06-02 19:20:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12447729947864534801.gal : 4 ms
[2024-06-02 19:20:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9384738770174201440.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/CTLCardinality12447729947864534801.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9384738770174201440.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,6.57246e+11,0.743613,33696,1545,96,53087,881,1217,153896,83,3725,0


Converting to forward existential form...Done !
original formula: EG(((EF((i18.u181.p1077==1)) * EX((EF((i17.u172.p1011==1)) + AF(((i6.i0.i2.u16.p184==0)||(i6.i0.i3.u63.p401==1)))))) * (AF(!(A((i5.u73.p4...247
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U (i18.u181.p1077==1)) * EX((E(TRUE U (i17.u172.p1011==1)) + !(EG(!(((i6.i0.i2.u16.p184==0)|...391
Reverse transition relation is NOT exact ! Due to transitions t26, t49, t83, t92, t93, t137, t171, t183, t221, t244, t265, t355, t364, t455, t487, t498, t5...1042
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 581/581 places, 778/778 transitions.
Graph (trivial) has 623 edges and 581 vertex of which 3 / 581 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 1080 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 286 place count 572 transition count 484
Reduce places removed 284 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 290 rules applied. Total rules applied 576 place count 288 transition count 478
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 578 place count 286 transition count 478
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 578 place count 286 transition count 433
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 668 place count 241 transition count 433
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 678 place count 231 transition count 420
Iterating global reduction 3 with 10 rules applied. Total rules applied 688 place count 231 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 691 place count 231 transition count 417
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 693 place count 229 transition count 415
Iterating global reduction 4 with 2 rules applied. Total rules applied 695 place count 229 transition count 415
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 767 place count 193 transition count 378
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 4 with 12 rules applied. Total rules applied 779 place count 193 transition count 366
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 786 place count 189 transition count 363
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 793 place count 182 transition count 351
Iterating global reduction 6 with 7 rules applied. Total rules applied 800 place count 182 transition count 351
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 802 place count 181 transition count 350
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 803 place count 180 transition count 348
Iterating global reduction 6 with 1 rules applied. Total rules applied 804 place count 180 transition count 348
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 805 place count 179 transition count 346
Iterating global reduction 6 with 1 rules applied. Total rules applied 806 place count 179 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 807 place count 179 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 833 place count 179 transition count 319
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 7 with 15 rules applied. Total rules applied 848 place count 179 transition count 304
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 863 place count 164 transition count 304
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 863 place count 164 transition count 301
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 869 place count 161 transition count 301
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 871 place count 160 transition count 300
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 873 place count 158 transition count 298
Applied a total of 873 rules in 80 ms. Remains 158 /581 variables (removed 423) and now considering 298/778 (removed 480) transitions.
// Phase 1: matrix 298 rows 158 cols
[2024-06-02 19:20:48] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:20:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 19:20:48] [INFO ] Invariant cache hit.
[2024-06-02 19:20:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:20:48] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-06-02 19:20:48] [INFO ] Redundant transitions in 14 ms returned []
Running 278 sub problems to find dead transitions.
[2024-06-02 19:20:48] [INFO ] Invariant cache hit.
[2024-06-02 19:20:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 297/455 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 1/456 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 0/456 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 164 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8672 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 297/455 variables, 158/163 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 278/441 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 1/456 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 442 constraints, problems are : Problem set: 0 solved, 278 unsolved in 12138 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
After SMT, in 20891ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 20895ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/581 places, 298/778 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21196 ms. Remains : 158/581 places, 298/778 transitions.
[2024-06-02 19:21:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:21:09] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:21:09] [INFO ] Input system was already deterministic with 298 transitions.
[2024-06-02 19:21:09] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:21:09] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:21:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality5570362938037073980.gal : 2 ms
[2024-06-02 19:21:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality189906212456572953.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/CTLCardinality5570362938037073980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality189906212456572953.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.15236e+07,0.179362,9872,2,1980,5,27562,6,0,916,22977,0


Converting to forward existential form...Done !
original formula: EG((p551==0))
=> equivalent forward existential formula: [FwdG(Init,(p551==0))] != FALSE
Hit Full ! (commute/partial/dont) 296/0/2
(forward)formula 0,1,1.09993,41896,1,0,10,217691,19,4,4798,84626,8
FORMULA CO4-PT-19-CTLCardinality-2024-12 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 : 581/581 places, 778/778 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 545 transition count 740
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 545 transition count 740
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 78 place count 545 transition count 734
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 102 place count 521 transition count 710
Iterating global reduction 1 with 24 rules applied. Total rules applied 126 place count 521 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 521 transition count 709
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 139 place count 509 transition count 697
Iterating global reduction 2 with 12 rules applied. Total rules applied 151 place count 509 transition count 697
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 509 transition count 694
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 160 place count 503 transition count 688
Iterating global reduction 3 with 6 rules applied. Total rules applied 166 place count 503 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 167 place count 503 transition count 687
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 171 place count 499 transition count 683
Iterating global reduction 4 with 4 rules applied. Total rules applied 175 place count 499 transition count 683
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 177 place count 497 transition count 681
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 497 transition count 681
Applied a total of 179 rules in 46 ms. Remains 497 /581 variables (removed 84) and now considering 681/778 (removed 97) transitions.
// Phase 1: matrix 681 rows 497 cols
[2024-06-02 19:21:10] [INFO ] Computed 5 invariants in 9 ms
[2024-06-02 19:21:10] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 19:21:10] [INFO ] Invariant cache hit.
[2024-06-02 19:21:11] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2024-06-02 19:21:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
[2024-06-02 19:21:25] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-02 19:21:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 4 (OVERLAPS) 681/1178 variables, 497/504 constraints. Problems are: Problem set: 0 solved, 680 unsolved
[2024-06-02 19:21:36] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-06-02 19:21:36] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:21:37] [INFO ] Deduced a trap composed of 198 places in 89 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 507 constraints, problems are : Problem set: 0 solved, 680 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 680 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 1 (OVERLAPS) 1/497 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/497 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 4 (OVERLAPS) 681/1178 variables, 497/507 constraints. Problems are: Problem set: 0 solved, 680 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1178 variables, 680/1187 constraints. Problems are: Problem set: 0 solved, 680 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 1187 constraints, problems are : Problem set: 0 solved, 680 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 497/497 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 5/5 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 680 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Starting structural reductions in LTL mode, iteration 1 : 497/581 places, 681/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60625 ms. Remains : 497/581 places, 681/778 transitions.
[2024-06-02 19:22:11] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:22:11] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:22:11] [INFO ] Input system was already deterministic with 681 transitions.
[2024-06-02 19:22:11] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:22:11] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:22:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality13454185347646438870.gal : 3 ms
[2024-06-02 19:22:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16468094285789558297.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/CTLCardinality13454185347646438870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16468094285789558297.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,5.6887e+11,11.5935,317224,2,25318,5,901914,6,0,2663,1.64241e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:22:41] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:22:41] [INFO ] Applying decomposition
[2024-06-02 19:22:41] [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/graph8335168678546775812.txt' '-o' '/tmp/graph8335168678546775812.bin' '-w' '/tmp/graph8335168678546775812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8335168678546775812.bin' '-l' '-1' '-v' '-w' '/tmp/graph8335168678546775812.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:22:41] [INFO ] Decomposing Gal with order
[2024-06-02 19:22:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:22:41] [INFO ] Removed a total of 392 redundant transitions.
[2024-06-02 19:22:41] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:22:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-06-02 19:22:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality3184891359498484790.gal : 4 ms
[2024-06-02 19:22:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality207240518527946420.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/CTLCardinality3184891359498484790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality207240518527946420.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,5.6887e+11,0.633357,29652,1507,105,47402,973,1157,130518,86,4011,0


Converting to forward existential form...Done !
original formula: EX(EG(A(EF((i13.u120.p764!=1)) U ((i17.u78.p554==0)||(i17.u151.p894==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((E(!(((i17.u78.p554==0)||(i17.u151.p894==1))) U (!(E(TRUE U (i13.u120.p764!=1))) * !(((i17.u78....249
Reverse transition relation is NOT exact ! Due to transitions t26, t79, t88, t89, t135, t181, t202, t266, t306, t307, t319, t331, t355, t364, t408, t442, t...1029
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 778/778 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 548 transition count 743
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 548 transition count 743
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 548 transition count 740
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 94 place count 523 transition count 715
Iterating global reduction 1 with 25 rules applied. Total rules applied 119 place count 523 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 523 transition count 714
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 133 place count 510 transition count 701
Iterating global reduction 2 with 13 rules applied. Total rules applied 146 place count 510 transition count 701
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 149 place count 510 transition count 698
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 156 place count 503 transition count 691
Iterating global reduction 3 with 7 rules applied. Total rules applied 163 place count 503 transition count 691
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 503 transition count 690
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 170 place count 497 transition count 684
Iterating global reduction 4 with 6 rules applied. Total rules applied 176 place count 497 transition count 684
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 178 place count 495 transition count 682
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 495 transition count 682
Applied a total of 180 rules in 42 ms. Remains 495 /581 variables (removed 86) and now considering 682/778 (removed 96) transitions.
// Phase 1: matrix 682 rows 495 cols
[2024-06-02 19:23:11] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 19:23:11] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 19:23:11] [INFO ] Invariant cache hit.
[2024-06-02 19:23:12] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 681 sub problems to find dead transitions.
[2024-06-02 19:23:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2024-06-02 19:23:26] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-02 19:23:26] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (OVERLAPS) 682/1177 variables, 495/502 constraints. Problems are: Problem set: 0 solved, 681 unsolved
[2024-06-02 19:23:37] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:23:37] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-06-02 19:23:38] [INFO ] Deduced a trap composed of 188 places in 78 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/1177 variables, and 505 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 681 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 4 (OVERLAPS) 682/1177 variables, 495/505 constraints. Problems are: Problem set: 0 solved, 681 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1177 variables, 681/1186 constraints. Problems are: Problem set: 0 solved, 681 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/1177 variables, and 1186 constraints, problems are : Problem set: 0 solved, 681 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 681/681 constraints, Known Traps: 5/5 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 681 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 495/581 places, 682/778 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60628 ms. Remains : 495/581 places, 682/778 transitions.
[2024-06-02 19:24:12] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:24:12] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:24:12] [INFO ] Input system was already deterministic with 682 transitions.
[2024-06-02 19:24:12] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:24:12] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:24:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11182930591649481496.gal : 3 ms
[2024-06-02 19:24:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7120275042584851802.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/CTLCardinality11182930591649481496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7120275042584851802.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,6.1266e+11,11.9465,322392,2,25493,5,904219,6,0,2656,1.67024e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-06-02 19:24:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:24:42] [INFO ] Applying decomposition
[2024-06-02 19:24:42] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1996921515667927144.txt' '-o' '/tmp/graph1996921515667927144.bin' '-w' '/tmp/graph1996921515667927144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1996921515667927144.bin' '-l' '-1' '-v' '-w' '/tmp/graph1996921515667927144.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:24:42] [INFO ] Decomposing Gal with order
[2024-06-02 19:24:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:24:42] [INFO ] Removed a total of 407 redundant transitions.
[2024-06-02 19:24:42] [INFO ] Flatten gal took : 22 ms
[2024-06-02 19:24:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-06-02 19:24:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality5116445679573612195.gal : 4 ms
[2024-06-02 19:24:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality8481925556307020985.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/CTLCardinality5116445679573612195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8481925556307020985.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,6.1266e+11,0.51933,25672,1459,116,39318,1097,1218,107279,101,4271,0


Converting to forward existential form...Done !
original formula: AX(!(E(((A((i18.u161.p903==1) U (i3.u33.p279==0)) * (i11.u94.p591!=0)) + E(EF((i4.i0.i1.u45.p326==0)) U EF(((i16.u141.p821==0)||(i2.u72.p...267
=> equivalent forward existential formula: [((((FwdU(EY(Init),((!((E(!((i3.u33.p279==0)) U (!((i18.u161.p903==1)) * !((i3.u33.p279==0)))) + EG(!((i3.u33.p2...450
Reverse transition relation is NOT exact ! Due to transitions t25, t48, t78, t91, t92, t138, t184, t251, t266, t354, t363, t486, t554, t555, t590, t591, t6...1070
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Detected timeout of ITS tools.
[2024-06-02 19:25:12] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:25:12] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:25:12] [INFO ] Applying decomposition
[2024-06-02 19:25:12] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1085385077243692680.txt' '-o' '/tmp/graph1085385077243692680.bin' '-w' '/tmp/graph1085385077243692680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1085385077243692680.bin' '-l' '-1' '-v' '-w' '/tmp/graph1085385077243692680.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:25:12] [INFO ] Decomposing Gal with order
[2024-06-02 19:25:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:25:12] [INFO ] Removed a total of 431 redundant transitions.
[2024-06-02 19:25:12] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:25:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 5 ms.
[2024-06-02 19:25:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality2147192747705253094.gal : 5 ms
[2024-06-02 19:25:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7696205500887242205.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/CTLCardinality2147192747705253094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7696205500887242205.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 7 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.69372e+12,0.794253,32404,2257,161,45571,1944,1269,157830,114,8671,0


Converting to forward existential form...Done !
original formula: (EF(AG((AG(A((i11.i2.i0.u111.p601==1) U (i20.u37.p228==0))) * EX((i8.u84.p450==1))))) + EX(AG(EF(EX((i9.u122.p643==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(!((E(!((i20.u37.p228==0)) U (!((i11.i2.i0.u111.p601==1)) * !((i2...317
Reverse transition relation is NOT exact ! Due to transitions t36, t60, t109, t122, t123, t172, t209, t221, t242, t262, t312, t328, t382, t408, t424, t472,...1200
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
[2024-06-02 19:51:09] [INFO ] Applying decomposition
[2024-06-02 19:51:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:51:09] [INFO ] Decomposing Gal with order
[2024-06-02 19:51:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:51:09] [INFO ] Removed a total of 253 redundant transitions.
[2024-06-02 19:51:09] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:51:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 6 ms.
[2024-06-02 19:51:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality7601421490222943576.gal : 2 ms
[2024-06-02 19:51:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality753349842836319437.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/CTLCardinality7601421490222943576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality753349842836319437.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 7 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.69372e+12,5.18069,170212,989,5324,121463,223954,299,619398,1710,1.09485e+06,0


Converting to forward existential form...Done !
original formula: (EF(AG((AG(A((i0.i1.i0.i1.u11.p601==1) U (i0.i0.i0.u5.p228==0))) * EX((i0.i1.i0.u9.p450==1))))) + EX(AG(EF(EX((i0.i1.i0.i1.u11.p643==0)))...158
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !(!((E(!((i0.i0.i0.u5.p228==0)) U (!((i0.i1.i0.i1.u11.p601==1)) * ...343
Reverse transition relation is NOT exact ! Due to transitions i0.t631, i0.t262, i0.t109, i0.i0.i0.t424, i0.i0.i0.u5.t3, i0.i0.i0.u5.t430, i0.i0.i0.u5.t468,...1888
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

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

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