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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K 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 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 174K 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-14-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-14-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717352173181

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:16:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:16:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:16:14] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-02 18:16:14] [INFO ] Transformed 680 places.
[2024-06-02 18:16:14] [INFO ] Transformed 812 transitions.
[2024-06-02 18:16:14] [INFO ] Found NUPN structural information;
[2024-06-02 18:16:14] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 571 transition count 692
Discarding 108 places :
Symmetric choice reduction at 1 with 108 rule applications. Total rules 117 place count 463 transition count 583
Iterating global reduction 1 with 108 rules applied. Total rules applied 225 place count 463 transition count 583
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 229 place count 463 transition count 579
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 284 place count 408 transition count 524
Iterating global reduction 2 with 55 rules applied. Total rules applied 339 place count 408 transition count 524
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 346 place count 401 transition count 515
Iterating global reduction 2 with 7 rules applied. Total rules applied 353 place count 401 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 354 place count 401 transition count 514
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 355 place count 400 transition count 513
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 400 transition count 513
Applied a total of 356 rules in 130 ms. Remains 400 /580 variables (removed 180) and now considering 513/692 (removed 179) transitions.
// Phase 1: matrix 513 rows 400 cols
[2024-06-02 18:16:14] [INFO ] Computed 5 invariants in 23 ms
[2024-06-02 18:16:15] [INFO ] Implicit Places using invariants in 269 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 297 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 399/580 places, 513/692 transitions.
Applied a total of 0 rules in 9 ms. Remains 399 /399 variables (removed 0) and now considering 513/513 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 454 ms. Remains : 399/580 places, 513/692 transitions.
Support contains 64 out of 399 places after structural reductions.
[2024-06-02 18:16:15] [INFO ] Flatten gal took : 55 ms
[2024-06-02 18:16:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-14-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:16:15] [INFO ] Flatten gal took : 29 ms
[2024-06-02 18:16:15] [INFO ] Input system was already deterministic with 513 transitions.
Support contains 55 out of 399 places (down from 64) after GAL structural reductions.
RANDOM walk for 40000 steps (185 resets) in 1116 ms. (35 steps per ms) remains 22/35 properties
BEST_FIRST walk for 4001 steps (23 resets) in 47 ms. (83 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4003 steps (21 resets) in 120 ms. (33 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (17 resets) in 58 ms. (67 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (21 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (28 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (26 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (25 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (24 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (25 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (22 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (23 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (26 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (18 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
// Phase 1: matrix 513 rows 399 cols
[2024-06-02 18:16:16] [INFO ] Computed 4 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 101/160 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 239/399 variables, 62/125 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 347/746 variables, 169/294 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/746 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 148/894 variables, 97/391 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/894 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 14/908 variables, 10/401 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/908 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 15 (OVERLAPS) 4/912 variables, 2/403 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/912 variables, 0/403 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/912 variables, 0/403 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 403 constraints, problems are : Problem set: 1 solved, 19 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 8/38 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 19/57 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 97/154 variables, 57/61 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 232/386 variables, 59/122 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 17/139 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 353/739 variables, 169/308 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/739 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 155/894 variables, 102/410 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 14/908 variables, 10/420 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/908 variables, 0/420 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 17 (OVERLAPS) 4/912 variables, 2/422 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/912 variables, 0/422 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/912 variables, 0/422 constraints. Problems are: Problem set: 2 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 422 constraints, problems are : Problem set: 2 solved, 18 unsolved in 2297 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 4037ms problems are : Problem set: 2 solved, 18 unsolved
Parikh walk visited 16 properties in 2805 ms.
Support contains 4 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 513/513 transitions.
Graph (trivial) has 423 edges and 399 vertex of which 2 / 399 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 659 edges and 398 vertex of which 375 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.4 ms
Discarding 23 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 161 rules applied. Total rules applied 163 place count 375 transition count 331
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 148 rules applied. Total rules applied 311 place count 229 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 312 place count 228 transition count 329
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 312 place count 228 transition count 298
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 374 place count 197 transition count 298
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 385 place count 186 transition count 286
Iterating global reduction 3 with 11 rules applied. Total rules applied 396 place count 186 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 398 place count 186 transition count 284
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 398 place count 186 transition count 279
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 408 place count 181 transition count 279
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 411 place count 178 transition count 276
Iterating global reduction 4 with 3 rules applied. Total rules applied 414 place count 178 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 416 place count 178 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 417 place count 177 transition count 274
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 418 place count 176 transition count 273
Iterating global reduction 6 with 1 rules applied. Total rules applied 419 place count 176 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 420 place count 176 transition count 272
Performed 65 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 7 with 130 rules applied. Total rules applied 550 place count 111 transition count 195
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 558 place count 111 transition count 187
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 563 place count 106 transition count 182
Iterating global reduction 8 with 5 rules applied. Total rules applied 568 place count 106 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 569 place count 106 transition count 181
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 575 place count 103 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 576 place count 103 transition count 177
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 10 with 62 rules applied. Total rules applied 638 place count 72 transition count 179
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 657 place count 72 transition count 160
Discarding 27 places :
Symmetric choice reduction at 11 with 27 rule applications. Total rules 684 place count 45 transition count 106
Iterating global reduction 11 with 27 rules applied. Total rules applied 711 place count 45 transition count 106
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 11 with 17 rules applied. Total rules applied 728 place count 45 transition count 89
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 735 place count 38 transition count 69
Iterating global reduction 12 with 7 rules applied. Total rules applied 742 place count 38 transition count 69
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 747 place count 38 transition count 64
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 748 place count 38 transition count 63
Free-agglomeration rule applied 5 times.
Iterating global reduction 13 with 5 rules applied. Total rules applied 753 place count 38 transition count 58
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 760 place count 33 transition count 56
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 763 place count 33 transition count 56
Graph (complete) has 103 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 764 place count 32 transition count 56
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 765 place count 32 transition count 55
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 766 place count 32 transition count 55
Graph (complete) has 100 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 767 place count 31 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 768 place count 31 transition count 54
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 769 place count 31 transition count 54
Graph (complete) has 97 edges and 31 vertex of which 30 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 18 with 1 rules applied. Total rules applied 770 place count 30 transition count 54
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 771 place count 30 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 772 place count 29 transition count 52
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t56.t451 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 20 edges and 25 vertex of which 3 / 25 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 20 with 3 rules applied. Total rules applied 775 place count 23 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 21 with 5 rules applied. Total rules applied 780 place count 23 transition count 45
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 781 place count 22 transition count 43
Iterating global reduction 22 with 1 rules applied. Total rules applied 782 place count 22 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 783 place count 22 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 23 with 8 rules applied. Total rules applied 791 place count 22 transition count 34
Discarding 4 places :
Symmetric choice reduction at 23 with 4 rule applications. Total rules 795 place count 18 transition count 30
Iterating global reduction 23 with 4 rules applied. Total rules applied 799 place count 18 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 803 place count 18 transition count 26
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 805 place count 16 transition count 24
Iterating global reduction 24 with 2 rules applied. Total rules applied 807 place count 16 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 809 place count 16 transition count 22
Free-agglomeration rule applied 3 times.
Iterating global reduction 25 with 3 rules applied. Total rules applied 812 place count 16 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 25 with 3 rules applied. Total rules applied 815 place count 13 transition count 19
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 817 place count 13 transition count 19
Applied a total of 817 rules in 144 ms. Remains 13 /399 variables (removed 386) and now considering 19/513 (removed 494) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 13/399 places, 19/513 transitions.
RANDOM walk for 50 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/2 properties
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-14-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:16:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:16:23] [INFO ] Flatten gal took : 25 ms
FORMULA CO4-PT-14-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:16:23] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:16:23] [INFO ] Input system was already deterministic with 513 transitions.
Support contains 42 out of 399 places (down from 43) after GAL structural reductions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 661 edges and 399 vertex of which 391 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Graph (trivial) has 424 edges and 399 vertex of which 2 / 399 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 660 edges and 398 vertex of which 395 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 150 rules applied. Total rules applied 152 place count 394 transition count 359
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 151 rules applied. Total rules applied 303 place count 245 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 244 transition count 357
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 304 place count 244 transition count 325
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 368 place count 212 transition count 325
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 378 place count 202 transition count 313
Iterating global reduction 3 with 10 rules applied. Total rules applied 388 place count 202 transition count 313
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 391 place count 202 transition count 310
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 391 place count 202 transition count 305
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 401 place count 197 transition count 305
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 404 place count 194 transition count 302
Iterating global reduction 4 with 3 rules applied. Total rules applied 407 place count 194 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 409 place count 194 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 410 place count 193 transition count 300
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 6 with 46 rules applied. Total rules applied 456 place count 170 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 458 place count 170 transition count 274
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 463 place count 165 transition count 269
Iterating global reduction 7 with 5 rules applied. Total rules applied 468 place count 165 transition count 269
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 469 place count 164 transition count 267
Iterating global reduction 7 with 1 rules applied. Total rules applied 470 place count 164 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 471 place count 164 transition count 266
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 473 place count 163 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 476 place count 163 transition count 262
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 479 place count 162 transition count 260
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 481 place count 161 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 483 place count 160 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 494 place count 160 transition count 247
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 11 with 7 rules applied. Total rules applied 501 place count 160 transition count 240
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 508 place count 153 transition count 240
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 13 with 2 rules applied. Total rules applied 510 place count 152 transition count 239
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 511 place count 152 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 513 place count 150 transition count 237
Applied a total of 513 rules in 118 ms. Remains 150 /399 variables (removed 249) and now considering 237/513 (removed 276) transitions.
// Phase 1: matrix 237 rows 150 cols
[2024-06-02 18:16:23] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:16:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:16:23] [INFO ] Invariant cache hit.
[2024-06-02 18:16:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:16:23] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-02 18:16:23] [INFO ] Redundant transitions in 9 ms returned []
Running 224 sub problems to find dead transitions.
[2024-06-02 18:16:23] [INFO ] Invariant cache hit.
[2024-06-02 18:16:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 236/385 variables, 149/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 1/386 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 1/387 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 0/387 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 155 constraints, problems are : Problem set: 0 solved, 224 unsolved in 6983 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 236/385 variables, 149/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 223/376 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 1/386 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 8 (OVERLAPS) 1/387 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 379 constraints, problems are : Problem set: 0 solved, 224 unsolved in 12410 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 19450ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 19455ms
Starting structural reductions in SI_CTL mode, iteration 1 : 150/399 places, 237/513 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19749 ms. Remains : 150/399 places, 237/513 transitions.
[2024-06-02 18:16:43] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:16:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:16:43] [INFO ] Input system was already deterministic with 237 transitions.
[2024-06-02 18:16:43] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:16:43] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:16:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality4826349041270101271.gal : 73 ms
[2024-06-02 18:16:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality14913702647786234360.ctl : 8 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/CTLCardinality4826349041270101271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14913702647786234360.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.74363e+06,0.120542,5680,2,724,5,7838,6,0,826,6279,0


Converting to forward existential form...Done !
original formula: E(((p184==0)||(p650==1)) U AG(!(((p128==0)||(p429==1)))))
=> equivalent forward existential formula: [(FwdU(Init,((p184==0)||(p650==1))) * !(E(TRUE U !(!(((p128==0)||(p429==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t40, t70, t72, t86, t236, Intersection with reachable at each step enabled. (destroyed/r...191
Hit Full ! (commute/partial/dont) 233/0/4
(forward)formula 0,1,0.845344,31960,1,0,291,145724,501,154,5132,103389,486
FORMULA CO4-PT-14-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 397 transition count 512
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 34 place count 366 transition count 479
Iterating global reduction 1 with 31 rules applied. Total rules applied 65 place count 366 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 366 transition count 477
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 355 transition count 466
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 355 transition count 466
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 355 transition count 464
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 353 transition count 462
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 353 transition count 462
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 353 transition count 460
Applied a total of 97 rules in 26 ms. Remains 353 /399 variables (removed 46) and now considering 460/513 (removed 53) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 18:16:44] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:16:44] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 18:16:44] [INFO ] Invariant cache hit.
[2024-06-02 18:16:44] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:16:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:16:56] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 19 ms to minimize.
[2024-06-02 18:16:56] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in LTL mode, iteration 1 : 353/399 places, 460/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60599 ms. Remains : 353/399 places, 460/513 transitions.
[2024-06-02 18:17:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:17:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:17:44] [INFO ] Input system was already deterministic with 460 transitions.
[2024-06-02 18:17:44] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:17:44] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:17:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16715515435048927134.gal : 4 ms
[2024-06-02 18:17:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17302912246596687623.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/CTLCardinality16715515435048927134.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17302912246596687623.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.57987e+08,0.355153,15932,2,3272,5,41096,6,0,1869,53211,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.397815,15932,1,0,6,41096,7,1,2260,53211,1
FORMULA CO4-PT-14-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 397 transition count 512
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 29 place count 371 transition count 486
Iterating global reduction 1 with 26 rules applied. Total rules applied 55 place count 371 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 371 transition count 485
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 64 place count 363 transition count 477
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 363 transition count 477
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 363 transition count 476
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 362 transition count 475
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 362 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 362 transition count 474
Applied a total of 76 rules in 24 ms. Remains 362 /399 variables (removed 37) and now considering 474/513 (removed 39) transitions.
// Phase 1: matrix 474 rows 362 cols
[2024-06-02 18:17:45] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:17:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:17:45] [INFO ] Invariant cache hit.
[2024-06-02 18:17:45] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-06-02 18:17:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (OVERLAPS) 474/836 variables, 362/366 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-06-02 18:17:57] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 3 ms to minimize.
[2024-06-02 18:17:58] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/836 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (OVERLAPS) 0/836 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 473 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 368 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 474/836 variables, 362/368 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 473/841 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (OVERLAPS) 0/836 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 473 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 841 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 2/2 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 362/399 places, 474/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60413 ms. Remains : 362/399 places, 474/513 transitions.
[2024-06-02 18:18:45] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:18:45] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:18:45] [INFO ] Input system was already deterministic with 474 transitions.
[2024-06-02 18:18:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:18:45] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:18:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality11642582777143068910.gal : 3 ms
[2024-06-02 18:18:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality525002706768520698.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/CTLCardinality11642582777143068910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality525002706768520698.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.3452e+08,0.342315,15672,2,3287,5,40504,6,0,1919,49943,0


Converting to forward existential form...Done !
original formula: AX(A(((!((EX((p317==1)) * !(EX((p546==0))))) + E((p109==1) U ((p607==0)||(p478==1)))) + ((p245==0)||(p374==1))) U (p672==1)))
=> equivalent forward existential formula: ([(((((FwdU(EY(Init),!((p672==1))) * !((p672==1))) * !(((p245==0)||(p374==1)))) * !(E((p109==1) U ((p607==0)||(p...253
Hit Full ! (commute/partial/dont) 471/0/3
(forward)formula 0,0,3.00229,94976,1,0,29,486095,20,4,8808,149011,27
FORMULA CO4-PT-14-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 397 transition count 512
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 28 place count 372 transition count 485
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 372 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 372 transition count 483
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 364 transition count 475
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 364 transition count 475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 364 transition count 474
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 363 transition count 473
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 363 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 363 transition count 472
Applied a total of 75 rules in 21 ms. Remains 363 /399 variables (removed 36) and now considering 472/513 (removed 41) transitions.
// Phase 1: matrix 472 rows 363 cols
[2024-06-02 18:18:48] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 18:18:48] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:18:48] [INFO ] Invariant cache hit.
[2024-06-02 18:18:49] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 471 sub problems to find dead transitions.
[2024-06-02 18:18:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (OVERLAPS) 472/835 variables, 363/367 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-02 18:19:01] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 6 ms to minimize.
[2024-06-02 18:19:01] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/835 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 471 unsolved
No progress, stopping.
After SMT solving in domain Real declared 835/835 variables, and 369 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 471 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 4 (OVERLAPS) 472/835 variables, 363/369 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 471/840 constraints. Problems are: Problem set: 0 solved, 471 unsolved
[2024-06-02 18:19:26] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 1/841 constraints. Problems are: Problem set: 0 solved, 471 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 471 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/835 variables, and 841 constraints, problems are : Problem set: 0 solved, 471 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 471/471 constraints, Known Traps: 3/3 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 471 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 363/399 places, 472/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60428 ms. Remains : 363/399 places, 472/513 transitions.
[2024-06-02 18:19:49] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:19:49] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:19:49] [INFO ] Input system was already deterministic with 472 transitions.
[2024-06-02 18:19:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:19:49] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:19:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality15906818645150628743.gal : 3 ms
[2024-06-02 18:19:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality2134256757351167663.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/CTLCardinality15906818645150628743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2134256757351167663.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(((EG((p240==0)) * EG(((p479==0)||(p164==0)))) * (AF(((AX((p307==1)) + ((p371==0)&&(p534==1))) + (p596==1))) + EG((A(((p678==0)||(p646=...228
=> equivalent forward existential formula: ([((EY(Init) * (EG((p240==0)) * EG(((p479==0)||(p164==0))))) * !(EG(!(((!(EX(!((p307==1)))) + ((p371==0)&&(p534=...429
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t21, t27, t32, t33, t35, t36, t42, t43, t46, t133, t164, t190, t...404
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-06-02 18:20:19] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:20:19] [INFO ] Applying decomposition
[2024-06-02 18:20:19] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17557344134946649138.txt' '-o' '/tmp/graph17557344134946649138.bin' '-w' '/tmp/graph17557344134946649138.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17557344134946649138.bin' '-l' '-1' '-v' '-w' '/tmp/graph17557344134946649138.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:20:19] [INFO ] Decomposing Gal with order
[2024-06-02 18:20:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:20:19] [INFO ] Removed a total of 154 redundant transitions.
[2024-06-02 18:20:19] [INFO ] Flatten gal took : 53 ms
[2024-06-02 18:20:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 12 ms.
[2024-06-02 18:20:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality4714235429135396510.gal : 8 ms
[2024-06-02 18:20:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15003338027013886775.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/CTLCardinality4714235429135396510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15003338027013886775.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.82838e+08,0.23079,12208,415,71,15092,1974,879,27320,94,8316,0


Converting to forward existential form...Done !
original formula: EX(((EG((i6.i0.u32.p240==0)) * EG(((i14.i0.u84.p479==0)||(i3.i0.u19.p164==0)))) * (AF(((AX((i8.i1.u45.p307==1)) + ((i9.i2.u61.p371==0)&&(...368
=> equivalent forward existential formula: ([((EY(Init) * (EG((i6.i0.u32.p240==0)) * EG(((i14.i0.u84.p479==0)||(i3.i0.u19.p164==0))))) * !(EG(!(((!(EX(!((i...642
Reverse transition relation is NOT exact ! Due to transitions t46, t133, t201, t215, t247, t251, t254, t323, t383, t421, i1.t380, i2.i0.u6.t387, i2.i1.t357...636
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,1,20.4306,539416,1,0,1.05333e+06,5501,6084,1.7581e+06,520,39242,1043268
FORMULA CO4-PT-14-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 397 transition count 512
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 34 place count 366 transition count 479
Iterating global reduction 1 with 31 rules applied. Total rules applied 65 place count 366 transition count 479
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 366 transition count 477
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 355 transition count 466
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 355 transition count 466
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 355 transition count 464
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 353 transition count 462
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 353 transition count 462
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 353 transition count 460
Applied a total of 97 rules in 17 ms. Remains 353 /399 variables (removed 46) and now considering 460/513 (removed 53) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 18:20:40] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:20:40] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 18:20:40] [INFO ] Invariant cache hit.
[2024-06-02 18:20:40] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-02 18:20:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (OVERLAPS) 460/813 variables, 353/357 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 6 ms to minimize.
[2024-06-02 18:20:52] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/813 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Real declared 813/813 variables, and 359 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/353 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (OVERLAPS) 460/813 variables, 353/359 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 459/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 7 (OVERLAPS) 0/813 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 459 unsolved
No progress, stopping.
After SMT solving in domain Int declared 813/813 variables, and 818 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 353/353 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 2/2 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 353/399 places, 460/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60406 ms. Remains : 353/399 places, 460/513 transitions.
[2024-06-02 18:21:40] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:21:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:21:40] [INFO ] Input system was already deterministic with 460 transitions.
[2024-06-02 18:21:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:21:40] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:21:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9252491644587532574.gal : 2 ms
[2024-06-02 18:21:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality10985378082616120333.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/CTLCardinality9252491644587532574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10985378082616120333.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(A((p663==1) U EF((p108!=0))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(E(TRUE U (p108!=0)))) * !((p663==1))) * !(E(TRUE U (p108!=0))))] = FALSE * [FwdG(EY(Init),!(...186
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t16, t26, t31, t32, t34, t35, t39, t40, t43, t127, t158, t184, t191, ...393
(forward)formula 0,1,12.3761,369528,1,0,617,2.25131e+06,953,391,10737,1.44095e+06,978
FORMULA CO4-PT-14-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Graph (trivial) has 422 edges and 399 vertex of which 2 / 399 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 660 edges and 398 vertex of which 390 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.14 ms
Discarding 8 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 148 rules applied. Total rules applied 150 place count 389 transition count 356
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 149 rules applied. Total rules applied 299 place count 242 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 300 place count 241 transition count 354
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 300 place count 241 transition count 322
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 364 place count 209 transition count 322
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 374 place count 199 transition count 310
Iterating global reduction 3 with 10 rules applied. Total rules applied 384 place count 199 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 387 place count 199 transition count 307
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 387 place count 199 transition count 303
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 195 transition count 303
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 397 place count 193 transition count 301
Iterating global reduction 4 with 2 rules applied. Total rules applied 399 place count 193 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 401 place count 193 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 402 place count 192 transition count 299
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 450 place count 168 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 452 place count 168 transition count 272
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 457 place count 163 transition count 267
Iterating global reduction 7 with 5 rules applied. Total rules applied 462 place count 163 transition count 267
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 464 place count 162 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 467 place count 162 transition count 263
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 470 place count 161 transition count 261
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 472 place count 160 transition count 260
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 474 place count 159 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 485 place count 159 transition count 248
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 6 rules applied. Total rules applied 491 place count 159 transition count 242
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 7 rules applied. Total rules applied 498 place count 153 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 499 place count 152 transition count 241
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 13 with 2 rules applied. Total rules applied 501 place count 151 transition count 240
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 502 place count 151 transition count 240
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 503 place count 151 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 505 place count 149 transition count 237
Applied a total of 505 rules in 69 ms. Remains 149 /399 variables (removed 250) and now considering 237/513 (removed 276) transitions.
// Phase 1: matrix 237 rows 149 cols
[2024-06-02 18:21:53] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:21:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:21:53] [INFO ] Invariant cache hit.
[2024-06-02 18:21:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:21:53] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-06-02 18:21:53] [INFO ] Redundant transitions in 8 ms returned []
Running 224 sub problems to find dead transitions.
[2024-06-02 18:21:53] [INFO ] Invariant cache hit.
[2024-06-02 18:21:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 236/385 variables, 149/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (OVERLAPS) 1/386 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (OVERLAPS) 0/386 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 154 constraints, problems are : Problem set: 0 solved, 224 unsolved in 6604 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 149/149 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 236/385 variables, 149/153 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 224/377 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 5 (OVERLAPS) 1/386 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 224 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 378 constraints, problems are : Problem set: 0 solved, 224 unsolved in 8800 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 149/149 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 15443ms problems are : Problem set: 0 solved, 224 unsolved
Search for dead transitions found 0 dead transitions in 15445ms
Starting structural reductions in SI_CTL mode, iteration 1 : 149/399 places, 237/513 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15679 ms. Remains : 149/399 places, 237/513 transitions.
[2024-06-02 18:22:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:22:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:22:08] [INFO ] Input system was already deterministic with 237 transitions.
[2024-06-02 18:22:08] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:22:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:22:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality1483025394054464720.gal : 1 ms
[2024-06-02 18:22:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality8307767168247732663.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/CTLCardinality1483025394054464720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8307767168247732663.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.42957e+06,0.059893,5768,2,730,5,7899,6,0,825,6282,0


Converting to forward existential form...Done !
original formula: AG((EG(EF((p366==1))) * EG(A(((p138==0)||(p136==1)) U (p316==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(E(TRUE U (p366==1)))))] = FALSE * [(FwdU(Init,TRUE) * !(EG(!((E(!((p316==1)) U (!(((p1...225
Reverse transition relation is NOT exact ! Due to transitions t4, t39, t71, t82, t87, t119, Intersection with reachable at each step enabled. (destroyed/r...191
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.09972,142412,1,0,656,855112,506,376,5114,784176,942
FORMULA CO4-PT-14-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 397 transition count 512
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 31 place count 369 transition count 482
Iterating global reduction 1 with 28 rules applied. Total rules applied 59 place count 369 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 369 transition count 481
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 71 place count 358 transition count 470
Iterating global reduction 2 with 11 rules applied. Total rules applied 82 place count 358 transition count 470
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 358 transition count 468
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 356 transition count 466
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 356 transition count 466
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 90 place count 356 transition count 464
Applied a total of 90 rules in 22 ms. Remains 356 /399 variables (removed 43) and now considering 464/513 (removed 49) transitions.
// Phase 1: matrix 464 rows 356 cols
[2024-06-02 18:22:13] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 18:22:13] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 18:22:13] [INFO ] Invariant cache hit.
[2024-06-02 18:22:13] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-06-02 18:22:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/820 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-02 18:22:25] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 3 ms to minimize.
[2024-06-02 18:22:25] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 6 (OVERLAPS) 0/820 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 362 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (OVERLAPS) 464/820 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 463/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 7 (OVERLAPS) 0/820 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 825 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 2/2 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 356/399 places, 464/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60437 ms. Remains : 356/399 places, 464/513 transitions.
[2024-06-02 18:23:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:23:13] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:23:13] [INFO ] Input system was already deterministic with 464 transitions.
[2024-06-02 18:23:13] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:23:13] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:23:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality13501189838383590276.gal : 22 ms
[2024-06-02 18:23:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality11805297908417486909.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/CTLCardinality13501189838383590276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11805297908417486909.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.95521e+08,0.48805,20396,2,5301,5,54827,6,0,1884,78577,0


Converting to forward existential form...Done !
original formula: EG((EX(!(A((p592==1) U (p540==0)))) * AX((((p538==0)&&(p184==1))||(p362==0)))))
=> equivalent forward existential formula: [FwdG(Init,(EX(!(!((E(!((p540==0)) U (!((p592==1)) * !((p540==0)))) + EG(!((p540==0))))))) * !(EX(!((((p538==0)&...193
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t11, t16, t26, t31, t32, t34, t35, t39, t40, t43, t44, t56, t57, t62,...601
(forward)formula 0,0,18.2436,569136,1,0,978,3.07158e+06,961,526,10527,2.99314e+06,1308
FORMULA CO4-PT-14-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 397 transition count 512
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 33 place count 367 transition count 480
Iterating global reduction 1 with 30 rules applied. Total rules applied 63 place count 367 transition count 480
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 367 transition count 478
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 75 place count 357 transition count 468
Iterating global reduction 2 with 10 rules applied. Total rules applied 85 place count 357 transition count 468
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 357 transition count 466
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 356 transition count 465
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 356 transition count 465
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 356 transition count 464
Applied a total of 90 rules in 16 ms. Remains 356 /399 variables (removed 43) and now considering 464/513 (removed 49) transitions.
// Phase 1: matrix 464 rows 356 cols
[2024-06-02 18:23:32] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:23:32] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-02 18:23:32] [INFO ] Invariant cache hit.
[2024-06-02 18:23:32] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-06-02 18:23:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (OVERLAPS) 464/820 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-02 18:23:43] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/820 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (OVERLAPS) 0/820 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 362 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (OVERLAPS) 464/820 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 463/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 7 (OVERLAPS) 0/820 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 463 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 825 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 2/2 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 356/399 places, 464/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60483 ms. Remains : 356/399 places, 464/513 transitions.
[2024-06-02 18:24:32] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:24:32] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:24:32] [INFO ] Input system was already deterministic with 464 transitions.
[2024-06-02 18:24:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:24:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:24:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13753164769288924258.gal : 2 ms
[2024-06-02 18:24:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality8703312026572100790.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/CTLCardinality13753164769288924258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8703312026572100790.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(EX(EF((p474==1))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (p474==1))] != FALSE
(forward)formula 0,1,0.524885,16440,1,0,8,42247,9,1,3653,54468,4
FORMULA CO4-PT-14-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 513/513 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 397 transition count 512
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 31 place count 369 transition count 482
Iterating global reduction 1 with 28 rules applied. Total rules applied 59 place count 369 transition count 482
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 369 transition count 480
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 72 place count 358 transition count 469
Iterating global reduction 2 with 11 rules applied. Total rules applied 83 place count 358 transition count 469
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 358 transition count 467
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 87 place count 356 transition count 465
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 356 transition count 465
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 356 transition count 463
Applied a total of 91 rules in 22 ms. Remains 356 /399 variables (removed 43) and now considering 463/513 (removed 50) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 18:24:33] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 18:24:33] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 18:24:33] [INFO ] Invariant cache hit.
[2024-06-02 18:24:33] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-02 18:24:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/819 variables, 356/360 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-02 18:24:45] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 3 ms to minimize.
[2024-06-02 18:24:45] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/819 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 819/819 variables, and 362 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/356 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/356 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/819 variables, 356/362 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 462/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 0/819 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Int declared 819/819 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 356/356 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 2/2 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 356/399 places, 463/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60514 ms. Remains : 356/399 places, 463/513 transitions.
[2024-06-02 18:25:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:25:33] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:25:33] [INFO ] Input system was already deterministic with 463 transitions.
[2024-06-02 18:25:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:25:33] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:25:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6724675246240787003.gal : 2 ms
[2024-06-02 18:25:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality8972206225542028864.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/CTLCardinality6724675246240787003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8972206225542028864.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61025e+08,0.403127,16692,2,3276,5,42129,6,0,1883,55647,0


Converting to forward existential form...Done !
original formula: EF(((p174==1) * (EF(((p467==0)&&(p431==1))) + EX(((p130==0)&&(p421==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * (p174==1)),TRUE) * ((p467==0)&&(p431==1)))] != FALSE + [(EY((FwdU(Init,TRUE) * (p174=...197
(forward)formula 0,1,0.490058,16956,1,0,10,42129,10,2,3076,55647,4
FORMULA CO4-PT-14-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 18:25:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:25:34] [INFO ] Flatten gal took : 8 ms
Total runtime 559809 ms.

BK_STOP 1717352734260

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

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