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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 239K 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-18-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-18-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717354054146

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:47:35] [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 18:47:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:47:35] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-02 18:47:35] [INFO ] Transformed 979 places.
[2024-06-02 18:47:35] [INFO ] Transformed 1111 transitions.
[2024-06-02 18:47:35] [INFO ] Found NUPN structural information;
[2024-06-02 18:47:35] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-18-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 810 transition count 931
Discarding 113 places :
Symmetric choice reduction at 1 with 113 rule applications. Total rules 128 place count 697 transition count 816
Iterating global reduction 1 with 113 rules applied. Total rules applied 241 place count 697 transition count 816
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 326 place count 612 transition count 731
Iterating global reduction 1 with 85 rules applied. Total rules applied 411 place count 612 transition count 731
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 414 place count 612 transition count 728
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 456 place count 570 transition count 686
Iterating global reduction 2 with 42 rules applied. Total rules applied 498 place count 570 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 499 place count 570 transition count 685
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 522 place count 547 transition count 662
Iterating global reduction 3 with 23 rules applied. Total rules applied 545 place count 547 transition count 662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 546 place count 547 transition count 661
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 556 place count 537 transition count 651
Iterating global reduction 4 with 10 rules applied. Total rules applied 566 place count 537 transition count 651
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 572 place count 531 transition count 645
Iterating global reduction 4 with 6 rules applied. Total rules applied 578 place count 531 transition count 645
Applied a total of 578 rules in 244 ms. Remains 531 /822 variables (removed 291) and now considering 645/934 (removed 289) transitions.
// Phase 1: matrix 645 rows 531 cols
[2024-06-02 18:47:35] [INFO ] Computed 5 invariants in 18 ms
[2024-06-02 18:47:36] [INFO ] Implicit Places using invariants in 290 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 323 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/822 places, 645/934 transitions.
Applied a total of 0 rules in 27 ms. Remains 530 /530 variables (removed 0) and now considering 645/645 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 530/822 places, 645/934 transitions.
Support contains 72 out of 530 places after structural reductions.
[2024-06-02 18:47:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 18:47:36] [INFO ] Flatten gal took : 61 ms
FORMULA CO4-PT-18-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:47:36] [INFO ] Flatten gal took : 28 ms
[2024-06-02 18:47:36] [INFO ] Input system was already deterministic with 645 transitions.
Support contains 68 out of 530 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (64 resets) in 1573 ms. (25 steps per ms) remains 37/43 properties
BEST_FIRST walk for 4003 steps (24 resets) in 22 ms. (174 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (20 resets) in 28 ms. (138 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (25 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (20 resets) in 44 ms. (88 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (21 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (22 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (19 resets) in 20 ms. (190 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4002 steps (20 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (16 resets) in 22 ms. (173 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (21 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (19 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (22 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (17 resets) in 22 ms. (173 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4000 steps (23 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (17 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (19 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (18 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (19 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (20 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (21 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (22 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (23 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (22 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
// Phase 1: matrix 645 rows 530 cols
[2024-06-02 18:47:37] [INFO ] Computed 4 invariants in 6 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, 27 unsolved
At refinement iteration 1 (OVERLAPS) 83/125 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 253/378 variables, 77/119 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 12/390 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 17/407 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 405/812 variables, 201/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/812 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 254/1066 variables, 140/465 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 84/1150 variables, 51/516 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1150 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 21/1171 variables, 15/531 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1171 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 4/1175 variables, 3/534 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1175 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 0/1175 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 534 constraints, problems are : Problem set: 0 solved, 27 unsolved in 3306 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 83/125 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 253/378 variables, 77/120 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 26/146 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 12/390 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 17/407 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 405/812 variables, 201/352 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/812 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 254/1066 variables, 140/492 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1066 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 84/1150 variables, 51/543 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1150 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 18 (OVERLAPS) 21/1171 variables, 15/558 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1171 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 20 (OVERLAPS) 4/1175 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1175 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 22 (OVERLAPS) 0/1175 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 561 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 8375ms problems are : Problem set: 0 solved, 27 unsolved
Fused 27 Parikh solutions to 11 different solutions.
Parikh walk visited 23 properties in 6761 ms.
Support contains 5 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 645/645 transitions.
Graph (trivial) has 555 edges and 530 vertex of which 3 / 530 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 797 edges and 528 vertex of which 508 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 282 rules applied. Total rules applied 284 place count 508 transition count 347
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 266 rules applied. Total rules applied 550 place count 244 transition count 345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 551 place count 243 transition count 345
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 551 place count 243 transition count 312
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 617 place count 210 transition count 312
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 626 place count 201 transition count 303
Iterating global reduction 3 with 9 rules applied. Total rules applied 635 place count 201 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 635 place count 201 transition count 301
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 639 place count 199 transition count 301
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 643 place count 195 transition count 297
Iterating global reduction 3 with 4 rules applied. Total rules applied 647 place count 195 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 648 place count 195 transition count 296
Performed 80 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 808 place count 115 transition count 200
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 815 place count 115 transition count 193
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 823 place count 107 transition count 185
Iterating global reduction 5 with 8 rules applied. Total rules applied 831 place count 107 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 834 place count 107 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 838 place count 105 transition count 180
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 842 place count 105 transition count 176
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 846 place count 101 transition count 172
Iterating global reduction 7 with 4 rules applied. Total rules applied 850 place count 101 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 851 place count 101 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 855 place count 99 transition count 169
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 857 place count 99 transition count 167
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 859 place count 97 transition count 165
Iterating global reduction 9 with 2 rules applied. Total rules applied 861 place count 97 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 862 place count 97 transition count 164
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 863 place count 96 transition count 163
Iterating global reduction 10 with 1 rules applied. Total rules applied 864 place count 96 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 865 place count 96 transition count 162
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 56 rules applied. Total rules applied 921 place count 68 transition count 164
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 11 with 34 rules applied. Total rules applied 955 place count 68 transition count 130
Discarding 23 places :
Symmetric choice reduction at 12 with 23 rule applications. Total rules 978 place count 45 transition count 96
Iterating global reduction 12 with 23 rules applied. Total rules applied 1001 place count 45 transition count 96
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 1019 place count 45 transition count 78
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 1023 place count 41 transition count 67
Iterating global reduction 13 with 4 rules applied. Total rules applied 1027 place count 41 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 1030 place count 41 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1032 place count 40 transition count 79
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1034 place count 40 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 15 with 8 rules applied. Total rules applied 1042 place count 40 transition count 69
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1043 place count 39 transition count 68
Iterating global reduction 15 with 1 rules applied. Total rules applied 1044 place count 39 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1045 place count 39 transition count 67
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 1050 place count 39 transition count 62
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 1057 place count 34 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1058 place count 34 transition count 59
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1059 place count 34 transition count 59
Graph (complete) has 95 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 1060 place count 33 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1061 place count 33 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1062 place count 33 transition count 58
Graph (complete) has 92 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 1063 place count 32 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1064 place count 32 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1065 place count 32 transition count 57
Graph (complete) has 88 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 1 rules applied. Total rules applied 1066 place count 31 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1067 place count 31 transition count 56
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 1068 place count 31 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1069 place count 30 transition count 55
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 18 edges and 27 vertex of which 3 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 23 with 5 rules applied. Total rules applied 1074 place count 25 transition count 54
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 24 with 7 rules applied. Total rules applied 1081 place count 24 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 1082 place count 23 transition count 48
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 1083 place count 22 transition count 47
Iterating global reduction 26 with 1 rules applied. Total rules applied 1084 place count 22 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1085 place count 22 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 27 with 8 rules applied. Total rules applied 1093 place count 22 transition count 38
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 1094 place count 21 transition count 36
Iterating global reduction 27 with 1 rules applied. Total rules applied 1095 place count 21 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 1096 place count 21 transition count 35
Free-agglomeration rule applied 4 times.
Iterating global reduction 28 with 4 rules applied. Total rules applied 1100 place count 21 transition count 31
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 1104 place count 17 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 29 with 3 rules applied. Total rules applied 1107 place count 17 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 29 with 1 rules applied. Total rules applied 1108 place count 17 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 1110 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 30 with 1 rules applied. Total rules applied 1111 place count 16 transition count 26
Applied a total of 1111 rules in 109 ms. Remains 16 /530 variables (removed 514) and now considering 26/645 (removed 619) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 16/530 places, 26/645 transitions.
RANDOM walk for 287 steps (0 resets) in 6 ms. (41 steps per ms) remains 0/4 properties
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:47:52] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:47:52] [INFO ] Input system was already deterministic with 645 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 800 edges and 530 vertex of which 520 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 645
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 490 transition count 607
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 490 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 490 transition count 606
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 107 place count 462 transition count 578
Iterating global reduction 2 with 28 rules applied. Total rules applied 135 place count 462 transition count 578
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 148 place count 449 transition count 565
Iterating global reduction 2 with 13 rules applied. Total rules applied 161 place count 449 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 449 transition count 564
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 169 place count 442 transition count 557
Iterating global reduction 3 with 7 rules applied. Total rules applied 176 place count 442 transition count 557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 442 transition count 556
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 181 place count 438 transition count 552
Iterating global reduction 4 with 4 rules applied. Total rules applied 185 place count 438 transition count 552
Applied a total of 185 rules in 78 ms. Remains 438 /530 variables (removed 92) and now considering 552/645 (removed 93) transitions.
// Phase 1: matrix 552 rows 438 cols
[2024-06-02 18:47:52] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 18:47:52] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 18:47:52] [INFO ] Invariant cache hit.
[2024-06-02 18:47:53] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2024-06-02 18:47:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 552/990 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-02 18:48:10] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 31 ms to minimize.
[2024-06-02 18:48:10] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/990 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)timeout

(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/990 variables, and 444 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (OVERLAPS) 552/990 variables, 438/444 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/990 variables, 551/995 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/990 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/990 variables, and 995 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Starting structural reductions in LTL mode, iteration 1 : 438/530 places, 552/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60637 ms. Remains : 438/530 places, 552/645 transitions.
[2024-06-02 18:48:53] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:48:53] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:48:53] [INFO ] Input system was already deterministic with 552 transitions.
[2024-06-02 18:48:53] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:48:53] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:48:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality14000038766465315494.gal : 8 ms
[2024-06-02 18:48:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5749961164639388692.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/CTLCardinality14000038766465315494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5749961164639388692.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.31568e+08,1.39509,42936,2,5637,5,119053,6,0,2302,212178,0


Converting to forward existential form...Done !
original formula: EX(E(EX(AX((p693==0))) U !(AG(((p201==0)||(p403==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(EY(Init),EX(!(EX(!((p693==0)))))),TRUE) * !(((p201==0)||(p403==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...463
Detected timeout of ITS tools.
[2024-06-02 18:49:23] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:49:23] [INFO ] Applying decomposition
[2024-06-02 18:49:23] [INFO ] Flatten gal took : 15 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/graph4982997038639257979.txt' '-o' '/tmp/graph4982997038639257979.bin' '-w' '/tmp/graph4982997038639257979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4982997038639257979.bin' '-l' '-1' '-v' '-w' '/tmp/graph4982997038639257979.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:49:23] [INFO ] Decomposing Gal with order
[2024-06-02 18:49:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:49:23] [INFO ] Removed a total of 171 redundant transitions.
[2024-06-02 18:49:23] [INFO ] Flatten gal took : 59 ms
[2024-06-02 18:49:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2024-06-02 18:49:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10156013698273729806.gal : 9 ms
[2024-06-02 18:49:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality18016846326073224884.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/CTLCardinality10156013698273729806.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18016846326073224884.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,6.31568e+08,0.157736,9784,654,93,10400,1375,1000,16604,95,4835,0


Converting to forward existential form...Done !
original formula: EX(E(EX(AX((i12.u89.p693==0))) U !(AG(((i2.i0.i0.u16.p201==0)||(i7.i0.i2.u62.p403==1))))))
=> equivalent forward existential formula: [(FwdU(FwdU(EY(Init),EX(!(EX(!((i12.u89.p693==0)))))),TRUE) * !(((i2.i0.i0.u16.p201==0)||(i7.i0.i2.u62.p403==1))...167
Reverse transition relation is NOT exact ! Due to transitions t47, t56, t100, t271, t283, t297, t377, t389, t460, t469, t496, t497, i1.t451, i2.t429, i2.i0...767
(forward)formula 0,1,11.9793,324472,1,0,511429,3595,6658,1.73117e+06,478,16773,596853
FORMULA CO4-PT-18-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 645
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 490 transition count 607
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 490 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 490 transition count 606
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 106 place count 463 transition count 579
Iterating global reduction 2 with 27 rules applied. Total rules applied 133 place count 463 transition count 579
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 147 place count 449 transition count 565
Iterating global reduction 2 with 14 rules applied. Total rules applied 161 place count 449 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 449 transition count 564
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 170 place count 441 transition count 556
Iterating global reduction 3 with 8 rules applied. Total rules applied 178 place count 441 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 441 transition count 555
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 184 place count 436 transition count 550
Iterating global reduction 4 with 5 rules applied. Total rules applied 189 place count 436 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 190 place count 436 transition count 549
Applied a total of 190 rules in 51 ms. Remains 436 /530 variables (removed 94) and now considering 549/645 (removed 96) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 18:49:35] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 18:49:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:49:36] [INFO ] Invariant cache hit.
[2024-06-02 18:49:36] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:49:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-06-02 18:49:53] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 436/530 places, 549/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60539 ms. Remains : 436/530 places, 549/645 transitions.
[2024-06-02 18:50:36] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:50:36] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:50:36] [INFO ] Input system was already deterministic with 549 transitions.
[2024-06-02 18:50:36] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:50:36] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:50:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality5870111126641051232.gal : 3 ms
[2024-06-02 18:50:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality2878638499387156886.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/CTLCardinality5870111126641051232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2878638499387156886.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,6.25978e+08,1.1159,41952,2,5587,5,116819,6,0,2291,207566,0


Converting to forward existential form...Done !
original formula: EG((AX(EX((p812==0))) + (p305==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(EX((p812==0))))) + (p305==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
Detected timeout of ITS tools.
[2024-06-02 18:51:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:51:06] [INFO ] Applying decomposition
[2024-06-02 18:51:06] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13409875275773558440.txt' '-o' '/tmp/graph13409875275773558440.bin' '-w' '/tmp/graph13409875275773558440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13409875275773558440.bin' '-l' '-1' '-v' '-w' '/tmp/graph13409875275773558440.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:51:06] [INFO ] Decomposing Gal with order
[2024-06-02 18:51:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:51:06] [INFO ] Removed a total of 166 redundant transitions.
[2024-06-02 18:51:06] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:51:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-06-02 18:51:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4908308476253150739.gal : 5 ms
[2024-06-02 18:51:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality17611253803352664922.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/CTLCardinality4908308476253150739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17611253803352664922.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.25978e+08,0.261397,13384,723,95,16546,3141,956,30883,90,13277,0


Converting to forward existential form...Done !
original formula: EG((AX(EX((i16.u140.p812==0))) + (i4.u36.p305==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!(EX((i16.u140.p812==0))))) + (i4.u36.p305==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t47, t56, t184, t269, t281, t295, t339, t387, t467, t494, t495, i0.i0.i0.u6.t458, i1.i0....751
Using saturation style SCC detection
Using 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
(forward)formula 0,1,20.5296,479344,1,0,811519,3787,5493,2.37598e+06,426,18337,905301
FORMULA CO4-PT-18-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 645
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 490 transition count 607
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 490 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 490 transition count 606
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 106 place count 463 transition count 579
Iterating global reduction 2 with 27 rules applied. Total rules applied 133 place count 463 transition count 579
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 147 place count 449 transition count 565
Iterating global reduction 2 with 14 rules applied. Total rules applied 161 place count 449 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 449 transition count 564
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 170 place count 441 transition count 556
Iterating global reduction 3 with 8 rules applied. Total rules applied 178 place count 441 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 441 transition count 555
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 184 place count 436 transition count 550
Iterating global reduction 4 with 5 rules applied. Total rules applied 189 place count 436 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 190 place count 436 transition count 549
Applied a total of 190 rules in 54 ms. Remains 436 /530 variables (removed 94) and now considering 549/645 (removed 96) transitions.
// Phase 1: matrix 549 rows 436 cols
[2024-06-02 18:51:27] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:51:27] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:51:27] [INFO ] Invariant cache hit.
[2024-06-02 18:51:27] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2024-06-02 18:51:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-06-02 18:51:43] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-06-02 18:51:44] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/985 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 436/530 places, 549/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60523 ms. Remains : 436/530 places, 549/645 transitions.
[2024-06-02 18:52:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:52:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:52:27] [INFO ] Input system was already deterministic with 549 transitions.
[2024-06-02 18:52:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:52:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:52:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality165310364142270173.gal : 11 ms
[2024-06-02 18:52:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality4450649090237334365.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/CTLCardinality165310364142270173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4450649090237334365.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,6.23636e+08,1.11646,41160,2,5682,5,115684,6,0,2291,201391,0


Converting to forward existential form...Done !
original formula: AF(AX((((p140==1) + AF((p651==1))) + AX(((p557==0)&&(p934==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((p140==1) + !(EG(!((p651==1))))) + !(EX(!(((p557==0)&&(p934==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t27, t36, t45, t47, t48, t49, t50, t51, t53, t56, t100, t1...457
Detected timeout of ITS tools.
[2024-06-02 18:52:58] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:52:58] [INFO ] Applying decomposition
[2024-06-02 18:52:58] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12875986909923465831.txt' '-o' '/tmp/graph12875986909923465831.bin' '-w' '/tmp/graph12875986909923465831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12875986909923465831.bin' '-l' '-1' '-v' '-w' '/tmp/graph12875986909923465831.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:52:58] [INFO ] Decomposing Gal with order
[2024-06-02 18:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:52:58] [INFO ] Removed a total of 169 redundant transitions.
[2024-06-02 18:52:58] [INFO ] Flatten gal took : 45 ms
[2024-06-02 18:52:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-06-02 18:52:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2735223376992098248.gal : 5 ms
[2024-06-02 18:52:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality17942083610111011191.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/CTLCardinality2735223376992098248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17942083610111011191.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.23636e+08,0.170057,9388,582,93,9403,1409,970,15256,96,5021,0


Converting to forward existential form...Done !
original formula: AF(AX((((i1.u10.p140==1) + AF((i11.u112.p651==1))) + AX(((i9.i0.i0.u91.p557==0)&&(i19.u167.p934==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((i1.u10.p140==1) + !(EG(!((i11.u112.p651==1))))) + !(EX(!(((i9.i0.i0.u91.p557==0)&&(i19.u1...185
Reverse transition relation is NOT exact ! Due to transitions t47, t56, t100, t271, t283, t297, t387, t418, t458, t467, t494, t495, i1.t449, i2.i0.t427, i2...739
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 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 : 530/530 places, 645/645 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 645
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 491 transition count 608
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 491 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 491 transition count 607
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 103 place count 465 transition count 581
Iterating global reduction 2 with 26 rules applied. Total rules applied 129 place count 465 transition count 581
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 142 place count 452 transition count 568
Iterating global reduction 2 with 13 rules applied. Total rules applied 155 place count 452 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 452 transition count 567
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 164 place count 444 transition count 559
Iterating global reduction 3 with 8 rules applied. Total rules applied 172 place count 444 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 444 transition count 558
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 178 place count 439 transition count 553
Iterating global reduction 4 with 5 rules applied. Total rules applied 183 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 184 place count 439 transition count 552
Applied a total of 184 rules in 47 ms. Remains 439 /530 variables (removed 91) and now considering 552/645 (removed 93) transitions.
// Phase 1: matrix 552 rows 439 cols
[2024-06-02 18:53:28] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:53:28] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:53:28] [INFO ] Invariant cache hit.
[2024-06-02 18:53:28] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2024-06-02 18:53:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 552/991 variables, 439/443 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-02 18:53:45] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 3 ms to minimize.
[2024-06-02 18:53:45] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/991 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 991/991 variables, and 445 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (OVERLAPS) 552/991 variables, 439/445 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/991 variables, 551/996 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/991 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 991/991 variables, and 996 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 439/530 places, 552/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60476 ms. Remains : 439/530 places, 552/645 transitions.
[2024-06-02 18:54:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:54:28] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:54:28] [INFO ] Input system was already deterministic with 552 transitions.
[2024-06-02 18:54:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:54:28] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:54:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13324826900442246065.gal : 4 ms
[2024-06-02 18:54:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality1956479942836492629.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/CTLCardinality13324826900442246065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1956479942836492629.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.3437e+08,1.2753,45664,2,5548,5,123301,6,0,2306,234316,0


Converting to forward existential form...Done !
original formula: A(!(E(AX(FALSE) U AG(EF(((p129==0)||(p164==1)))))) U EX(!(EG((p802==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(EG((p802==0)))))))) * !(E(!(EX(!(EG((p802==0))))) U (!(!(E(!(EX(!(FALSE))) U !(E(TRUE U !(...233
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t52, t54, t57, t102, t1...463
Detected timeout of ITS tools.
[2024-06-02 18:54:58] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:54:58] [INFO ] Applying decomposition
[2024-06-02 18:54:58] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15111946315420522037.txt' '-o' '/tmp/graph15111946315420522037.bin' '-w' '/tmp/graph15111946315420522037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15111946315420522037.bin' '-l' '-1' '-v' '-w' '/tmp/graph15111946315420522037.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:54:58] [INFO ] Decomposing Gal with order
[2024-06-02 18:54:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:54:59] [INFO ] Removed a total of 166 redundant transitions.
[2024-06-02 18:54:59] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:54:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 4 ms.
[2024-06-02 18:54:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15107487330741342562.gal : 5 ms
[2024-06-02 18:54:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality15437965891071410913.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/CTLCardinality15107487330741342562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15437965891071410913.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,6.3437e+08,0.15689,9448,583,95,9426,1512,973,15565,88,5834,0


Converting to forward existential form...Done !
original formula: A(!(E(AX(FALSE) U AG(EF(((i2.u6.p129==0)||(i3.u14.p164==1)))))) U EX(!(EG((i17.u142.p802==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(EG((i17.u142.p802==0)))))))) * !(E(!(EX(!(EG((i17.u142.p802==0))))) U (!(!(E(!(EX(!(FALSE)...273
Reverse transition relation is NOT exact ! Due to transitions t48, t57, t102, t186, t271, t283, t297, t341, t387, t430, t469, t496, t497, i0.i0.i0.u5.t460,...744
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,25.9748,715288,1,0,948347,5163,6795,4.5973e+06,466,27881,690458
FORMULA CO4-PT-18-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 645
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 491 transition count 608
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 491 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 491 transition count 607
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 103 place count 465 transition count 581
Iterating global reduction 2 with 26 rules applied. Total rules applied 129 place count 465 transition count 581
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 141 place count 453 transition count 569
Iterating global reduction 2 with 12 rules applied. Total rules applied 153 place count 453 transition count 569
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 160 place count 446 transition count 562
Iterating global reduction 2 with 7 rules applied. Total rules applied 167 place count 446 transition count 562
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 446 transition count 561
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 442 transition count 557
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 442 transition count 557
Applied a total of 176 rules in 36 ms. Remains 442 /530 variables (removed 88) and now considering 557/645 (removed 88) transitions.
// Phase 1: matrix 557 rows 442 cols
[2024-06-02 18:55:25] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:55:25] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:55:25] [INFO ] Invariant cache hit.
[2024-06-02 18:55:25] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 556 sub problems to find dead transitions.
[2024-06-02 18:55:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/999 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 556 unsolved
[2024-06-02 18:55:42] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 3 ms to minimize.
[2024-06-02 18:55:42] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/999 variables, and 448 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 557/999 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/999 variables, 556/1004 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/999 variables, and 1004 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 442/530 places, 557/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60436 ms. Remains : 442/530 places, 557/645 transitions.
[2024-06-02 18:56:25] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:56:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:25] [INFO ] Input system was already deterministic with 557 transitions.
[2024-06-02 18:56:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:56:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15801833172623844914.gal : 3 ms
[2024-06-02 18:56:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17288830684128414832.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/CTLCardinality15801833172623844914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17288830684128414832.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.98003e+08,1.09957,40148,2,5730,5,114541,6,0,2323,193460,0


Converting to forward existential form...Done !
original formula: EX(((p896==0)&&(p690==1)))
=> equivalent forward existential formula: [(EY(Init) * ((p896==0)&&(p690==1)))] != FALSE
(forward)formula 0,0,1.16984,40148,1,0,8,114541,8,1,2811,193460,2
FORMULA CO4-PT-18-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 645
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 36 place count 494 transition count 611
Iterating global reduction 1 with 34 rules applied. Total rules applied 70 place count 494 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 494 transition count 610
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 96 place count 469 transition count 585
Iterating global reduction 2 with 25 rules applied. Total rules applied 121 place count 469 transition count 585
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 133 place count 457 transition count 573
Iterating global reduction 2 with 12 rules applied. Total rules applied 145 place count 457 transition count 573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 457 transition count 572
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 154 place count 449 transition count 564
Iterating global reduction 3 with 8 rules applied. Total rules applied 162 place count 449 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 449 transition count 563
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 168 place count 444 transition count 558
Iterating global reduction 4 with 5 rules applied. Total rules applied 173 place count 444 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 174 place count 444 transition count 557
Applied a total of 174 rules in 51 ms. Remains 444 /530 variables (removed 86) and now considering 557/645 (removed 88) transitions.
// Phase 1: matrix 557 rows 444 cols
[2024-06-02 18:56:26] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 18:56:26] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:56:26] [INFO ] Invariant cache hit.
[2024-06-02 18:56:27] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 556 sub problems to find dead transitions.
[2024-06-02 18:56:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1001 variables, 444/448 constraints. Problems are: Problem set: 0 solved, 556 unsolved
[2024-06-02 18:56:43] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
[2024-06-02 18:56:44] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1001 variables, and 450 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 557/1001 variables, 444/450 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 556/1006 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1001 variables, and 1006 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 444/530 places, 557/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60497 ms. Remains : 444/530 places, 557/645 transitions.
[2024-06-02 18:57:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:57:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:57:27] [INFO ] Input system was already deterministic with 557 transitions.
[2024-06-02 18:57:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:57:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:57:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10702180799539233322.gal : 2 ms
[2024-06-02 18:57:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality17305002648737554506.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/CTLCardinality10702180799539233322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17305002648737554506.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.49616e+08,1.14383,42256,2,5812,5,120302,6,0,2331,204813,0


Converting to forward existential form...Done !
original formula: (AX(((p480==0)||(p218==1))) * (EG(((p762==0)&&(p593==1))) + (EX(((p934==0)||(p280==0))) * EG(((p349==0)||(p552==1))))))
=> equivalent forward existential formula: ([(EY(Init) * !(((p480==0)||(p218==1))))] = FALSE * [((Init * !((EX(((p934==0)||(p280==0))) * EG(((p349==0)||(p5...209
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t52, t54, t57, t101, t1...463
Detected timeout of ITS tools.
[2024-06-02 18:57:57] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:57:57] [INFO ] Applying decomposition
[2024-06-02 18:57:57] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8966426167788368994.txt' '-o' '/tmp/graph8966426167788368994.bin' '-w' '/tmp/graph8966426167788368994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8966426167788368994.bin' '-l' '-1' '-v' '-w' '/tmp/graph8966426167788368994.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:57:57] [INFO ] Decomposing Gal with order
[2024-06-02 18:57:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:57:57] [INFO ] Removed a total of 170 redundant transitions.
[2024-06-02 18:57:57] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:57:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-06-02 18:57:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17011720584418201467.gal : 4 ms
[2024-06-02 18:57:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4655706218660674280.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/CTLCardinality17011720584418201467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4655706218660674280.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.49616e+08,0.25889,14092,603,99,18107,4417,1052,31027,96,18750,0


Converting to forward existential form...Done !
original formula: (AX(((i9.u78.p480==0)||(i1.i0.i1.u23.p218==1))) * (EG(((i15.u139.p762==0)&&(i11.i0.i0.u101.p593==1))) + (EX(((i17.u166.p934==0)||(i2.i0.i...224
=> equivalent forward existential formula: ([(EY(Init) * !(((i9.u78.p480==0)||(i1.i0.i1.u23.p218==1))))] = FALSE * [((Init * !((EX(((i17.u166.p934==0)||(i2...296
Reverse transition relation is NOT exact ! Due to transitions t18, t48, t57, t101, t187, t274, t286, t300, t390, t463, t472, t500, t501, i0.t454, i1.i0.i1....771
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
(forward)formula 0,1,17.5915,527572,1,0,724361,5103,7105,3.25679e+06,509,25332,645028
FORMULA CO4-PT-18-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 645
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 37 place count 493 transition count 609
Iterating global reduction 1 with 36 rules applied. Total rules applied 73 place count 493 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 493 transition count 608
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 100 place count 467 transition count 582
Iterating global reduction 2 with 26 rules applied. Total rules applied 126 place count 467 transition count 582
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 140 place count 453 transition count 568
Iterating global reduction 2 with 14 rules applied. Total rules applied 154 place count 453 transition count 568
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 453 transition count 567
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 163 place count 445 transition count 559
Iterating global reduction 3 with 8 rules applied. Total rules applied 171 place count 445 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 445 transition count 558
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 177 place count 440 transition count 553
Iterating global reduction 4 with 5 rules applied. Total rules applied 182 place count 440 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 440 transition count 552
Applied a total of 183 rules in 40 ms. Remains 440 /530 variables (removed 90) and now considering 552/645 (removed 93) transitions.
// Phase 1: matrix 552 rows 440 cols
[2024-06-02 18:58:15] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:58:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:58:15] [INFO ] Invariant cache hit.
[2024-06-02 18:58:15] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2024-06-02 18:58:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 552/991 variables, 439/443 constraints. Problems are: Problem set: 0 solved, 551 unsolved
[2024-06-02 18:58:32] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:58:32] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/991 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 551 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 Real declared 991/992 variables, and 445 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/440 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (OVERLAPS) 552/991 variables, 439/445 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/991 variables, 549/994 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/991 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 7 (OVERLAPS) 1/992 variables, 1/995 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/992 variables, and 997 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 440/530 places, 552/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60445 ms. Remains : 440/530 places, 552/645 transitions.
[2024-06-02 18:59:15] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:59:15] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:59:15] [INFO ] Input system was already deterministic with 552 transitions.
[2024-06-02 18:59:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:59:15] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:59:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality12361942525523814539.gal : 2 ms
[2024-06-02 18:59:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality7624918344089461150.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/CTLCardinality12361942525523814539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7624918344089461150.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.54415e+08,1.25793,44608,2,6273,5,124373,6,0,2308,225272,0


Converting to forward existential form...Done !
original formula: E(((p148==0)||(p391==1)) U AX((!((AX(((p574==0)||(p926==1))) + AX((p864==1)))) * EX(AG(((p683==0)||(p612==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,((p148==0)||(p391==1))) * !(EX(!((!((!(EX(!(((p574==0)||(p926==1))))) + !(EX(!((p864==1)))))) * EX(!...208
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t20, t21, t22, t24, t27, t45, t47, t48, t49, t50, t51, t53, t56, t63, t10...474
Hit Full ! (commute/partial/dont) 548/0/4
(forward)formula 0,1,25.9202,715096,1,0,742,4.00374e+06,1137,495,13856,2.7612e+06,1153
FORMULA CO4-PT-18-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 645
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 492 transition count 609
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 492 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 492 transition count 608
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 101 place count 466 transition count 582
Iterating global reduction 2 with 26 rules applied. Total rules applied 127 place count 466 transition count 582
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 139 place count 454 transition count 570
Iterating global reduction 2 with 12 rules applied. Total rules applied 151 place count 454 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 454 transition count 569
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 158 place count 448 transition count 563
Iterating global reduction 3 with 6 rules applied. Total rules applied 164 place count 448 transition count 563
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 448 transition count 562
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 169 place count 444 transition count 558
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 444 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 174 place count 444 transition count 557
Applied a total of 174 rules in 43 ms. Remains 444 /530 variables (removed 86) and now considering 557/645 (removed 88) transitions.
// Phase 1: matrix 557 rows 444 cols
[2024-06-02 18:59:41] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:59:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:59:42] [INFO ] Invariant cache hit.
[2024-06-02 18:59:42] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 556 sub problems to find dead transitions.
[2024-06-02 18:59:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1001 variables, 444/448 constraints. Problems are: Problem set: 0 solved, 556 unsolved
[2024-06-02 18:59:59] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:59:59] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1001 variables, and 450 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 557/1001 variables, 444/450 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 556/1006 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1001 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 556 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 1001/1001 variables, and 1006 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 444/530 places, 557/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60453 ms. Remains : 444/530 places, 557/645 transitions.
[2024-06-02 19:00:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:42] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:00:42] [INFO ] Input system was already deterministic with 557 transitions.
[2024-06-02 19:00:42] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:00:42] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:00:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14690697094656539414.gal : 2 ms
[2024-06-02 19:00:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14923642050937263858.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/CTLCardinality14690697094656539414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14923642050937263858.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.5203e+08,1.15935,42348,2,5500,5,117558,6,0,2331,210270,0


Converting to forward existential form...Done !
original formula: AG((((p369==1) + EF(AX((p580==0)))) + ((p122==0)||(p844==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((p122==0)||(p844==1)))) * !((p369==1))) * !(E(TRUE U !(EX(!((p580==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t19, t20, t21, t22, t23, t24, t29, t38, t47, t49, t50, t51, t52, t53, t55, t58, t104, t1...457
(forward)formula 0,1,13.491,376176,1,0,703,1.76079e+06,1136,478,13149,1.38026e+06,1128
FORMULA CO4-PT-18-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Graph (trivial) has 551 edges and 530 vertex of which 3 / 530 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 798 edges and 528 vertex of which 518 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.8 ms
Discarding 10 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 255 rules applied. Total rules applied 257 place count 517 transition count 378
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 257 rules applied. Total rules applied 514 place count 262 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 515 place count 261 transition count 376
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 515 place count 261 transition count 341
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 585 place count 226 transition count 341
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 591 place count 220 transition count 335
Iterating global reduction 3 with 6 rules applied. Total rules applied 597 place count 220 transition count 335
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 597 place count 220 transition count 333
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 601 place count 218 transition count 333
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 605 place count 214 transition count 329
Iterating global reduction 3 with 4 rules applied. Total rules applied 609 place count 214 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 610 place count 214 transition count 328
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 676 place count 181 transition count 295
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 4 with 6 rules applied. Total rules applied 682 place count 181 transition count 289
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 685 place count 179 transition count 288
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 690 place count 174 transition count 283
Iterating global reduction 6 with 5 rules applied. Total rules applied 695 place count 174 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 696 place count 174 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 698 place count 173 transition count 281
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 699 place count 172 transition count 280
Iterating global reduction 7 with 1 rules applied. Total rules applied 700 place count 172 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 716 place count 172 transition count 264
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 7 with 10 rules applied. Total rules applied 726 place count 172 transition count 254
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 736 place count 162 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 736 place count 162 transition count 253
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 738 place count 161 transition count 253
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 740 place count 160 transition count 252
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 744 place count 160 transition count 252
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 746 place count 158 transition count 250
Applied a total of 746 rules in 109 ms. Remains 158 /530 variables (removed 372) and now considering 250/645 (removed 395) transitions.
// Phase 1: matrix 250 rows 158 cols
[2024-06-02 19:00:56] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:00:56] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 19:00:56] [INFO ] Invariant cache hit.
[2024-06-02 19:00:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:00:56] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-02 19:00:56] [INFO ] Redundant transitions in 12 ms returned []
Running 237 sub problems to find dead transitions.
[2024-06-02 19:00:56] [INFO ] Invariant cache hit.
[2024-06-02 19:00:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 249/407 variables, 158/162 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (OVERLAPS) 1/408 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 0/408 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 163 constraints, problems are : Problem set: 0 solved, 237 unsolved in 7114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 249/407 variables, 158/162 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 237/399 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 1/408 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 400 constraints, problems are : Problem set: 0 solved, 237 unsolved in 10900 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 158/158 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
After SMT, in 18074ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 18077ms
Starting structural reductions in SI_CTL mode, iteration 1 : 158/530 places, 250/645 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18382 ms. Remains : 158/530 places, 250/645 transitions.
[2024-06-02 19:01:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:01:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:01:14] [INFO ] Input system was already deterministic with 250 transitions.
[2024-06-02 19:01:14] [INFO ] Flatten gal took : 5 ms
[2024-06-02 19:01:14] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:01:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9662957520082334507.gal : 2 ms
[2024-06-02 19:01:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality10623240284646074742.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/CTLCardinality9662957520082334507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10623240284646074742.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.0443e+06,0.09095,7184,2,781,5,12560,6,0,872,13653,0


Converting to forward existential form...Done !
original formula: (EG(E(((p151==0)||(p686==1)) U ((p576==0)||(p760==1)))) * A((AG(!(EG((p518==1)))) + EF((p145!=0))) U ((p504==0)&&(p237==1))))
=> equivalent forward existential formula: [(((Init * EG(E(((p151==0)||(p686==1)) U ((p576==0)||(p760==1))))) * !(EG(!(((p504==0)&&(p237==1)))))) * !(E(!((...282
Reverse transition relation is NOT exact ! Due to transitions t5, t18, t38, t66, t81, t86, t122, t242, Intersection with reachable at each step enabled. (...202
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.83776,264076,1,0,802,1.7333e+06,544,490,5862,1.49455e+06,1198
FORMULA CO4-PT-18-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 645
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 496 transition count 612
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 496 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 496 transition count 611
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 92 place count 472 transition count 587
Iterating global reduction 2 with 24 rules applied. Total rules applied 116 place count 472 transition count 587
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 127 place count 461 transition count 576
Iterating global reduction 2 with 11 rules applied. Total rules applied 138 place count 461 transition count 576
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 461 transition count 575
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 144 place count 456 transition count 570
Iterating global reduction 3 with 5 rules applied. Total rules applied 149 place count 456 transition count 570
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 152 place count 453 transition count 567
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 453 transition count 567
Applied a total of 155 rules in 40 ms. Remains 453 /530 variables (removed 77) and now considering 567/645 (removed 78) transitions.
// Phase 1: matrix 567 rows 453 cols
[2024-06-02 19:01:22] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 19:01:22] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 19:01:22] [INFO ] Invariant cache hit.
[2024-06-02 19:01:22] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-06-02 19:01:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (OVERLAPS) 567/1019 variables, 452/456 constraints. Problems are: Problem set: 0 solved, 566 unsolved
[2024-06-02 19:01:40] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 3 ms to minimize.
[2024-06-02 19:01:40] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1019 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1019/1020 variables, and 458 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 452/453 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 567/1019 variables, 452/458 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1019 variables, 565/1023 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 566 unsolved
SMT process timed out in 60120ms, After SMT, problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 453/530 places, 567/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60456 ms. Remains : 453/530 places, 567/645 transitions.
[2024-06-02 19:02:22] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:02:22] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:02:22] [INFO ] Input system was already deterministic with 567 transitions.
[2024-06-02 19:02:22] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:02:22] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:02:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality8920617257697493939.gal : 3 ms
[2024-06-02 19:02:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality14037404006573378017.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/CTLCardinality8920617257697493939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14037404006573378017.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.73474e+08,1.29416,44696,2,5908,5,125163,6,0,2374,223033,0


Converting to forward existential form...Done !
original formula: E(E(((((p585==0)||(p575==1)) * (AG(((p139==0)||(p593==1))) + (p632!=0))) + ((p691==0)&&(p688==1))) U ((EX(EF((p704==1))) * EG(AG((p727==1...241
=> equivalent forward existential formula: [(FwdU(Init,E(((((p585==0)||(p575==1)) * (!(E(TRUE U !(((p139==0)||(p593==1))))) + (p632!=0))) + ((p691==0)&&(p6...317
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t52, t54, t57, t101, t1...463
Detected timeout of ITS tools.
[2024-06-02 19:02:52] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:02:52] [INFO ] Applying decomposition
[2024-06-02 19:02:52] [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/graph9020728903245537953.txt' '-o' '/tmp/graph9020728903245537953.bin' '-w' '/tmp/graph9020728903245537953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9020728903245537953.bin' '-l' '-1' '-v' '-w' '/tmp/graph9020728903245537953.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:02:52] [INFO ] Decomposing Gal with order
[2024-06-02 19:02:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:02:53] [INFO ] Removed a total of 169 redundant transitions.
[2024-06-02 19:02:53] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:02:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2024-06-02 19:02:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality3453340630973000642.gal : 9 ms
[2024-06-02 19:02:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality12782530587298030140.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/CTLCardinality3453340630973000642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12782530587298030140.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.73474e+08,0.273656,15572,835,85,21752,1439,949,48608,95,4683,0


Converting to forward existential form...Done !
original formula: E(E(((((i12.u97.p585==0)||(i11.u95.p575==1)) * (AG(((i0.u11.p139==0)||(i12.u98.p593==1))) + (i11.u108.p632!=0))) + ((i9.u125.p691==0)&&(i...368
=> equivalent forward existential formula: [(FwdU(Init,E(((((i12.u97.p585==0)||(i11.u95.p575==1)) * (!(E(TRUE U !(((i0.u11.p139==0)||(i12.u98.p593==1))))) ...444
Reverse transition relation is NOT exact ! Due to transitions t57, t101, t174, t280, t293, t307, t351, t398, t429, t470, t479, t506, t507, i0.u10.t462, i1....765
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,1.22797,55172,1,0,87378,2957,6547,297608,506,12559,208273
FORMULA CO4-PT-18-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 645
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 496 transition count 613
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 496 transition count 613
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 88 place count 474 transition count 591
Iterating global reduction 1 with 22 rules applied. Total rules applied 110 place count 474 transition count 591
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 122 place count 462 transition count 579
Iterating global reduction 1 with 12 rules applied. Total rules applied 134 place count 462 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 135 place count 462 transition count 578
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 455 transition count 571
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 455 transition count 571
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 451 transition count 567
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 451 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 451 transition count 566
Applied a total of 158 rules in 42 ms. Remains 451 /530 variables (removed 79) and now considering 566/645 (removed 79) transitions.
// Phase 1: matrix 566 rows 451 cols
[2024-06-02 19:02:54] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 19:02:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 19:02:54] [INFO ] Invariant cache hit.
[2024-06-02 19:02:54] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 565 sub problems to find dead transitions.
[2024-06-02 19:02:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/451 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (OVERLAPS) 566/1017 variables, 451/455 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-02 19:03:12] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:03:12] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1017 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1017/1017 variables, and 457 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 451/451 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 565 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/451 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (OVERLAPS) 566/1017 variables, 451/457 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1017 variables, 565/1022 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1017 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1017/1017 variables, and 1022 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 451/451 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 2/2 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 565 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 451/530 places, 566/645 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60492 ms. Remains : 451/530 places, 566/645 transitions.
[2024-06-02 19:03:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:03:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:03:54] [INFO ] Input system was already deterministic with 566 transitions.
[2024-06-02 19:03:54] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:03:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:03:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality15620006381031245575.gal : 2 ms
[2024-06-02 19:03:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2942881794165628507.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/CTLCardinality15620006381031245575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2942881794165628507.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.96256e+08,1.1268,41520,2,5822,5,118273,6,0,2368,204015,0


Converting to forward existential form...Done !
original formula: (EF((((p161==1) + EG(EF((p117==1)))) + ((AF(EX((p783==1))) + (p807==0)) * EX((((p392==0)||(p893==1))||(p642==1)))))) * AG(AF(((((p403==1)...223
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (((p161==1) + EG(E(TRUE U (p117==1)))) + ((!(EG(!(EX((p783==1))))) + (p807==0)) * EX((((p39...315
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t19, t20, t21, t22, t23, t28, t37, t46, t48, t49, t50, t51, t52, t54, t56, t59, t10...474
(forward)formula 0,0,16.64,472804,1,0,808,1.95581e+06,1159,523,12985,2.16193e+06,1234
FORMULA CO4-PT-18-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Graph (trivial) has 561 edges and 530 vertex of which 3 / 530 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 798 edges and 528 vertex of which 518 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 260 transitions
Trivial Post-agglo rules discarded 260 transitions
Performed 260 trivial Post agglomeration. Transition count delta: 260
Iterating post reduction 0 with 260 rules applied. Total rules applied 262 place count 517 transition count 373
Reduce places removed 260 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 261 rules applied. Total rules applied 523 place count 257 transition count 372
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 523 place count 257 transition count 338
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 591 place count 223 transition count 338
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 599 place count 215 transition count 330
Iterating global reduction 2 with 8 rules applied. Total rules applied 607 place count 215 transition count 330
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 607 place count 215 transition count 328
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 611 place count 213 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 615 place count 209 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 619 place count 209 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 620 place count 209 transition count 323
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 688 place count 175 transition count 289
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 3 with 6 rules applied. Total rules applied 694 place count 175 transition count 283
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 697 place count 173 transition count 282
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 704 place count 166 transition count 275
Iterating global reduction 5 with 7 rules applied. Total rules applied 711 place count 166 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 714 place count 166 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 715 place count 165 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 717 place count 164 transition count 271
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 718 place count 163 transition count 270
Iterating global reduction 7 with 1 rules applied. Total rules applied 719 place count 163 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 735 place count 163 transition count 254
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 7 with 10 rules applied. Total rules applied 745 place count 163 transition count 244
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 755 place count 153 transition count 244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 755 place count 153 transition count 243
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 757 place count 152 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 759 place count 151 transition count 242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 761 place count 149 transition count 240
Applied a total of 761 rules in 43 ms. Remains 149 /530 variables (removed 381) and now considering 240/645 (removed 405) transitions.
// Phase 1: matrix 240 rows 149 cols
[2024-06-02 19:04:11] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:04:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 19:04:11] [INFO ] Invariant cache hit.
[2024-06-02 19:04:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:04:11] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-06-02 19:04:11] [INFO ] Redundant transitions in 6 ms returned []
Running 227 sub problems to find dead transitions.
[2024-06-02 19:04:11] [INFO ] Invariant cache hit.
[2024-06-02 19:04:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 239/388 variables, 149/153 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (OVERLAPS) 1/389 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 154 constraints, problems are : Problem set: 0 solved, 227 unsolved in 6583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 149/149 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (OVERLAPS) 239/388 variables, 149/153 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 227/380 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (OVERLAPS) 1/389 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 381 constraints, problems are : Problem set: 0 solved, 227 unsolved in 9277 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 149/149 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 0/0 constraints]
After SMT, in 15912ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 15915ms
Starting structural reductions in SI_CTL mode, iteration 1 : 149/530 places, 240/645 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16126 ms. Remains : 149/530 places, 240/645 transitions.
[2024-06-02 19:04:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:04:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:04:27] [INFO ] Input system was already deterministic with 240 transitions.
[2024-06-02 19:04:27] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:04:27] [INFO ] Flatten gal took : 3 ms
[2024-06-02 19:04:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13713257364230605927.gal : 31 ms
[2024-06-02 19:04:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5110415749329071455.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13713257364230605927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5110415749329071455.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5110415749329071455.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 301
Invariant property CO4-PT-18-CTLCardinality-2024-14 does not hold.
FORMULA CO4-PT-18-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1120,0.049992,4732,2,289,12,3655,6,0,826,1925,0
Total reachable state count : 1120

Verifying 1 reachability properties.
Invariant property CO4-PT-18-CTLCardinality-2024-14 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-18-CTLCardinality-2024-14,1,0.050677,5092,2,150,12,3655,7,0,832,1925,0
RANDOM walk for 40000 steps (3942 resets) in 382 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (587 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 56100 steps, run visited all 1 properties in 116 ms. (steps per millisecond=483 )
Probabilistic random walk after 56100 steps, saw 12998 distinct states, run finished after 119 ms. (steps per millisecond=471 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 645/645 transitions.
Graph (trivial) has 563 edges and 530 vertex of which 3 / 530 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 798 edges and 528 vertex of which 518 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 517 transition count 371
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 263 rules applied. Total rules applied 527 place count 255 transition count 370
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 527 place count 255 transition count 336
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 595 place count 221 transition count 336
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 603 place count 213 transition count 328
Iterating global reduction 2 with 8 rules applied. Total rules applied 611 place count 213 transition count 328
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 611 place count 213 transition count 326
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 615 place count 211 transition count 326
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 619 place count 207 transition count 322
Iterating global reduction 2 with 4 rules applied. Total rules applied 623 place count 207 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 624 place count 207 transition count 321
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 692 place count 173 transition count 287
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 3 with 6 rules applied. Total rules applied 698 place count 173 transition count 281
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 701 place count 171 transition count 280
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 708 place count 164 transition count 273
Iterating global reduction 5 with 7 rules applied. Total rules applied 715 place count 164 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 718 place count 164 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 719 place count 163 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 721 place count 162 transition count 269
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 722 place count 161 transition count 268
Iterating global reduction 7 with 1 rules applied. Total rules applied 723 place count 161 transition count 268
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 724 place count 160 transition count 266
Iterating global reduction 7 with 1 rules applied. Total rules applied 725 place count 160 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 726 place count 160 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 742 place count 160 transition count 249
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 8 with 10 rules applied. Total rules applied 752 place count 160 transition count 239
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 762 place count 150 transition count 239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 762 place count 150 transition count 238
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 764 place count 149 transition count 238
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 766 place count 148 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 768 place count 146 transition count 235
Applied a total of 768 rules in 36 ms. Remains 146 /530 variables (removed 384) and now considering 235/645 (removed 410) transitions.
// Phase 1: matrix 235 rows 146 cols
[2024-06-02 19:04:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 19:04:28] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 19:04:28] [INFO ] Invariant cache hit.
[2024-06-02 19:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 19:04:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 19:04:28] [INFO ] Redundant transitions in 2 ms returned []
Running 222 sub problems to find dead transitions.
[2024-06-02 19:04:28] [INFO ] Invariant cache hit.
[2024-06-02 19:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 234/380 variables, 146/150 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/381 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/381 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 151 constraints, problems are : Problem set: 0 solved, 222 unsolved in 6287 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 146/146 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 234/380 variables, 146/150 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 222/372 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 1/381 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/381 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 373 constraints, problems are : Problem set: 0 solved, 222 unsolved in 8404 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 146/146 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 14736ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 14738ms
Starting structural reductions in SI_CTL mode, iteration 1 : 146/530 places, 235/645 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14948 ms. Remains : 146/530 places, 235/645 transitions.
[2024-06-02 19:04:43] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:04:43] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:04:43] [INFO ] Input system was already deterministic with 235 transitions.
RANDOM walk for 4189 steps (420 resets) in 15 ms. (261 steps per ms) remains 0/1 properties
FORMULA CO4-PT-18-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 19:04:43] [INFO ] Flatten gal took : 4 ms
[2024-06-02 19:04:43] [INFO ] Flatten gal took : 3 ms
[2024-06-02 19:04:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17212411082956481210.gal : 1 ms
[2024-06-02 19:04:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1504404003886887019.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17212411082956481210.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1504404003886887019.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 19:04:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:04:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:04:43] [INFO ] Applying decomposition
[2024-06-02 19:04:43] [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/graph6243547796485885280.txt' '-o' '/tmp/graph6243547796485885280.bin' '-w' '/tmp/graph6243547796485885280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6243547796485885280.bin' '-l' '-1' '-v' '-w' '/tmp/graph6243547796485885280.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:04:43] [INFO ] Decomposing Gal with order
[2024-06-02 19:04:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:04:43] [INFO ] Removed a total of 171 redundant transitions.
[2024-06-02 19:04:43] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:04:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-06-02 19:04:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality4252004965732834191.gal : 5 ms
[2024-06-02 19:04:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4605804977803478543.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/CTLCardinality4252004965732834191.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4605804977803478543.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10611e+09,0.337286,17352,781,99,24147,3620,1195,48268,100,12537,0


Converting to forward existential form...Done !
original formula: AF(AX((((i6.i0.i1.u12.p140==1) + AF((i13.u135.p651==1))) + AX(((i10.u112.p557==0)&&(i0.u205.p934==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((((i6.i0.i1.u12.p140==1) + !(EG(!((i13.u135.p651==1))))) + !(EX(!(((i10.u112.p557==0)&&(i0.u...186
Reverse transition relation is NOT exact ! Due to transitions t26, t56, t71, t125, t206, t321, t348, t436, t492, t571, t572, i0.u209.t30, i0.u209.t31, i1.i...886
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,50.0646,1164580,1,0,2.06049e+06,4635,8273,4.54794e+06,534,27444,2457699
FORMULA CO4-PT-18-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1078231 ms.

BK_STOP 1717355133499

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

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