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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 177K 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-12-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-12-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717351953159

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:12:34] [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:12:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:12:34] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 18:12:34] [INFO ] Transformed 649 places.
[2024-06-02 18:12:34] [INFO ] Transformed 782 transitions.
[2024-06-02 18:12:34] [INFO ] Found NUPN structural information;
[2024-06-02 18:12:34] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 172 places in 17 ms
Reduce places removed 172 places and 219 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-12-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 563/563 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 465 transition count 561
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 89 place count 390 transition count 484
Iterating global reduction 1 with 75 rules applied. Total rules applied 164 place count 390 transition count 484
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 218 place count 336 transition count 412
Iterating global reduction 1 with 54 rules applied. Total rules applied 272 place count 336 transition count 412
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 276 place count 336 transition count 408
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 300 place count 312 transition count 384
Iterating global reduction 2 with 24 rules applied. Total rules applied 324 place count 312 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 325 place count 312 transition count 383
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 338 place count 299 transition count 370
Iterating global reduction 3 with 13 rules applied. Total rules applied 351 place count 299 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 354 place count 299 transition count 367
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 357 place count 296 transition count 364
Iterating global reduction 4 with 3 rules applied. Total rules applied 360 place count 296 transition count 364
Applied a total of 360 rules in 108 ms. Remains 296 /477 variables (removed 181) and now considering 364/563 (removed 199) transitions.
// Phase 1: matrix 364 rows 296 cols
[2024-06-02 18:12:34] [INFO ] Computed 6 invariants in 19 ms
[2024-06-02 18:12:34] [INFO ] Implicit Places using invariants in 239 ms returned [6, 200]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 267 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 294/477 places, 364/563 transitions.
Applied a total of 0 rules in 5 ms. Remains 294 /294 variables (removed 0) and now considering 364/364 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 395 ms. Remains : 294/477 places, 364/563 transitions.
Support contains 52 out of 294 places after structural reductions.
[2024-06-02 18:12:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:12:35] [INFO ] Flatten gal took : 49 ms
[2024-06-02 18:12:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-12-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:12:35] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:12:35] [INFO ] Input system was already deterministic with 364 transitions.
Support contains 32 out of 294 places (down from 52) after GAL structural reductions.
FORMULA CO4-PT-12-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (491 resets) in 2740 ms. (14 steps per ms) remains 14/24 properties
BEST_FIRST walk for 40002 steps (260 resets) in 242 ms. (164 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40001 steps (221 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (232 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (196 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (128 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (133 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (259 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (244 resets) in 107 ms. (370 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40001 steps (273 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (197 resets) in 191 ms. (208 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (259 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (177 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
// Phase 1: matrix 364 rows 294 cols
[2024-06-02 18:12:37] [INFO ] Computed 4 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 30/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 105/148 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 12/160 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 20/180 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 202/382 variables, 102/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 178/560 variables, 87/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 74/634 variables, 45/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/634 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 20/654 variables, 12/294 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/654 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 4/658 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/658 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/658 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 298 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 30/43 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 105/148 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 12/160 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 20/180 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 202/382 variables, 102/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 178/560 variables, 87/246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 74/634 variables, 45/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/634 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 20/654 variables, 12/303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/654 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 4/658 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/658 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 307 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2088ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 5 properties in 2512 ms.
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 364/364 transitions.
Graph (trivial) has 297 edges and 294 vertex of which 3 / 294 are part of one of the 1 SCC in 11 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 481 edges and 292 vertex of which 270 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 143 rules applied. Total rules applied 145 place count 270 transition count 202
Reduce places removed 124 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 126 rules applied. Total rules applied 271 place count 146 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 273 place count 144 transition count 200
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 273 place count 144 transition count 183
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 307 place count 127 transition count 183
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 314 place count 120 transition count 176
Iterating global reduction 3 with 7 rules applied. Total rules applied 321 place count 120 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 323 place count 120 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 323 place count 120 transition count 172
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 327 place count 118 transition count 172
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 255 edges and 118 vertex of which 117 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 4 with 2 rules applied. Total rules applied 329 place count 117 transition count 171
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 331 place count 117 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 332 place count 116 transition count 169
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 334 place count 114 transition count 167
Iterating global reduction 7 with 2 rules applied. Total rules applied 336 place count 114 transition count 167
Performed 48 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 432 place count 66 transition count 101
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 437 place count 66 transition count 96
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 443 place count 60 transition count 90
Iterating global reduction 8 with 6 rules applied. Total rules applied 449 place count 60 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 450 place count 60 transition count 89
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 451 place count 59 transition count 88
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 59 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 453 place count 59 transition count 87
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 455 place count 58 transition count 86
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 456 place count 58 transition count 85
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 457 place count 57 transition count 84
Iterating global reduction 11 with 1 rules applied. Total rules applied 458 place count 57 transition count 84
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 22 rules applied. Total rules applied 480 place count 46 transition count 86
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 498 place count 46 transition count 68
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 506 place count 38 transition count 60
Iterating global reduction 12 with 8 rules applied. Total rules applied 514 place count 38 transition count 60
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 521 place count 38 transition count 53
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 522 place count 37 transition count 51
Iterating global reduction 13 with 1 rules applied. Total rules applied 523 place count 37 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 525 place count 36 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 526 place count 36 transition count 56
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 527 place count 35 transition count 55
Iterating global reduction 13 with 1 rules applied. Total rules applied 528 place count 35 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 530 place count 35 transition count 53
Free-agglomeration rule applied 7 times.
Iterating global reduction 14 with 7 rules applied. Total rules applied 537 place count 35 transition count 46
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 546 place count 28 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 547 place count 28 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 548 place count 27 transition count 43
Reduce places removed 2 places and 0 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 15 with 3 rules applied. Total rules applied 551 place count 25 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 552 place count 24 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 2 Pre rules applied. Total rules applied 552 place count 24 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 556 place count 22 transition count 40
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 17 with 4 rules applied. Total rules applied 560 place count 20 transition count 38
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 566 place count 20 transition count 32
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 18 with 2 rules applied. Total rules applied 568 place count 19 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 570 place count 19 transition count 31
Applied a total of 570 rules in 80 ms. Remains 19 /294 variables (removed 275) and now considering 31/364 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 19/294 places, 31/364 transitions.
RANDOM walk for 147 steps (0 resets) in 7 ms. (18 steps per ms) remains 0/4 properties
[2024-06-02 18:12:41] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:12:41] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:12:41] [INFO ] Input system was already deterministic with 364 transitions.
Computed a total of 24 stabilizing places and 30 stable transitions
Graph (complete) has 484 edges and 294 vertex of which 281 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 290 transition count 362
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 30 place count 266 transition count 338
Iterating global reduction 1 with 24 rules applied. Total rules applied 54 place count 266 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 266 transition count 335
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 72 place count 251 transition count 320
Iterating global reduction 2 with 15 rules applied. Total rules applied 87 place count 251 transition count 320
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 95 place count 243 transition count 312
Iterating global reduction 2 with 8 rules applied. Total rules applied 103 place count 243 transition count 312
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 243 transition count 310
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 240 transition count 307
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 240 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 240 transition count 306
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 239 transition count 305
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 239 transition count 305
Applied a total of 114 rules in 29 ms. Remains 239 /294 variables (removed 55) and now considering 305/364 (removed 59) transitions.
// Phase 1: matrix 305 rows 239 cols
[2024-06-02 18:12:41] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:12:41] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 18:12:41] [INFO ] Invariant cache hit.
[2024-06-02 18:12:42] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-06-02 18:12:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:12:44] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 5 ms to minimize.
[2024-06-02 18:12:44] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/544 variables, 239/245 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 0/544 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 245 constraints, problems are : Problem set: 0 solved, 304 unsolved in 12259 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/544 variables, 239/245 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 304/549 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 18:12:59] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 0/544 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 550 constraints, problems are : Problem set: 0 solved, 304 unsolved in 22711 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 3/3 constraints]
After SMT, in 35049ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 35055ms
Starting structural reductions in LTL mode, iteration 1 : 239/294 places, 305/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35491 ms. Remains : 239/294 places, 305/364 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 305 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:13:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality4125483898397395974.gal : 21 ms
[2024-06-02 18:13:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality5038852168543285023.ctl : 4 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/CTLCardinality4125483898397395974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5038852168543285023.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,2.47291e+07,0.186711,10024,2,2781,5,24639,6,0,1256,29372,0


Converting to forward existential form...Done !
original formula: A((p483==0) U ((p516==1) * EX(TRUE)))
=> equivalent forward existential formula: [((Init * !(EG(!(((p516==1) * EX(TRUE)))))) * !(E(!(((p516==1) * EX(TRUE))) U (!((p483==0)) * !(((p516==1) * EX(...176
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55,...396
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:13:47] [INFO ] Flatten gal took : 22 ms
[2024-06-02 18:13:47] [INFO ] Applying decomposition
[2024-06-02 18:13:47] [INFO ] Flatten gal took : 22 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/graph12186098367220826920.txt' '-o' '/tmp/graph12186098367220826920.bin' '-w' '/tmp/graph12186098367220826920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12186098367220826920.bin' '-l' '-1' '-v' '-w' '/tmp/graph12186098367220826920.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:13:47] [INFO ] Decomposing Gal with order
[2024-06-02 18:13:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:13:47] [INFO ] Removed a total of 107 redundant transitions.
[2024-06-02 18:13:47] [INFO ] Flatten gal took : 77 ms
[2024-06-02 18:13:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 27 ms.
[2024-06-02 18:13:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality6769647183196344176.gal : 6 ms
[2024-06-02 18:13:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality17652183986097408074.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/CTLCardinality6769647183196344176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17652183986097408074.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,2.47291e+07,0.127137,6944,357,63,5563,603,686,8391,82,2115,0


Converting to forward existential form...Done !
original formula: A((i12.i0.u75.p483==0) U ((i12.i1.u81.p516==1) * EX(TRUE)))
=> equivalent forward existential formula: [((Init * !(EG(!(((i12.i1.u81.p516==1) * EX(TRUE)))))) * !(E(!(((i12.i1.u81.p516==1) * EX(TRUE))) U (!((i12.i0.u...220
Reverse transition relation is NOT exact ! Due to transitions t0, t19, t43, t86, t130, t219, t256, t259, t278, t281, i3.t207, i3.t187, i3.i0.u21.t209, i3.i...714
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
Using saturation style SCC detection
Using 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
(forward)formula 0,0,7.96496,213920,1,0,277046,997,3546,1.39091e+06,356,4792,210486
FORMULA CO4-PT-12-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 290 transition count 362
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 30 place count 266 transition count 338
Iterating global reduction 1 with 24 rules applied. Total rules applied 54 place count 266 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 266 transition count 335
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 73 place count 250 transition count 319
Iterating global reduction 2 with 16 rules applied. Total rules applied 89 place count 250 transition count 319
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 242 transition count 311
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 242 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 242 transition count 309
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 239 transition count 306
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 239 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 239 transition count 305
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 238 transition count 304
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 238 transition count 304
Applied a total of 116 rules in 23 ms. Remains 238 /294 variables (removed 56) and now considering 304/364 (removed 60) transitions.
// Phase 1: matrix 304 rows 238 cols
[2024-06-02 18:13:55] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:13:56] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 18:13:56] [INFO ] Invariant cache hit.
[2024-06-02 18:13:56] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2024-06-02 18:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 18:13:58] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:13:58] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 304/542 variables, 238/244 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (OVERLAPS) 0/542 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/542 variables, and 244 constraints, problems are : Problem set: 0 solved, 303 unsolved in 11745 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 304/542 variables, 238/244 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 303/547 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 303 unsolved
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/542 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 9 (OVERLAPS) 0/542 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Int declared 542/542 variables, and 548 constraints, problems are : Problem set: 0 solved, 303 unsolved in 29292 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 3/3 constraints]
After SMT, in 41104ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 41108ms
Starting structural reductions in LTL mode, iteration 1 : 238/294 places, 304/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41373 ms. Remains : 238/294 places, 304/364 transitions.
[2024-06-02 18:14:37] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:14:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:14:37] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 18:14:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:14:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:14:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality15435690572532039753.gal : 2 ms
[2024-06-02 18:14:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality3585972220642794575.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/CTLCardinality15435690572532039753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3585972220642794575.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,2.35192e+07,0.196429,11432,2,3559,5,30620,6,0,1252,36529,0


Converting to forward existential form...Done !
original formula: AF(EX(AX(((p429==0)&&(p380==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!(((p429==0)&&(p380==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55, t63...367
(forward)formula 0,0,15.9616,475276,1,0,786,1.68594e+06,631,507,7026,3.51205e+06,894
FORMULA CO4-PT-12-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Graph (trivial) has 303 edges and 294 vertex of which 3 / 294 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 482 edges and 292 vertex of which 279 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 278 transition count 227
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 248 place count 156 transition count 227
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 248 place count 156 transition count 209
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 284 place count 138 transition count 209
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 291 place count 131 transition count 202
Iterating global reduction 2 with 7 rules applied. Total rules applied 298 place count 131 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 131 transition count 201
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 299 place count 131 transition count 198
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 305 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 308 place count 125 transition count 195
Iterating global reduction 3 with 3 rules applied. Total rules applied 311 place count 125 transition count 195
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 357 place count 102 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 7 rules applied. Total rules applied 364 place count 102 transition count 164
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 367 place count 100 transition count 163
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 371 place count 96 transition count 159
Iterating global reduction 5 with 4 rules applied. Total rules applied 375 place count 96 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 389 place count 96 transition count 145
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 5 with 7 rules applied. Total rules applied 396 place count 96 transition count 138
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 403 place count 89 transition count 138
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 403 place count 89 transition count 137
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 405 place count 88 transition count 137
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 407 place count 87 transition count 136
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 408 place count 87 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 409 place count 87 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 411 place count 85 transition count 133
Applied a total of 411 rules in 91 ms. Remains 85 /294 variables (removed 209) and now considering 133/364 (removed 231) transitions.
// Phase 1: matrix 133 rows 85 cols
[2024-06-02 18:14:53] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:14:53] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 18:14:53] [INFO ] Invariant cache hit.
[2024-06-02 18:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:14:53] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-06-02 18:14:53] [INFO ] Redundant transitions in 5 ms returned []
Running 118 sub problems to find dead transitions.
[2024-06-02 18:14:53] [INFO ] Invariant cache hit.
[2024-06-02 18:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 132/217 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 1/218 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 0/218 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 90 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2121 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 132/217 variables, 85/89 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 118/207 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 1/218 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 208 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2445 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 4624ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 4625ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/294 places, 133/364 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4869 ms. Remains : 85/294 places, 133/364 transitions.
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:58] [INFO ] Input system was already deterministic with 133 transitions.
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:14:58] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:14:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality18323843106448511423.gal : 1 ms
[2024-06-02 18:14:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality13352400241281364169.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/CTLCardinality18323843106448511423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13352400241281364169.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,143809,0.038362,4124,2,305,5,2606,6,0,463,2202,0


Converting to forward existential form...Done !
original formula: EF((EG((p461==0)) * (p287==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p287==1)),(p461==0))] != FALSE
Hit Full ! (commute/partial/dont) 131/0/2
(forward)formula 0,1,0.16293,6820,1,0,10,16749,20,5,2211,7469,9
FORMULA CO4-PT-12-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 290 transition count 362
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 28 place count 268 transition count 340
Iterating global reduction 1 with 22 rules applied. Total rules applied 50 place count 268 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 268 transition count 337
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 254 transition count 323
Iterating global reduction 2 with 14 rules applied. Total rules applied 81 place count 254 transition count 323
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 247 transition count 316
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 247 transition count 316
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 245 transition count 314
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 245 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 245 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 244 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 244 transition count 312
Applied a total of 102 rules in 13 ms. Remains 244 /294 variables (removed 50) and now considering 312/364 (removed 52) transitions.
// Phase 1: matrix 312 rows 244 cols
[2024-06-02 18:14:58] [INFO ] Computed 4 invariants in 17 ms
[2024-06-02 18:14:59] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-06-02 18:14:59] [INFO ] Invariant cache hit.
[2024-06-02 18:14:59] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2024-06-02 18:14:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 18:15:01] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 6 ms to minimize.
[2024-06-02 18:15:01] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:15:02] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/556 variables, 244/251 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 0/556 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 251 constraints, problems are : Problem set: 0 solved, 311 unsolved in 12387 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/244 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/556 variables, 244/251 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 311/562 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-02 18:15:16] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 563 constraints, problems are : Problem set: 0 solved, 311 unsolved in 24575 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 4/4 constraints]
After SMT, in 37058ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 37074ms
Starting structural reductions in LTL mode, iteration 1 : 244/294 places, 312/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37715 ms. Remains : 244/294 places, 312/364 transitions.
[2024-06-02 18:15:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:15:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:15:36] [INFO ] Input system was already deterministic with 312 transitions.
[2024-06-02 18:15:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:15:36] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:15:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality17859697254606899510.gal : 1 ms
[2024-06-02 18:15:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5030642111363782951.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17859697254606899510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5030642111363782951.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,2.73328e+07,0.234654,12008,2,3736,5,31846,6,0,1284,39980,0


Converting to forward existential form...Done !
original formula: E((AX(AX((p375==0))) * ((A((p563==1) U ((p434==0)||(p527==1))) + !(((p223==0)||(p464==1)))) + (p121==1))) U EX(EG((p294==1))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,(!(EX(!(!(EX(!((p375==0))))))) * ((!((E(!(((p434==0)||(p527==1))) U (!((p563==1)) * !(((p434=...273
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t51,...405
Detected timeout of ITS tools.
[2024-06-02 18:16:06] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:16:06] [INFO ] Applying decomposition
[2024-06-02 18:16:06] [INFO ] Flatten gal took : 7 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/graph14482660018359686549.txt' '-o' '/tmp/graph14482660018359686549.bin' '-w' '/tmp/graph14482660018359686549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14482660018359686549.bin' '-l' '-1' '-v' '-w' '/tmp/graph14482660018359686549.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:16:06] [INFO ] Decomposing Gal with order
[2024-06-02 18:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:16:06] [INFO ] Removed a total of 99 redundant transitions.
[2024-06-02 18:16:06] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2024-06-02 18:16:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4644409390370651080.gal : 12 ms
[2024-06-02 18:16:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality18159203084475010544.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/CTLCardinality4644409390370651080.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18159203084475010544.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,2.73328e+07,0.10342,7264,377,81,6027,640,704,9826,86,2457,0


Converting to forward existential form...Done !
original formula: E((AX(AX((i9.i1.u51.p375==0))) * ((A((i16.u82.p563==1) U ((i13.u65.p434==0)||(i14.i0.u76.p527==1))) + !(((i3.i1.u24.p223==0)||(i14.i0.u69...221
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,(!(EX(!(!(EX(!((i9.i1.u51.p375==0))))))) * ((!((E(!(((i13.u65.p434==0)||(i14.i0.u76.p527==1))...388
Reverse transition relation is NOT exact ! Due to transitions t0, t19, t43, t78, t91, t147, t213, t225, t264, t267, t285, t288, i0.t11, i0.i1.u67.t89, i0.i...696
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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
(forward)formula 0,1,5.88701,210544,1,0,380172,1112,4815,830494,418,4704,411609
FORMULA CO4-PT-12-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Graph (trivial) has 295 edges and 294 vertex of which 3 / 294 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 482 edges and 292 vertex of which 280 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 280 transition count 231
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 160 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 245 place count 159 transition count 230
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 245 place count 159 transition count 212
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 281 place count 141 transition count 212
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 286 place count 136 transition count 207
Iterating global reduction 3 with 5 rules applied. Total rules applied 291 place count 136 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 292 place count 136 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 292 place count 136 transition count 204
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 296 place count 134 transition count 204
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 298 place count 132 transition count 202
Iterating global reduction 4 with 2 rules applied. Total rules applied 300 place count 132 transition count 202
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 350 place count 107 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 359 place count 107 transition count 168
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 364 place count 104 transition count 166
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 368 place count 100 transition count 162
Iterating global reduction 6 with 4 rules applied. Total rules applied 372 place count 100 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 383 place count 100 transition count 151
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 387 place count 100 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 391 place count 96 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 391 place count 96 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 395 place count 94 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 397 place count 93 transition count 144
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 399 place count 93 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 400 place count 93 transition count 143
Applied a total of 400 rules in 43 ms. Remains 93 /294 variables (removed 201) and now considering 143/364 (removed 221) transitions.
// Phase 1: matrix 143 rows 93 cols
[2024-06-02 18:16:12] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:16:12] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:16:12] [INFO ] Invariant cache hit.
[2024-06-02 18:16:12] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 18:16:12] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-06-02 18:16:12] [INFO ] Redundant transitions in 3 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-02 18:16:12] [INFO ] Invariant cache hit.
[2024-06-02 18:16:12] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 142/234 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 27/123 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 1/235 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/236 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 125 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4402 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 142/234 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 27/123 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 135/258 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 7/266 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 1/236 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 0/236 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 267 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4999 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 9426ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 9427ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/294 places, 143/364 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9613 ms. Remains : 93/294 places, 143/364 transitions.
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:16:22] [INFO ] Input system was already deterministic with 143 transitions.
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:16:22] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:16:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality16955795779033410355.gal : 19 ms
[2024-06-02 18:16:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12917015915865302480.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/CTLCardinality16955795779033410355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12917015915865302480.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,279530,0.043,4500,2,376,5,3260,6,0,503,3301,0


Converting to forward existential form...Done !
original formula: E((EG((p538==0)) * ((p227==0)||(p577==1))) U ((EG(AF(((p486==0)||(p293==1)))) * EF(EG((p433==0)))) * !(((p535==0)||(p0==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(((FwdU(Init,(EG((p538==0)) * ((p227==0)||(p577==1)))) * !(((p535==0)||(p0==1)))) * EG(!(EG(!(((p486==...201
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t12, t16, t28, t42, t47, t56, t58, t71, Intersection with reachable at each step...214
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 139/0/4
(forward)formula 0,1,2.55174,94844,1,0,1291,508690,335,686,3404,667463,1573
FORMULA CO4-PT-12-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 291 transition count 362
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 29 place count 267 transition count 338
Iterating global reduction 1 with 24 rules applied. Total rules applied 53 place count 267 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 267 transition count 335
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 72 place count 251 transition count 319
Iterating global reduction 2 with 16 rules applied. Total rules applied 88 place count 251 transition count 319
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 97 place count 242 transition count 310
Iterating global reduction 2 with 9 rules applied. Total rules applied 106 place count 242 transition count 310
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 242 transition count 308
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 239 transition count 305
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 239 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 239 transition count 304
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 238 transition count 303
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 238 transition count 303
Applied a total of 117 rules in 12 ms. Remains 238 /294 variables (removed 56) and now considering 303/364 (removed 61) transitions.
// Phase 1: matrix 303 rows 238 cols
[2024-06-02 18:16:24] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:16:24] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:16:24] [INFO ] Invariant cache hit.
[2024-06-02 18:16:24] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-06-02 18:16:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 18:16:27] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-02 18:16:27] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 303/540 variables, 237/243 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/541 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (OVERLAPS) 0/541 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 244 constraints, problems are : Problem set: 0 solved, 302 unsolved in 14238 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 303/540 variables, 237/243 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 301/544 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 18:16:43] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:16:45] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (OVERLAPS) 1/541 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 548 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 4/4 constraints]
After SMT, in 44298ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 44302ms
Starting structural reductions in LTL mode, iteration 1 : 238/294 places, 303/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44507 ms. Remains : 238/294 places, 303/364 transitions.
[2024-06-02 18:17:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:17:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:09] [INFO ] Input system was already deterministic with 303 transitions.
[2024-06-02 18:17:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality8467344980760409832.gal : 2 ms
[2024-06-02 18:17:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality2208585359828828073.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/CTLCardinality8467344980760409832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2208585359828828073.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,2.43239e+07,0.187319,10108,2,2804,5,24495,6,0,1248,29305,0


Converting to forward existential form...Done !
original formula: AF(AX((p482==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((p482==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t16, t19, t24, t32, t41, t43, t44, t45, t46, t47, t49, t55,...385
(forward)formula 0,0,11.8092,363904,1,0,783,1.33924e+06,629,505,7009,2.6296e+06,888
FORMULA CO4-PT-12-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Graph (trivial) has 305 edges and 294 vertex of which 3 / 294 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 482 edges and 292 vertex of which 279 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 278 transition count 227
Reduce places removed 122 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 123 rules applied. Total rules applied 249 place count 156 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 250 place count 155 transition count 226
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 250 place count 155 transition count 208
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 286 place count 137 transition count 208
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 293 place count 130 transition count 201
Iterating global reduction 3 with 7 rules applied. Total rules applied 300 place count 130 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 130 transition count 200
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 301 place count 130 transition count 197
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 307 place count 127 transition count 197
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 310 place count 124 transition count 194
Iterating global reduction 4 with 3 rules applied. Total rules applied 313 place count 124 transition count 194
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 359 place count 101 transition count 170
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 9 rules applied. Total rules applied 368 place count 101 transition count 161
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 373 place count 98 transition count 159
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 377 place count 94 transition count 155
Iterating global reduction 6 with 4 rules applied. Total rules applied 381 place count 94 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 6 with 14 rules applied. Total rules applied 395 place count 94 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 7 rules applied. Total rules applied 402 place count 94 transition count 134
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 409 place count 87 transition count 134
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 409 place count 87 transition count 132
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 413 place count 85 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 415 place count 84 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 417 place count 82 transition count 129
Applied a total of 417 rules in 57 ms. Remains 82 /294 variables (removed 212) and now considering 129/364 (removed 235) transitions.
// Phase 1: matrix 129 rows 82 cols
[2024-06-02 18:17:21] [INFO ] Computed 4 invariants in 8 ms
[2024-06-02 18:17:21] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-02 18:17:21] [INFO ] Invariant cache hit.
[2024-06-02 18:17:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:17:21] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 18:17:21] [INFO ] Redundant transitions in 3 ms returned []
Running 114 sub problems to find dead transitions.
[2024-06-02 18:17:21] [INFO ] Invariant cache hit.
[2024-06-02 18:17:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 1/211 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/211 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 87 constraints, problems are : Problem set: 0 solved, 114 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 114/200 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 1/211 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 201 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2282 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 4278ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 4279ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/294 places, 129/364 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4664 ms. Remains : 82/294 places, 129/364 transitions.
[2024-06-02 18:17:25] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:17:25] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:17:25] [INFO ] Input system was already deterministic with 129 transitions.
[2024-06-02 18:17:25] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:17:25] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:17:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality10284665745010871723.gal : 1 ms
[2024-06-02 18:17:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality12282016720810702889.ctl : 9 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/CTLCardinality10284665745010871723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12282016720810702889.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,107521,0.022557,4120,2,297,5,2479,6,0,447,2080,0


Converting to forward existential form...Done !
original formula: EF(AG((p424==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p424==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t22, t35, t40, t62, t121, t123, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,0.172819,9720,1,0,175,32612,279,92,2655,25424,267
FORMULA CO4-PT-12-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Graph (trivial) has 305 edges and 294 vertex of which 3 / 294 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 482 edges and 292 vertex of which 279 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 278 transition count 225
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 252 place count 154 transition count 225
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 252 place count 154 transition count 207
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 288 place count 136 transition count 207
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 295 place count 129 transition count 200
Iterating global reduction 2 with 7 rules applied. Total rules applied 302 place count 129 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 129 transition count 199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 303 place count 129 transition count 196
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 309 place count 126 transition count 196
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 312 place count 123 transition count 193
Iterating global reduction 3 with 3 rules applied. Total rules applied 315 place count 123 transition count 193
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 361 place count 100 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 7 rules applied. Total rules applied 368 place count 100 transition count 162
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 371 place count 98 transition count 161
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 375 place count 94 transition count 157
Iterating global reduction 5 with 4 rules applied. Total rules applied 379 place count 94 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 393 place count 94 transition count 143
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 5 with 7 rules applied. Total rules applied 400 place count 94 transition count 136
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 407 place count 87 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 407 place count 87 transition count 135
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 409 place count 86 transition count 135
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 411 place count 85 transition count 134
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 412 place count 85 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 413 place count 85 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 415 place count 83 transition count 131
Applied a total of 415 rules in 36 ms. Remains 83 /294 variables (removed 211) and now considering 131/364 (removed 233) transitions.
// Phase 1: matrix 131 rows 83 cols
[2024-06-02 18:17:26] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:17:26] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 18:17:26] [INFO ] Invariant cache hit.
[2024-06-02 18:17:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:17:26] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-02 18:17:26] [INFO ] Redundant transitions in 3 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-02 18:17:26] [INFO ] Invariant cache hit.
[2024-06-02 18:17:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 1/214 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/214 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 88 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 116/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 1/214 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 204 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2228 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 4292ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 4293ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/294 places, 131/364 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4523 ms. Remains : 83/294 places, 131/364 transitions.
[2024-06-02 18:17:30] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:17:30] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:17:30] [INFO ] Input system was already deterministic with 131 transitions.
[2024-06-02 18:17:30] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:17:30] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:17:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6709177323256883266.gal : 0 ms
RANDOM walk for 1326 steps (154 resets) in 9 ms. (132 steps per ms) remains 0/1 properties
FORMULA CO4-PT-12-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 18:17:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12339665703565247970.prop : 14 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/ReachabilityCardinality6709177323256883266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12339665703565247970.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Graph (trivial) has 302 edges and 294 vertex of which 3 / 294 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 482 edges and 292 vertex of which 279 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 278 transition count 227
Reduce places removed 122 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 123 rules applied. Total rules applied 249 place count 156 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 250 place count 155 transition count 226
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 250 place count 155 transition count 208
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 286 place count 137 transition count 208
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 292 place count 131 transition count 202
Iterating global reduction 3 with 6 rules applied. Total rules applied 298 place count 131 transition count 202
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 298 place count 131 transition count 199
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 304 place count 128 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 307 place count 125 transition count 196
Iterating global reduction 3 with 3 rules applied. Total rules applied 310 place count 125 transition count 196
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 354 place count 103 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 363 place count 103 transition count 164
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 368 place count 100 transition count 162
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 372 place count 96 transition count 158
Iterating global reduction 5 with 4 rules applied. Total rules applied 376 place count 96 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 390 place count 96 transition count 144
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 5 with 7 rules applied. Total rules applied 397 place count 96 transition count 137
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 404 place count 89 transition count 137
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 404 place count 89 transition count 135
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 408 place count 87 transition count 135
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 410 place count 86 transition count 134
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 412 place count 86 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 414 place count 84 transition count 132
Applied a total of 414 rules in 41 ms. Remains 84 /294 variables (removed 210) and now considering 132/364 (removed 232) transitions.
// Phase 1: matrix 132 rows 84 cols
[2024-06-02 18:17:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:17:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:17:30] [INFO ] Invariant cache hit.
[2024-06-02 18:17:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:17:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-06-02 18:17:30] [INFO ] Redundant transitions in 1 ms returned []
Running 117 sub problems to find dead transitions.
[2024-06-02 18:17:30] [INFO ] Invariant cache hit.
[2024-06-02 18:17:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 131/215 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 1/216 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 89 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 131/215 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 117/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 1/216 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 206 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2459 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints]
After SMT, in 4504ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 4509ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/294 places, 132/364 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4778 ms. Remains : 84/294 places, 132/364 transitions.
[2024-06-02 18:17:35] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:17:35] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:17:35] [INFO ] Input system was already deterministic with 132 transitions.
[2024-06-02 18:17:35] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:17:35] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:17:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality2423736987044711546.gal : 4 ms
[2024-06-02 18:17:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2124064977254080060.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/CTLCardinality2423736987044711546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2124064977254080060.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,120385,0.023833,4132,2,318,5,2710,6,0,458,2186,0


Converting to forward existential form...Done !
original formula: EG((((p124==0)||(p148==1)) + AG(((p510==0)||(p142==1)))))
=> equivalent forward existential formula: [FwdG(Init,(((p124==0)||(p148==1)) + !(E(TRUE U !(((p510==0)||(p142==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t10, t21, t33, t37, t61, t121, t124, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,0.32906,15804,1,0,220,60539,292,142,2800,72772,324
FORMULA CO4-PT-12-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 364/364 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 291 transition count 362
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 25 place count 271 transition count 342
Iterating global reduction 1 with 20 rules applied. Total rules applied 45 place count 271 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 271 transition count 339
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 60 place count 259 transition count 327
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 259 transition count 327
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 79 place count 252 transition count 320
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 252 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 252 transition count 318
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 250 transition count 316
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 250 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 250 transition count 315
Applied a total of 93 rules in 11 ms. Remains 250 /294 variables (removed 44) and now considering 315/364 (removed 49) transitions.
// Phase 1: matrix 315 rows 250 cols
[2024-06-02 18:17:35] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:17:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 18:17:35] [INFO ] Invariant cache hit.
[2024-06-02 18:17:36] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-06-02 18:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/249 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-02 18:17:38] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:17:38] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/564 variables, 249/255 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 1/565 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 0/565 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 256 constraints, problems are : Problem set: 0 solved, 314 unsolved in 15040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/248 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/249 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 315/564 variables, 249/255 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 313/568 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-02 18:17:55] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 1/565 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 571 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 3/3 constraints]
After SMT, in 45096ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 45099ms
Starting structural reductions in LTL mode, iteration 1 : 250/294 places, 315/364 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45483 ms. Remains : 250/294 places, 315/364 transitions.
[2024-06-02 18:18:21] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:18:21] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:18:21] [INFO ] Input system was already deterministic with 315 transitions.
[2024-06-02 18:18:21] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:21] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1155800467819332522.gal : 2 ms
[2024-06-02 18:18:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality16983816398462684415.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/CTLCardinality1155800467819332522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16983816398462684415.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,2.61805e+07,0.18097,10440,2,2924,5,26027,6,0,1308,31935,0


Converting to forward existential form...Done !
original formula: A(!((E((p328!=1) U (EX((p394==1)) + AG((p482==0)))) * !(EX(((p227==0)||(p203==1)))))) U AX(FALSE))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!(!((E((p328!=1) U (EX((p394==1)) + !(E(TRUE U ...241
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t12, t13, t14, t15, t16, t17, t18, t21, t26, t34, t43, t45, t46, t47, t48, t49, t51, ...395
Detected timeout of ITS tools.
[2024-06-02 18:18:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:18:51] [INFO ] Applying decomposition
[2024-06-02 18:18:51] [INFO ] Flatten gal took : 5 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/graph5736098102921837812.txt' '-o' '/tmp/graph5736098102921837812.bin' '-w' '/tmp/graph5736098102921837812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5736098102921837812.bin' '-l' '-1' '-v' '-w' '/tmp/graph5736098102921837812.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:18:51] [INFO ] Decomposing Gal with order
[2024-06-02 18:18:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:18:51] [INFO ] Removed a total of 93 redundant transitions.
[2024-06-02 18:18:51] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:18:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2024-06-02 18:18:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality8107998283019144583.gal : 17 ms
[2024-06-02 18:18:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3630783820590531533.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/CTLCardinality8107998283019144583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3630783820590531533.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.61805e+07,0.146446,7352,360,71,6103,800,758,10158,84,3074,0


Converting to forward existential form...Done !
original formula: A(!((E((i10.i0.u51.p328!=1) U (EX((i6.i1.u64.p394==1)) + AG((i11.i1.u78.p482==0)))) * !(EX(((i2.i0.u30.p227==0)||(i9.i1.u21.p203==1))))))...168
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(FALSE))))))) * !(E(!(!(EX(!(FALSE)))) U (!(!((E((i10.i0.u51.p328!=1) U (EX((i6.i1.u64.p3...293
Reverse transition relation is NOT exact ! Due to transitions t21, t45, t87, t192, t216, t255, t262, t265, t285, t288, i1.i2.t226, i1.i2.u34.t190, i1.i2.u3...729
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,6.19655,195056,1,0,305506,1941,4807,837518,424,8017,286707
FORMULA CO4-PT-12-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-06-02 18:18:57] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:18:57] [INFO ] Flatten gal took : 8 ms
Total runtime 383604 ms.

BK_STOP 1717352337946

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

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