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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-06-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717351355252

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:02:36] [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:02:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:02:36] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-02 18:02:36] [INFO ] Transformed 383 places.
[2024-06-02 18:02:36] [INFO ] Transformed 454 transitions.
[2024-06-02 18:02:36] [INFO ] Found NUPN structural information;
[2024-06-02 18:02:36] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 334/334 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 274 transition count 334
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 55 place count 228 transition count 286
Iterating global reduction 1 with 46 rules applied. Total rules applied 101 place count 228 transition count 286
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 105 place count 228 transition count 282
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 120 place count 213 transition count 267
Iterating global reduction 2 with 15 rules applied. Total rules applied 135 place count 213 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 212 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 212 transition count 265
Applied a total of 137 rules in 64 ms. Remains 212 /283 variables (removed 71) and now considering 265/334 (removed 69) transitions.
// Phase 1: matrix 265 rows 212 cols
[2024-06-02 18:02:36] [INFO ] Computed 4 invariants in 18 ms
[2024-06-02 18:02:37] [INFO ] Implicit Places using invariants in 215 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 243 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 211/283 places, 265/334 transitions.
Applied a total of 0 rules in 5 ms. Remains 211 /211 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 334 ms. Remains : 211/283 places, 265/334 transitions.
Support contains 49 out of 211 places after structural reductions.
[2024-06-02 18:02:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:02:37] [INFO ] Flatten gal took : 44 ms
FORMULA CO4-PT-06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:02:37] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:02:37] [INFO ] Input system was already deterministic with 265 transitions.
Support contains 41 out of 211 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (44 resets) in 1608 ms. (24 steps per ms) remains 22/33 properties
BEST_FIRST walk for 4001 steps (30 resets) in 70 ms. (56 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (29 resets) in 55 ms. (71 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (37 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (26 resets) in 72 ms. (54 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (25 resets) in 18 ms. (210 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4001 steps (32 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (33 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (18 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (15 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (45 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (27 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (24 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (42 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (25 resets) in 22 ms. (173 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (40 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (43 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4000 steps (21 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (26 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
// Phase 1: matrix 265 rows 211 cols
[2024-06-02 18:02:38] [INFO ] Computed 3 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 10/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 7/45 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 78/123 variables, 45/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 142/265 variables, 48/96 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 144/409 variables, 78/174 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 55/464 variables, 33/207 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 10/474 variables, 6/213 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 15 (OVERLAPS) 2/476 variables, 1/214 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/476 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 214 constraints, problems are : Problem set: 1 solved, 19 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 211/211 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/25 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 11/36 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 74/117 variables, 43/46 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 139/256 variables, 45/92 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 18/110 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 148/404 variables, 80/190 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 59/463 variables, 35/225 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 11/474 variables, 7/232 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/474 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 17 (OVERLAPS) 2/476 variables, 1/233 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/476 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/476 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 233 constraints, problems are : Problem set: 2 solved, 18 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 2673ms problems are : Problem set: 2 solved, 18 unsolved
Finished Parikh walk after 2734 steps, including 81 resets, run visited all 1 properties in 4 ms. (steps per millisecond=683 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 1737 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA CO4-PT-06-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:02:42] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:02:42] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:02:42] [INFO ] Input system was already deterministic with 265 transitions.
Support contains 34 out of 211 places (down from 36) after GAL structural reductions.
Computed a total of 11 stabilizing places and 13 stable transitions
Graph (complete) has 339 edges and 211 vertex of which 207 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Graph (trivial) has 219 edges and 211 vertex of which 2 / 211 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 338 edges and 210 vertex of which 206 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 205 transition count 169
Reduce places removed 90 places and 0 transitions.
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 1 with 93 rules applied. Total rules applied 186 place count 115 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 187 place count 114 transition count 166
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 187 place count 114 transition count 153
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 213 place count 101 transition count 153
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 218 place count 96 transition count 148
Iterating global reduction 3 with 5 rules applied. Total rules applied 223 place count 96 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 223 place count 96 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 95 transition count 147
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 227 place count 93 transition count 145
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 93 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 93 transition count 144
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 256 place count 80 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 258 place count 80 transition count 127
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 260 place count 78 transition count 125
Iterating global reduction 5 with 2 rules applied. Total rules applied 262 place count 78 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 269 place count 78 transition count 118
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 272 place count 78 transition count 115
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 275 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 275 place count 75 transition count 114
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 277 place count 74 transition count 114
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 279 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 281 place count 71 transition count 111
Applied a total of 281 rules in 48 ms. Remains 71 /211 variables (removed 140) and now considering 111/265 (removed 154) transitions.
// Phase 1: matrix 111 rows 71 cols
[2024-06-02 18:02:42] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:02:42] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 18:02:42] [INFO ] Invariant cache hit.
[2024-06-02 18:02:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:02:42] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-02 18:02:42] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-02 18:02:42] [INFO ] Invariant cache hit.
[2024-06-02 18:02:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1936 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3637ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 3639ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/211 places, 111/265 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3804 ms. Remains : 71/211 places, 111/265 transitions.
[2024-06-02 18:02:46] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:02:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:02:46] [INFO ] Input system was already deterministic with 111 transitions.
[2024-06-02 18:02:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:02:46] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:02:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11566409433465328876.gal : 3 ms
[2024-06-02 18:02:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7724705694050778779.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11566409433465328876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7724705694050778779.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7724705694050778779.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 14
SDD proceeding with computation,1 properties remain. new max is 16
RANDOM walk for 39249 steps (5357 resets) in 515 ms. (76 steps per ms) remains 0/1 properties
FORMULA CO4-PT-06-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD size :14 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 49
Reachability property CO4-PT-06-CTLCardinality-2024-00 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,262,0.02464,3988,2,217,11,1684,6,0,388,1167,0
Total reachable state count : 262

Verifying 1 reachability properties.
Reachability property CO4-PT-06-CTLCardinality-2024-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-06-CTLCardinality-2024-00,35,0.025115,4348,2,115,11,1684,7,0,391,1167,0
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Graph (trivial) has 210 edges and 211 vertex of which 2 / 211 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 338 edges and 210 vertex of which 206 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 205 transition count 174
Reduce places removed 85 places and 0 transitions.
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 1 with 88 rules applied. Total rules applied 176 place count 120 transition count 171
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 179 place count 119 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 117 transition count 169
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 181 place count 117 transition count 156
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 207 place count 104 transition count 156
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 211 place count 100 transition count 152
Iterating global reduction 4 with 4 rules applied. Total rules applied 215 place count 100 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 99 transition count 151
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 99 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 99 transition count 150
Performed 14 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 246 place count 85 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 250 place count 85 transition count 130
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 252 place count 84 transition count 129
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 254 place count 82 transition count 127
Iterating global reduction 7 with 2 rules applied. Total rules applied 256 place count 82 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 261 place count 82 transition count 122
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 1 rules applied. Total rules applied 262 place count 82 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 263 place count 81 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 263 place count 81 transition count 120
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 265 place count 80 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 267 place count 79 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 269 place count 77 transition count 117
Applied a total of 269 rules in 67 ms. Remains 77 /211 variables (removed 134) and now considering 117/265 (removed 148) transitions.
// Phase 1: matrix 117 rows 77 cols
[2024-06-02 18:02:46] [INFO ] Computed 3 invariants in 17 ms
[2024-06-02 18:02:46] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 18:02:46] [INFO ] Invariant cache hit.
[2024-06-02 18:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:02:47] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 18:02:47] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-02 18:02:47] [INFO ] Invariant cache hit.
[2024-06-02 18:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 116/193 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 81 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 116/193 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 107/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 1/194 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 188 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 4171ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 4173ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/211 places, 117/265 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4506 ms. Remains : 77/211 places, 117/265 transitions.
[2024-06-02 18:02:51] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:02:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:02:51] [INFO ] Input system was already deterministic with 117 transitions.
[2024-06-02 18:02:51] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:02:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:02:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2614318905388102817.gal : 2 ms
[2024-06-02 18:02:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality852600324640751429.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2614318905388102817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality852600324640751429.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,10801,0.029081,4212,2,215,5,2371,6,0,418,2455,0


Converting to forward existential form...Done !
original formula: A(AG((EG((p95==0)) * (E((p112==1) U (p230==0)) + (p94==0)))) U EF(!(AG(EF((p334==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(!(E(TRUE U !(E(TRUE U (p334==1))))))))))) * !(E(!(E(TRUE U !(!(E(TRUE U !(E(TRUE U (...315
Reverse transition relation is NOT exact ! Due to transitions t8, t34, t37, t44, t54, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,1,0.137638,9480,1,0,158,32276,262,86,2570,22024,253
FORMULA CO4-PT-06-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 264
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 188 transition count 242
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 188 transition count 242
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 178 transition count 231
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 178 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 178 transition count 230
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 173 transition count 224
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 173 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 172 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 172 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 171 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 171 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 171 transition count 221
Applied a total of 82 rules in 20 ms. Remains 171 /211 variables (removed 40) and now considering 221/265 (removed 44) transitions.
// Phase 1: matrix 221 rows 171 cols
[2024-06-02 18:02:51] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:02:51] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:02:51] [INFO ] Invariant cache hit.
[2024-06-02 18:02:51] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-02 18:02:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/392 variables, 171/174 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-06-02 18:02:54] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 9 ms to minimize.
[2024-06-02 18:02:54] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 176 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7717 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/392 variables, 171/176 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 220/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/392 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 396 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 2/2 constraints]
After SMT, in 14869ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 14871ms
Starting structural reductions in LTL mode, iteration 1 : 171/211 places, 221/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15039 ms. Remains : 171/211 places, 221/265 transitions.
[2024-06-02 18:03:06] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:03:06] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:03:06] [INFO ] Input system was already deterministic with 221 transitions.
[2024-06-02 18:03:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:06] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality17629000615205104756.gal : 3 ms
[2024-06-02 18:03:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality15777883729745230212.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/CTLCardinality17629000615205104756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15777883729745230212.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,196301,0.111719,7488,2,874,5,13843,6,0,903,17296,0


Converting to forward existential form...Done !
original formula: AG((AG(EX((p343==0))) * A((p270==1) U (!(EG(((p345==0)||(p300==1)))) + A((p237!=0) U AG((p98==0)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !(EX((p343==0))))] = FALSE * ([FwdG(((FwdU(FwdU(Init,TRUE),!((!(EG(((p345==0)||(...650
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t26, t31, t32, t34, t35, t39, t40, t43, t153, t176, t203, Inte...250
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.10784,228268,1,0,681,1.59234e+06,483,380,5638,1.25225e+06,920
FORMULA CO4-PT-06-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Graph (trivial) has 220 edges and 211 vertex of which 2 / 211 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 338 edges and 210 vertex of which 206 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 205 transition count 168
Reduce places removed 91 places and 0 transitions.
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 1 with 94 rules applied. Total rules applied 188 place count 114 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 113 transition count 165
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 189 place count 113 transition count 152
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 215 place count 100 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 219 place count 96 transition count 148
Iterating global reduction 3 with 4 rules applied. Total rules applied 223 place count 96 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 223 place count 96 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 95 transition count 147
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 227 place count 93 transition count 145
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 93 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 230 place count 93 transition count 144
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 256 place count 80 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 260 place count 80 transition count 125
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 5 with 3 rules applied. Total rules applied 263 place count 79 transition count 123
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 6 with 3 rules applied. Total rules applied 266 place count 78 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 268 place count 77 transition count 120
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 270 place count 75 transition count 118
Iterating global reduction 8 with 2 rules applied. Total rules applied 272 place count 75 transition count 118
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 274 place count 74 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 278 place count 74 transition count 113
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 1 rules applied. Total rules applied 279 place count 74 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 280 place count 73 transition count 112
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 282 place count 72 transition count 111
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 283 place count 72 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 285 place count 70 transition count 109
Applied a total of 285 rules in 34 ms. Remains 70 /211 variables (removed 141) and now considering 109/265 (removed 156) transitions.
// Phase 1: matrix 109 rows 70 cols
[2024-06-02 18:03:13] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:03:13] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:03:13] [INFO ] Invariant cache hit.
[2024-06-02 18:03:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:03:13] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 18:03:13] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-02 18:03:13] [INFO ] Invariant cache hit.
[2024-06-02 18:03:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 108/178 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/179 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 74 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 108/178 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 99/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/179 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 173 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1667 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3318ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3319ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/211 places, 109/265 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3569 ms. Remains : 70/211 places, 109/265 transitions.
[2024-06-02 18:03:17] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:17] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:17] [INFO ] Input system was already deterministic with 109 transitions.
[2024-06-02 18:03:17] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:17] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:03:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13976898700203345400.gal : 2 ms
[2024-06-02 18:03:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3128897162242078527.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/CTLCardinality13976898700203345400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3128897162242078527.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,7921,0.018928,3896,2,204,5,1590,6,0,382,1312,0


Converting to forward existential form...Done !
original formula: EF(EG((p260==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p260==0))] != FALSE
Hit Full ! (commute/partial/dont) 107/0/2
(forward)formula 0,1,0.048435,5268,1,0,9,8908,19,3,1762,4462,8
FORMULA CO4-PT-06-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 264
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 186 transition count 240
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 186 transition count 240
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 174 transition count 227
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 174 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 174 transition count 225
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 169 transition count 219
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 169 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 168 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 168 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 167 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 167 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 167 transition count 216
Applied a total of 91 rules in 14 ms. Remains 167 /211 variables (removed 44) and now considering 216/265 (removed 49) transitions.
// Phase 1: matrix 216 rows 167 cols
[2024-06-02 18:03:17] [INFO ] Computed 3 invariants in 6 ms
[2024-06-02 18:03:17] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:03:17] [INFO ] Invariant cache hit.
[2024-06-02 18:03:17] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-06-02 18:03:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 216/383 variables, 167/170 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-06-02 18:03:20] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:03:20] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 0/383 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 172 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7092 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 216/383 variables, 167/172 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 215/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 387 constraints, problems are : Problem set: 0 solved, 215 unsolved in 7313 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 2/2 constraints]
After SMT, in 14450ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 14452ms
Starting structural reductions in LTL mode, iteration 1 : 167/211 places, 216/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14603 ms. Remains : 167/211 places, 216/265 transitions.
[2024-06-02 18:03:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:32] [INFO ] Input system was already deterministic with 216 transitions.
[2024-06-02 18:03:32] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:32] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:03:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality1849044495385290722.gal : 2 ms
[2024-06-02 18:03:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality17991355090060745632.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/CTLCardinality1849044495385290722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17991355090060745632.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,180279,0.095669,7180,2,766,5,12829,6,0,882,15697,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.104806,7180,1,0,6,12829,7,1,1071,15697,1
FORMULA CO4-PT-06-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 264
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 187 transition count 241
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 187 transition count 241
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 175 transition count 228
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 175 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 74 place count 175 transition count 226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 170 transition count 220
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 170 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 169 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 169 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 168 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 168 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 168 transition count 217
Applied a total of 89 rules in 10 ms. Remains 168 /211 variables (removed 43) and now considering 217/265 (removed 48) transitions.
// Phase 1: matrix 217 rows 168 cols
[2024-06-02 18:03:32] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:03:32] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-02 18:03:32] [INFO ] Invariant cache hit.
[2024-06-02 18:03:32] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-06-02 18:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/385 variables, 168/171 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-06-02 18:03:35] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:03:35] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/385 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 173 constraints, problems are : Problem set: 0 solved, 216 unsolved in 7405 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/385 variables, 168/173 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 216/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/385 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 389 constraints, problems are : Problem set: 0 solved, 216 unsolved in 7136 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 2/2 constraints]
After SMT, in 14577ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 14579ms
Starting structural reductions in LTL mode, iteration 1 : 168/211 places, 217/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14999 ms. Remains : 168/211 places, 217/265 transitions.
[2024-06-02 18:03:47] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:03:47] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:03:47] [INFO ] Input system was already deterministic with 217 transitions.
[2024-06-02 18:03:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:03:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality9354068996742159346.gal : 1 ms
[2024-06-02 18:03:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality15651402462288366333.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/CTLCardinality9354068996742159346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15651402462288366333.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,181731,0.091732,7448,2,779,5,13276,6,0,887,16182,0


Converting to forward existential form...Done !
original formula: EG(EF(EX((p188==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((p188==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t38, t39, t42, t152, t175, t202, Intersect...245
(forward)formula 0,1,3.16235,107868,1,0,476,501739,461,304,5230,673326,605
FORMULA CO4-PT-06-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 264
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 189 transition count 243
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 189 transition count 243
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 177 transition count 230
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 177 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 177 transition count 228
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 172 transition count 222
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 172 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 171 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 171 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 170 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 170 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 170 transition count 219
Applied a total of 85 rules in 8 ms. Remains 170 /211 variables (removed 41) and now considering 219/265 (removed 46) transitions.
// Phase 1: matrix 219 rows 170 cols
[2024-06-02 18:03:50] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 18:03:50] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:03:50] [INFO ] Invariant cache hit.
[2024-06-02 18:03:50] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-02 18:03:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 219/389 variables, 170/173 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-02 18:03:53] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:03:53] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/389 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 175 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7153 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/389 variables, 170/175 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 218/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 393 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7458 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 14673ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 14675ms
Starting structural reductions in LTL mode, iteration 1 : 170/211 places, 219/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14880 ms. Remains : 170/211 places, 219/265 transitions.
[2024-06-02 18:04:05] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:04:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:05] [INFO ] Input system was already deterministic with 219 transitions.
[2024-06-02 18:04:05] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:05] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:04:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2166787852219317159.gal : 8 ms
[2024-06-02 18:04:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality17747993388226759350.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/CTLCardinality2166787852219317159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17747993388226759350.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,184635,0.09523,7220,2,784,5,13472,6,0,897,16288,0


Converting to forward existential form...Done !
original formula: EX(E((p369==0) U ((p203==1)&&((p279==0)||(p243==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),(p369==0)) * ((p203==1)&&((p279==0)||(p243==1))))] != FALSE
Hit Full ! (commute/partial/dont) 217/0/2
(forward)formula 0,1,0.155757,7748,1,0,11,14038,15,1,1751,16288,5
FORMULA CO4-PT-06-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Graph (trivial) has 213 edges and 211 vertex of which 2 / 211 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 338 edges and 210 vertex of which 206 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 205 transition count 175
Reduce places removed 84 places and 0 transitions.
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 1 with 87 rules applied. Total rules applied 174 place count 121 transition count 172
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 178 place count 120 transition count 169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 181 place count 117 transition count 169
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 181 place count 117 transition count 156
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 207 place count 104 transition count 156
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 211 place count 100 transition count 152
Iterating global reduction 4 with 4 rules applied. Total rules applied 215 place count 100 transition count 152
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 216 place count 99 transition count 151
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 99 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 99 transition count 150
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 244 place count 86 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 248 place count 86 transition count 131
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 6 with 3 rules applied. Total rules applied 251 place count 85 transition count 129
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 7 with 3 rules applied. Total rules applied 254 place count 84 transition count 127
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 256 place count 83 transition count 126
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 258 place count 81 transition count 124
Iterating global reduction 9 with 2 rules applied. Total rules applied 260 place count 81 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 262 place count 80 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 266 place count 80 transition count 119
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 1 rules applied. Total rules applied 267 place count 80 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 268 place count 79 transition count 118
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 11 with 2 rules applied. Total rules applied 270 place count 78 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 272 place count 76 transition count 115
Applied a total of 272 rules in 27 ms. Remains 76 /211 variables (removed 135) and now considering 115/265 (removed 150) transitions.
// Phase 1: matrix 115 rows 76 cols
[2024-06-02 18:04:05] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:04:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 18:04:05] [INFO ] Invariant cache hit.
[2024-06-02 18:04:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:04:05] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-02 18:04:05] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-02 18:04:05] [INFO ] Invariant cache hit.
[2024-06-02 18:04:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/190 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/191 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 80 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1679 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/190 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 105/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 185 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1903 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 3603ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 3604ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/211 places, 115/265 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3779 ms. Remains : 76/211 places, 115/265 transitions.
[2024-06-02 18:04:09] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:04:09] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:04:09] [INFO ] Input system was already deterministic with 115 transitions.
[2024-06-02 18:04:09] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:04:09] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:04:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality10247579270733376865.gal : 1 ms
[2024-06-02 18:04:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality2980251846072429094.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/CTLCardinality10247579270733376865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2980251846072429094.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,8785,0.02044,3948,2,231,5,1882,6,0,412,1679,0


Converting to forward existential form...Done !
original formula: AF(EG((AF((p155==1)) * ((AF((p287==0)) + (p94==0)) + (p98==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(EG(!((p155==1)))) * ((!(EG(!((p287==0)))) + (p94==0)) + (p98==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t34, t37, t46, t54, Intersection with reachable at each step enabled. (destroyed/reverse...185
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.285305,15840,1,0,365,70131,270,225,2441,73164,548
FORMULA CO4-PT-06-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 264
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 189 transition count 243
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 189 transition count 243
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 179 transition count 232
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 179 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 179 transition count 231
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 174 transition count 225
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 174 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 173 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 173 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 172 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 172 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 172 transition count 222
Applied a total of 80 rules in 8 ms. Remains 172 /211 variables (removed 39) and now considering 222/265 (removed 43) transitions.
// Phase 1: matrix 222 rows 172 cols
[2024-06-02 18:04:09] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:04:09] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:04:09] [INFO ] Invariant cache hit.
[2024-06-02 18:04:09] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:04:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 222/394 variables, 172/175 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:04:12] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:04:12] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 177 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7515 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 222/394 variables, 172/177 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 221/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 398 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7681 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
After SMT, in 15227ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 15229ms
Starting structural reductions in LTL mode, iteration 1 : 172/211 places, 222/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15391 ms. Remains : 172/211 places, 222/265 transitions.
[2024-06-02 18:04:25] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:04:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:25] [INFO ] Input system was already deterministic with 222 transitions.
[2024-06-02 18:04:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:25] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality10903007843211238002.gal : 2 ms
[2024-06-02 18:04:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4070245979821967978.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/CTLCardinality10903007843211238002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4070245979821967978.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,198859,0.09309,7224,2,788,5,13548,6,0,908,15341,0


Converting to forward existential form...Done !
original formula: (AF(AX(EG(AF(((p105==0)&&(p188==1)))))) + A(EX(EF(EX((p246==1)))) U AF((p312==1))))
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(!(EG(!((p312==1))))) U (!(EX(E(TRUE U EX((p246==1))))) * !(!(EG(!((p312==1))))))) + EG(!(...240
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t30, t31, t33, t34, t41, t42, t45, t155, t179, t206, Intersect...245
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,0,11.22,383948,1,0,1342,2.65642e+06,492,801,5639,2.39208e+06,1628
FORMULA CO4-PT-06-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 210 transition count 264
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 189 transition count 243
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 189 transition count 243
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 179 transition count 233
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 179 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 179 transition count 231
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 175 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 175 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 174 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 174 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 173 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 173 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 173 transition count 223
Applied a total of 79 rules in 10 ms. Remains 173 /211 variables (removed 38) and now considering 223/265 (removed 42) transitions.
// Phase 1: matrix 223 rows 173 cols
[2024-06-02 18:04:36] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:04:36] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:04:36] [INFO ] Invariant cache hit.
[2024-06-02 18:04:36] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-06-02 18:04:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 223/396 variables, 173/176 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-02 18:04:39] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:04:39] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 178 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7660 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/396 variables, 173/178 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 222/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 400 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints]
After SMT, in 15157ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 15159ms
Starting structural reductions in LTL mode, iteration 1 : 173/211 places, 223/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15319 ms. Remains : 173/211 places, 223/265 transitions.
[2024-06-02 18:04:51] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:04:51] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:04:51] [INFO ] Input system was already deterministic with 223 transitions.
[2024-06-02 18:04:51] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:04:51] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:04:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6036163153255528320.gal : 2 ms
[2024-06-02 18:04:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8114952458575109559.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/CTLCardinality6036163153255528320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8114952458575109559.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,205971,0.104954,7224,2,787,5,13112,6,0,913,16247,0


Converting to forward existential form...Done !
original formula: EX(EG(EF((AF((p249==1)) + ((p331!=0)&&(p193!=1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),E(TRUE U (!(EG(!((p249==1)))) + ((p331!=0)&&(p193!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t16, t25, t32, t33, t34, t35, t37, t38, t42, t43, t46, t157, t180, t207, ...255
(forward)formula 0,1,7.26926,216560,1,0,748,1.25019e+06,479,429,5368,1.40577e+06,921
FORMULA CO4-PT-06-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 190 transition count 244
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 190 transition count 244
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 180 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 180 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 180 transition count 232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 177 transition count 229
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 177 transition count 229
Applied a total of 70 rules in 11 ms. Remains 177 /211 variables (removed 34) and now considering 229/265 (removed 36) transitions.
// Phase 1: matrix 229 rows 177 cols
[2024-06-02 18:04:59] [INFO ] Computed 3 invariants in 5 ms
[2024-06-02 18:04:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:04:59] [INFO ] Invariant cache hit.
[2024-06-02 18:04:59] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-02 18:04:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 229/405 variables, 176/179 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-02 18:05:02] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:05:02] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (OVERLAPS) 1/406 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 182 constraints, problems are : Problem set: 0 solved, 228 unsolved in 9259 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/405 variables, 176/181 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 199/380 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/406 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 29/410 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 410 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12254 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 177/177 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints]
After SMT, in 21561ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 21564ms
Starting structural reductions in LTL mode, iteration 1 : 177/211 places, 229/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21743 ms. Remains : 177/211 places, 229/265 transitions.
[2024-06-02 18:05:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:05:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:05:20] [INFO ] Input system was already deterministic with 229 transitions.
[2024-06-02 18:05:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:05:20] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:05:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality1323434548502717831.gal : 1 ms
[2024-06-02 18:05:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality14155334608931861486.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/CTLCardinality1323434548502717831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14155334608931861486.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,249731,0.102621,7508,2,808,5,13945,6,0,932,16667,0


Converting to forward existential form...Done !
original formula: A(!((EF(((p189==0)||(p357==1))) + AX(EG((p316==1))))) U !(EX(((AF((p207==1)) + AF((p277==0))) + ((p314==0)||(p331==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(((!(EG(!((p207==1)))) + !(EG(!((p277==0))))) + ((p314==0)||(p331==1))))))))) * !(E(!(!(EX(...395
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t15, t26, t33, t34, t35, t36, t38, t39, t44, t46, t50, t51, t54, t163, t1...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,9.21209,264676,1,0,1085,1.86215e+06,505,583,5792,1.60126e+06,1414
FORMULA CO4-PT-06-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Graph (trivial) has 219 edges and 211 vertex of which 2 / 211 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 338 edges and 210 vertex of which 206 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 205 transition count 170
Reduce places removed 89 places and 0 transitions.
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 1 with 92 rules applied. Total rules applied 184 place count 116 transition count 167
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 186 place count 115 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 187 place count 114 transition count 166
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 187 place count 114 transition count 153
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 213 place count 101 transition count 153
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 218 place count 96 transition count 148
Iterating global reduction 4 with 5 rules applied. Total rules applied 223 place count 96 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 223 place count 96 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 95 transition count 147
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 227 place count 93 transition count 145
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 93 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 230 place count 93 transition count 144
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 256 place count 80 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 260 place count 80 transition count 125
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 6 with 3 rules applied. Total rules applied 263 place count 79 transition count 123
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 7 with 3 rules applied. Total rules applied 266 place count 78 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 268 place count 77 transition count 120
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 270 place count 75 transition count 118
Iterating global reduction 9 with 2 rules applied. Total rules applied 272 place count 75 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 274 place count 74 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 278 place count 74 transition count 113
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 1 rules applied. Total rules applied 279 place count 74 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 280 place count 73 transition count 112
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 11 with 2 rules applied. Total rules applied 282 place count 72 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 284 place count 70 transition count 109
Applied a total of 284 rules in 55 ms. Remains 70 /211 variables (removed 141) and now considering 109/265 (removed 156) transitions.
// Phase 1: matrix 109 rows 70 cols
[2024-06-02 18:05:30] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:05:30] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:05:30] [INFO ] Invariant cache hit.
[2024-06-02 18:05:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:05:30] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-06-02 18:05:30] [INFO ] Redundant transitions in 1 ms returned []
Running 99 sub problems to find dead transitions.
[2024-06-02 18:05:30] [INFO ] Invariant cache hit.
[2024-06-02 18:05:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 108/178 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 1/179 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 0/179 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 74 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 108/178 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 99/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/179 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 173 constraints, problems are : Problem set: 0 solved, 99 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints]
After SMT, in 3184ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 3186ms
Starting structural reductions in SI_CTL mode, iteration 1 : 70/211 places, 109/265 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3367 ms. Remains : 70/211 places, 109/265 transitions.
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:05:33] [INFO ] Input system was already deterministic with 109 transitions.
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:05:33] [INFO ] Flatten gal took : 1 ms
[2024-06-02 18:05:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6314716587553350702.gal : 1 ms
[2024-06-02 18:05:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality10246649047765032147.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/CTLCardinality6314716587553350702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10246649047765032147.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,7921,0.051512,3892,2,206,5,1597,6,0,382,1335,0


Converting to forward existential form...Done !
original formula: EG((p201==0))
=> equivalent forward existential formula: [FwdG(Init,(p201==0))] != FALSE
Hit Full ! (commute/partial/dont) 107/0/2
(forward)formula 0,1,0.117693,5528,1,0,8,9375,19,4,1756,5216,8
FORMULA CO4-PT-06-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 211/211 places, 265/265 transitions.
Graph (trivial) has 219 edges and 211 vertex of which 2 / 211 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 338 edges and 210 vertex of which 206 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 205 transition count 170
Reduce places removed 89 places and 0 transitions.
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 1 with 92 rules applied. Total rules applied 184 place count 116 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 185 place count 115 transition count 167
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 185 place count 115 transition count 154
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 211 place count 102 transition count 154
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 216 place count 97 transition count 149
Iterating global reduction 3 with 5 rules applied. Total rules applied 221 place count 97 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 221 place count 97 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 96 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 225 place count 94 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 227 place count 94 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 228 place count 94 transition count 145
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 254 place count 81 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 258 place count 81 transition count 126
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 5 with 3 rules applied. Total rules applied 261 place count 80 transition count 124
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 6 with 3 rules applied. Total rules applied 264 place count 79 transition count 122
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 266 place count 78 transition count 121
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 268 place count 76 transition count 119
Iterating global reduction 8 with 2 rules applied. Total rules applied 270 place count 76 transition count 119
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 272 place count 75 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 276 place count 75 transition count 114
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 1 rules applied. Total rules applied 277 place count 75 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 278 place count 74 transition count 113
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 280 place count 73 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 282 place count 71 transition count 110
Applied a total of 282 rules in 46 ms. Remains 71 /211 variables (removed 140) and now considering 110/265 (removed 155) transitions.
// Phase 1: matrix 110 rows 71 cols
[2024-06-02 18:05:33] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:05:33] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:05:33] [INFO ] Invariant cache hit.
[2024-06-02 18:05:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:05:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-02 18:05:33] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-02 18:05:33] [INFO ] Invariant cache hit.
[2024-06-02 18:05:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 109/180 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/181 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/181 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 75 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1544 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 109/180 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 100/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 1/181 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 175 constraints, problems are : Problem set: 0 solved, 100 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 3338ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 3339ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/211 places, 110/265 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3583 ms. Remains : 71/211 places, 110/265 transitions.
[2024-06-02 18:05:37] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:05:37] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:05:37] [INFO ] Input system was already deterministic with 110 transitions.
[2024-06-02 18:05:37] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:05:37] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:05:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality6213126241892950670.gal : 52 ms
[2024-06-02 18:05:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality3049725853132851979.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/CTLCardinality6213126241892950670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3049725853132851979.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,8065,0.016243,3896,2,214,5,1655,6,0,387,1369,0


Converting to forward existential form...Done !
original formula: AF(AG((p286==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p286==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t35, t38, t45, t51, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,0,0.088283,7380,1,0,144,18054,245,79,2368,14601,234
FORMULA CO4-PT-06-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 18:05:37] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:05:37] [INFO ] Flatten gal took : 5 ms
Total runtime 181007 ms.

BK_STOP 1717351537522

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

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