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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 132K 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-11-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717351820137

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:10:21] [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:10:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:10:21] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 18:10:21] [INFO ] Transformed 545 places.
[2024-06-02 18:10:21] [INFO ] Transformed 617 transitions.
[2024-06-02 18:10:21] [INFO ] Found NUPN structural information;
[2024-06-02 18:10:21] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 157 places in 14 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-11-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 69 place count 322 transition count 381
Iterating global reduction 1 with 54 rules applied. Total rules applied 123 place count 322 transition count 381
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 163 place count 282 transition count 341
Iterating global reduction 1 with 40 rules applied. Total rules applied 203 place count 282 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 206 place count 282 transition count 338
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 220 place count 268 transition count 324
Iterating global reduction 2 with 14 rules applied. Total rules applied 234 place count 268 transition count 324
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 240 place count 262 transition count 318
Iterating global reduction 2 with 6 rules applied. Total rules applied 246 place count 262 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 248 place count 262 transition count 316
Applied a total of 248 rules in 94 ms. Remains 262 /388 variables (removed 126) and now considering 316/440 (removed 124) transitions.
// Phase 1: matrix 316 rows 262 cols
[2024-06-02 18:10:21] [INFO ] Computed 4 invariants in 21 ms
[2024-06-02 18:10:21] [INFO ] Implicit Places using invariants in 244 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 273 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 261/388 places, 316/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 261 /261 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 389 ms. Remains : 261/388 places, 316/440 transitions.
Support contains 41 out of 261 places after structural reductions.
[2024-06-02 18:10:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:10:22] [INFO ] Flatten gal took : 47 ms
FORMULA CO4-PT-11-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:10:22] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:10:22] [INFO ] Input system was already deterministic with 316 transitions.
Support contains 36 out of 261 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (25 resets) in 2285 ms. (17 steps per ms) remains 17/24 properties
BEST_FIRST walk for 4002 steps (23 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (38 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (35 resets) in 33 ms. (117 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4001 steps (30 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (31 resets) in 18 ms. (210 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4001 steps (17 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (26 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (24 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (17 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (33 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (26 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (27 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (28 resets) in 12 ms. (307 steps per ms) remains 13/15 properties
// Phase 1: matrix 316 rows 261 cols
[2024-06-02 18:10:23] [INFO ] Computed 3 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 38/57 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 139/196 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 18/214 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 175/389 variables, 99/162 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 113/502 variables, 59/221 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/502 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 49/551 variables, 27/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/551 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 23/574 variables, 13/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 16 (OVERLAPS) 3/577 variables, 3/264 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/577 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/577 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/577 variables, and 264 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 35/52 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 138/190 variables, 39/56 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 12/68 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 18/208 variables, 3/71 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 179/387 variables, 100/172 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 115/502 variables, 61/233 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 49/551 variables, 27/260 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/551 variables, 0/260 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 23/574 variables, 13/273 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/574 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 3/577 variables, 3/276 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/577 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 0/577 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/577 variables, and 276 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1258 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 2397ms problems are : Problem set: 1 solved, 12 unsolved
Parikh walk visited 7 properties in 3931 ms.
Support contains 8 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 316/316 transitions.
Graph (trivial) has 257 edges and 261 vertex of which 3 / 261 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 391 edges and 259 vertex of which 243 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 134 rules applied. Total rules applied 136 place count 243 transition count 165
Reduce places removed 120 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 123 rules applied. Total rules applied 259 place count 123 transition count 162
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 262 place count 120 transition count 162
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 262 place count 120 transition count 147
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 292 place count 105 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 297 place count 100 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 302 place count 100 transition count 142
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 302 place count 100 transition count 139
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 308 place count 97 transition count 139
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 312 place count 93 transition count 135
Iterating global reduction 3 with 4 rules applied. Total rules applied 316 place count 93 transition count 135
Performed 31 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 378 place count 62 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 62 transition count 95
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 386 place count 60 transition count 93
Iterating global reduction 4 with 2 rules applied. Total rules applied 388 place count 60 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 389 place count 60 transition count 92
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 390 place count 59 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 391 place count 59 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 392 place count 59 transition count 90
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 414 place count 48 transition count 91
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 421 place count 48 transition count 84
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 428 place count 41 transition count 70
Iterating global reduction 7 with 7 rules applied. Total rules applied 435 place count 41 transition count 70
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 440 place count 41 transition count 65
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 441 place count 40 transition count 62
Iterating global reduction 8 with 1 rules applied. Total rules applied 442 place count 40 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 443 place count 40 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 446 place count 40 transition count 58
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 453 place count 40 transition count 51
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 460 place count 33 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 461 place count 33 transition count 50
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 464 place count 33 transition count 50
Graph (complete) has 77 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 465 place count 32 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 466 place count 32 transition count 49
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 467 place count 32 transition count 49
Graph (complete) has 74 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 468 place count 31 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 469 place count 31 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 470 place count 30 transition count 47
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t67.t71.t280.t290 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 472 place count 27 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 472 place count 27 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 474 place count 26 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 475 place count 26 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 476 place count 26 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 478 place count 25 transition count 41
Applied a total of 478 rules in 93 ms. Remains 25 /261 variables (removed 236) and now considering 41/316 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 25/261 places, 41/316 transitions.
RANDOM walk for 30070 steps (6 resets) in 442 ms. (67 steps per ms) remains 0/5 properties
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2024-06-02 18:10:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:10:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:10:29] [INFO ] Input system was already deterministic with 316 transitions.
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 394 edges and 261 vertex of which 254 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 239 transition count 294
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 239 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 239 transition count 293
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 224 transition count 278
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 214 transition count 268
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 214 transition count 267
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 209 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 206 transition count 259
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 205 transition count 258
Applied a total of 114 rules in 20 ms. Remains 205 /261 variables (removed 56) and now considering 258/316 (removed 58) transitions.
// Phase 1: matrix 258 rows 205 cols
[2024-06-02 18:10:29] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:10:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:10:30] [INFO ] Invariant cache hit.
[2024-06-02 18:10:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:10:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:10:34] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 11 ms to minimize.
[2024-06-02 18:10:34] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10596 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 467 constraints, problems are : Problem set: 0 solved, 257 unsolved in 14095 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 24751ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24757ms
Starting structural reductions in LTL mode, iteration 1 : 205/261 places, 258/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24964 ms. Remains : 205/261 places, 258/316 transitions.
[2024-06-02 18:10:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:10:54] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:10:54] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:10:55] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:10:55] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:10:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality11853716074013707411.gal : 4 ms
[2024-06-02 18:10:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality13895788111420531636.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/CTLCardinality11853716074013707411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13895788111420531636.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,459604,0.113276,7384,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.124075,7384,1,0,6,13523,7,1,1269,14467,1
FORMULA CO4-PT-11-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 239 transition count 294
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 239 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 239 transition count 293
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 224 transition count 278
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 214 transition count 268
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 214 transition count 267
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 209 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 206 transition count 259
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 205 transition count 258
Applied a total of 114 rules in 29 ms. Remains 205 /261 variables (removed 56) and now considering 258/316 (removed 58) transitions.
[2024-06-02 18:10:55] [INFO ] Invariant cache hit.
[2024-06-02 18:10:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 18:10:55] [INFO ] Invariant cache hit.
[2024-06-02 18:10:55] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:10:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:10:59] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:10:59] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 467 constraints, problems are : Problem set: 0 solved, 257 unsolved in 14363 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 24557ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24560ms
Starting structural reductions in LTL mode, iteration 1 : 205/261 places, 258/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24811 ms. Remains : 205/261 places, 258/316 transitions.
[2024-06-02 18:11:20] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:11:20] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:20] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:11:20] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality13281942917669356771.gal : 3 ms
[2024-06-02 18:11:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality16902232774980844059.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/CTLCardinality13281942917669356771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16902232774980844059.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,459604,0.091034,7188,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,1,0.701983,32216,1,0,333,85279,531,219,5587,97951,522
FORMULA CO4-PT-11-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Graph (trivial) has 266 edges and 261 vertex of which 3 / 261 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 392 edges and 259 vertex of which 252 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 251 transition count 181
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 250 place count 127 transition count 181
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 250 place count 127 transition count 165
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 282 place count 111 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 286 place count 107 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 290 place count 107 transition count 161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 290 place count 107 transition count 158
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 296 place count 104 transition count 158
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 299 place count 101 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 302 place count 101 transition count 155
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 326 place count 89 transition count 143
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 2 with 4 rules applied. Total rules applied 330 place count 89 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 331 place count 88 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 334 place count 85 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 337 place count 85 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 346 place count 85 transition count 127
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 350 place count 85 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 354 place count 81 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 354 place count 81 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 356 place count 80 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 358 place count 79 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 360 place count 77 transition count 119
Applied a total of 360 rules in 36 ms. Remains 77 /261 variables (removed 184) and now considering 119/316 (removed 197) transitions.
// Phase 1: matrix 119 rows 77 cols
[2024-06-02 18:11:20] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:11:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 18:11:20] [INFO ] Invariant cache hit.
[2024-06-02 18:11:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 18:11:21] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 18:11:21] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-02 18:11:21] [INFO ] Invariant cache hit.
[2024-06-02 18:11:21] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 118/195 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 83 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2365 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 118/195 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 111/193 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 1/196 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-06-02 18:11:24] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 195 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3088 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 1/1 constraints]
After SMT, in 5487ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 5488ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/261 places, 119/316 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5776 ms. Remains : 77/261 places, 119/316 transitions.
[2024-06-02 18:11:26] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:26] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:11:26] [INFO ] Input system was already deterministic with 119 transitions.
[2024-06-02 18:11:26] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:11:26] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:11:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality617952590720406664.gal : 1 ms
[2024-06-02 18:11:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality12424342401838996027.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/CTLCardinality617952590720406664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12424342401838996027.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,14861,0.020974,4292,2,345,5,2448,6,0,418,2286,0


Converting to forward existential form...Done !
original formula: AF(AG(((AG(EF((p284!=0))) * (p8!=0)) * (p494!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(E(TRUE U !(E(TRUE U (p284!=0))))) * (p8!=0)) * (p494!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t17, t35, t40, t57, t104, t113, t114, t115, t116, t118, Intersection with re...234
(forward)formula 0,0,0.20522,13004,1,0,198,48300,264,99,2726,44124,286
FORMULA CO4-PT-11-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 243 transition count 298
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 243 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 243 transition count 297
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 229 transition count 283
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 229 transition count 283
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 73 place count 221 transition count 275
Iterating global reduction 1 with 8 rules applied. Total rules applied 81 place count 221 transition count 275
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 217 transition count 271
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 217 transition count 271
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 214 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 214 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 213 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 213 transition count 267
Applied a total of 97 rules in 10 ms. Remains 213 /261 variables (removed 48) and now considering 267/316 (removed 49) transitions.
// Phase 1: matrix 267 rows 213 cols
[2024-06-02 18:11:26] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:11:26] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:11:26] [INFO ] Invariant cache hit.
[2024-06-02 18:11:26] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-06-02 18:11:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 267/480 variables, 213/216 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 18:11:31] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:11:31] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 218 constraints, problems are : Problem set: 0 solved, 266 unsolved in 10773 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/480 variables, 213/218 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 266/484 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-06-02 18:11:44] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/480 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 0/480 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 485 constraints, problems are : Problem set: 0 solved, 266 unsolved in 21840 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 3/3 constraints]
After SMT, in 32647ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 32650ms
Starting structural reductions in LTL mode, iteration 1 : 213/261 places, 267/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32821 ms. Remains : 213/261 places, 267/316 transitions.
[2024-06-02 18:11:59] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:11:59] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:59] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-02 18:11:59] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:11:59] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:11:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality7516711600865217618.gal : 2 ms
[2024-06-02 18:11:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13614884942638178476.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/CTLCardinality7516711600865217618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13614884942638178476.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,520914,0.093414,7484,2,1362,5,14325,6,0,1117,15639,0


Converting to forward existential form...Done !
original formula: AG(EX(((AG((AF((p197==0)) * EF(((p496==0)||(p506==1))))) + AX(((p157==0)||(p412==1)))) + ((p215==0)&&(p305==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((!(E(TRUE U !((!(EG(!((p197==0)))) * E(TRUE U ((p496==0)||(p506==1))))))) + !(EX(!(((p...216
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t17, t23, t32, t33, t42, t44, t45, t46, t47, t48, t50, t53, t97...305
(forward)formula 0,0,1.4866,58564,1,0,618,234549,566,347,6262,254659,892
FORMULA CO4-PT-11-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 239 transition count 294
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 239 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 239 transition count 293
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 224 transition count 278
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 214 transition count 268
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 214 transition count 267
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 209 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 206 transition count 259
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 205 transition count 258
Applied a total of 114 rules in 11 ms. Remains 205 /261 variables (removed 56) and now considering 258/316 (removed 58) transitions.
// Phase 1: matrix 258 rows 205 cols
[2024-06-02 18:12:01] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 18:12:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 18:12:01] [INFO ] Invariant cache hit.
[2024-06-02 18:12:01] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:12:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:12:05] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
[2024-06-02 18:12:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 467 constraints, problems are : Problem set: 0 solved, 257 unsolved in 14377 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 24538ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24540ms
Starting structural reductions in LTL mode, iteration 1 : 205/261 places, 258/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24695 ms. Remains : 205/261 places, 258/316 transitions.
[2024-06-02 18:12:25] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:12:25] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:12:25] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:12:25] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:12:25] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:12:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality4314457288304842694.gal : 2 ms
[2024-06-02 18:12:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17056670423396105794.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/CTLCardinality4314457288304842694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17056670423396105794.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,459604,0.089378,7192,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EF(AG((EX(TRUE) + EX((p539==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EX(TRUE) + EX((p539==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,1,0.81388,40732,1,0,357,133679,537,233,5872,135923,552
FORMULA CO4-PT-11-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Graph (trivial) has 268 edges and 261 vertex of which 3 / 261 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 392 edges and 259 vertex of which 252 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 251 transition count 179
Reduce places removed 126 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 127 rules applied. Total rules applied 255 place count 125 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 124 transition count 178
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 256 place count 124 transition count 162
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 288 place count 108 transition count 162
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 293 place count 103 transition count 157
Iterating global reduction 3 with 5 rules applied. Total rules applied 298 place count 103 transition count 157
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 298 place count 103 transition count 154
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 304 place count 100 transition count 154
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 308 place count 96 transition count 150
Iterating global reduction 3 with 4 rules applied. Total rules applied 312 place count 96 transition count 150
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 336 place count 84 transition count 138
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 3 with 4 rules applied. Total rules applied 340 place count 84 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 83 transition count 134
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 344 place count 80 transition count 131
Iterating global reduction 5 with 3 rules applied. Total rules applied 347 place count 80 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 348 place count 80 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 357 place count 80 transition count 121
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 361 place count 80 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 365 place count 76 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 365 place count 76 transition count 116
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 367 place count 75 transition count 116
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 369 place count 74 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 371 place count 72 transition count 113
Applied a total of 371 rules in 25 ms. Remains 72 /261 variables (removed 189) and now considering 113/316 (removed 203) transitions.
// Phase 1: matrix 113 rows 72 cols
[2024-06-02 18:12:26] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:12:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:12:26] [INFO ] Invariant cache hit.
[2024-06-02 18:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:12:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-02 18:12:26] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-02 18:12:26] [INFO ] Invariant cache hit.
[2024-06-02 18:12:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 112/184 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 1/185 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 76 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 112/184 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 103/178 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 1/185 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 179 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1902 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 3513ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 3515ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/261 places, 113/316 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3624 ms. Remains : 72/261 places, 113/316 transitions.
[2024-06-02 18:12:30] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:30] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:30] [INFO ] Input system was already deterministic with 113 transitions.
[2024-06-02 18:12:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:12:30] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality17115091821678992426.gal : 1 ms
[2024-06-02 18:12:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality17139381478397678900.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/CTLCardinality17115091821678992426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17139381478397678900.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,11881,0.017877,3944,2,204,5,1926,6,0,393,1774,0


Converting to forward existential form...Done !
original formula: !(E(AG((p518==1)) U AF(AG((p315==0)))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((p518==1))))) * !(EG(!(!(E(TRUE U !((p315==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t15, t31, t36, t54, t110, Intersection with reachable at each step enabled. (destroyed/r...191
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.130055,8748,1,0,171,27286,261,98,2622,20756,272
FORMULA CO4-PT-11-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Graph (trivial) has 255 edges and 261 vertex of which 3 / 261 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 392 edges and 259 vertex of which 253 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 252 transition count 190
Reduce places removed 116 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 136 transition count 187
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 240 place count 133 transition count 187
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 240 place count 133 transition count 170
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 274 place count 116 transition count 170
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 279 place count 111 transition count 165
Iterating global reduction 3 with 5 rules applied. Total rules applied 284 place count 111 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 284 place count 111 transition count 163
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 288 place count 109 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 291 place count 106 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 294 place count 106 transition count 160
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 320 place count 93 transition count 147
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 3 with 3 rules applied. Total rules applied 323 place count 93 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 92 transition count 144
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 327 place count 89 transition count 141
Iterating global reduction 5 with 3 rules applied. Total rules applied 330 place count 89 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 331 place count 89 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 339 place count 89 transition count 132
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 341 place count 89 transition count 130
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 344 place count 87 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 345 place count 86 transition count 129
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 347 place count 85 transition count 128
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 349 place count 85 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 351 place count 83 transition count 126
Applied a total of 351 rules in 27 ms. Remains 83 /261 variables (removed 178) and now considering 126/316 (removed 190) transitions.
// Phase 1: matrix 126 rows 83 cols
[2024-06-02 18:12:30] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:12:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:12:30] [INFO ] Invariant cache hit.
[2024-06-02 18:12:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:12:30] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-06-02 18:12:30] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-06-02 18:12:30] [INFO ] Invariant cache hit.
[2024-06-02 18:12:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 125/208 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 1/209 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/209 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 87 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 125/208 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 116/202 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 1/209 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 203 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2435 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 4528ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 4530ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/261 places, 126/316 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4674 ms. Remains : 83/261 places, 126/316 transitions.
[2024-06-02 18:12:35] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:12:35] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:12:35] [INFO ] Input system was already deterministic with 126 transitions.
[2024-06-02 18:12:35] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:12:35] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:12:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9379101274686308931.gal : 1 ms
[2024-06-02 18:12:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14803351887261440635.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/CTLCardinality9379101274686308931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14803351887261440635.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,19345,0.024986,4324,2,246,5,2596,6,0,450,2482,0


Converting to forward existential form...Done !
original formula: EF((!(A(((p179==1)||(p162!=1)) U EG(((p447==0)||(p191==1))))) + ((p410==0) * AF(AG(((p313==0)||(p481==1)))))))
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,TRUE),!(EG(((p447==0)||(p191==1))))) * !(((p179==1)||(p162!=1)))) * !(EG(((p447==0)||(p191==...334
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t20, t37, t46, t63, Intersection with reachable at each step enabled. (destroyed/rev...189
(forward)formula 0,1,0.276818,16220,1,0,294,73471,279,163,2645,70087,441
FORMULA CO4-PT-11-CTLCardinality-2024-07 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 : 261/261 places, 316/316 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 242 transition count 297
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 242 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 242 transition count 296
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 230 transition count 284
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 230 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 70 place count 223 transition count 277
Iterating global reduction 1 with 7 rules applied. Total rules applied 77 place count 223 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 223 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 219 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 219 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 217 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 217 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 216 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 216 transition count 269
Applied a total of 92 rules in 11 ms. Remains 216 /261 variables (removed 45) and now considering 269/316 (removed 47) transitions.
// Phase 1: matrix 269 rows 216 cols
[2024-06-02 18:12:35] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:12:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:12:35] [INFO ] Invariant cache hit.
[2024-06-02 18:12:35] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-06-02 18:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 269/485 variables, 216/219 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-06-02 18:12:40] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:12:40] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:12:40] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/485 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 222 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11509 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/485 variables, 216/222 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 268/490 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 490 constraints, problems are : Problem set: 0 solved, 268 unsolved in 16739 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 3/3 constraints]
After SMT, in 28281ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 28283ms
Starting structural reductions in LTL mode, iteration 1 : 216/261 places, 269/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28464 ms. Remains : 216/261 places, 269/316 transitions.
[2024-06-02 18:13:04] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:13:04] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:13:04] [INFO ] Input system was already deterministic with 269 transitions.
[2024-06-02 18:13:04] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:04] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality14827092177301703380.gal : 2 ms
[2024-06-02 18:13:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9866726070433444762.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/CTLCardinality14827092177301703380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9866726070433444762.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,492892,0.096595,7484,2,1391,5,14479,6,0,1131,15508,0


Converting to forward existential form...Done !
original formula: AG(A(((p368==0)||(p384==1)) U EG(AX(((p158==0)||(p527==1))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(EG(!(EX(!(((p158==0)||(p527==1)))))))) * !(((p368==0)||(p384==1)))) * !(EG(!(EX(!(((p...264
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t24, t32, t41, t43, t44, t45, t46, t47, t49, t52, t100, t1...307
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.73852,231456,1,0,746,1.16086e+06,567,477,6334,1.41922e+06,940
FORMULA CO4-PT-11-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 241 transition count 296
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 241 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 241 transition count 295
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 229 transition count 283
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 229 transition count 283
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 220 transition count 274
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 220 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 220 transition count 273
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 215 transition count 268
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 215 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 213 transition count 266
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 213 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 212 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 212 transition count 265
Applied a total of 100 rules in 12 ms. Remains 212 /261 variables (removed 49) and now considering 265/316 (removed 51) transitions.
// Phase 1: matrix 265 rows 212 cols
[2024-06-02 18:13:10] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:13:10] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 18:13:10] [INFO ] Invariant cache hit.
[2024-06-02 18:13:11] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-06-02 18:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/477 variables, 212/215 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 217 constraints, problems are : Problem set: 0 solved, 264 unsolved in 10691 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/477 variables, 212/217 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 264/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 481 constraints, problems are : Problem set: 0 solved, 264 unsolved in 13020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 23750ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 23753ms
Starting structural reductions in LTL mode, iteration 1 : 212/261 places, 265/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23919 ms. Remains : 212/261 places, 265/316 transitions.
[2024-06-02 18:13:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:13:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:13:34] [INFO ] Input system was already deterministic with 265 transitions.
[2024-06-02 18:13:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:13:34] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:13:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality12100648566088030645.gal : 1 ms
[2024-06-02 18:13:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality10800569664171134059.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/CTLCardinality12100648566088030645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10800569664171134059.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,480100,0.094635,7468,2,1353,5,13894,6,0,1111,14799,0


Converting to forward existential form...Done !
original formula: EG((EF(((p118==1) * E((p388==1) U (p223==0)))) * AF(AX(((p184==0)||(p425==1))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((p118==1) * E((p388==1) U (p223==0)))) * !(EG(!(!(EX(!(((p184==0)||(p425==1))))))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t24, t32, t41, t43, t44, t45, t46, t47, t49, t52, t96, t15...300
Using saturation style SCC detection
(forward)formula 0,1,4.54986,174136,1,0,872,557027,570,569,6526,1.29233e+06,1017
FORMULA CO4-PT-11-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 239 transition count 294
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 239 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 239 transition count 293
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 224 transition count 278
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 214 transition count 268
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 214 transition count 267
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 209 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 206 transition count 259
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 205 transition count 258
Applied a total of 114 rules in 13 ms. Remains 205 /261 variables (removed 56) and now considering 258/316 (removed 58) transitions.
// Phase 1: matrix 258 rows 205 cols
[2024-06-02 18:13:39] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:13:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:13:39] [INFO ] Invariant cache hit.
[2024-06-02 18:13:39] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:13:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:13:43] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:13:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 467 constraints, problems are : Problem set: 0 solved, 257 unsolved in 13959 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 24216ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24218ms
Starting structural reductions in LTL mode, iteration 1 : 205/261 places, 258/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24402 ms. Remains : 205/261 places, 258/316 transitions.
[2024-06-02 18:14:03] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:14:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:14:03] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:14:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:14:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:14:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality18045570853877746562.gal : 2 ms
[2024-06-02 18:14:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality8495560720744553756.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/CTLCardinality18045570853877746562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8495560720744553756.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,459604,0.123161,7192,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: AF(AX(EF((p233==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(E(TRUE U (p233==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,1,1.18751,44468,1,0,365,161267,543,228,6031,168460,562
FORMULA CO4-PT-11-CTLCardinality-2024-11 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 : 261/261 places, 316/316 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 239 transition count 294
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 239 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 239 transition count 293
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 225 transition count 279
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 225 transition count 279
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 83 place count 215 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 93 place count 215 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 215 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 210 transition count 263
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 210 transition count 263
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 207 transition count 260
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 207 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 206 transition count 259
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 206 transition count 259
Applied a total of 112 rules in 14 ms. Remains 206 /261 variables (removed 55) and now considering 259/316 (removed 57) transitions.
// Phase 1: matrix 259 rows 206 cols
[2024-06-02 18:14:05] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:14:05] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:14:05] [INFO ] Invariant cache hit.
[2024-06-02 18:14:05] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-06-02 18:14:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/465 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-06-02 18:14:09] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:14:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 211 constraints, problems are : Problem set: 0 solved, 258 unsolved in 10335 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/465 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 258/469 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/465 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 469 constraints, problems are : Problem set: 0 solved, 258 unsolved in 14659 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints]
After SMT, in 25032ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 25035ms
Starting structural reductions in LTL mode, iteration 1 : 206/261 places, 259/316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25198 ms. Remains : 206/261 places, 259/316 transitions.
[2024-06-02 18:14:30] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:30] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:14:30] [INFO ] Input system was already deterministic with 259 transitions.
[2024-06-02 18:14:30] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:14:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:14:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7014837485418942221.gal : 1 ms
[2024-06-02 18:14:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11821070958743505703.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/CTLCardinality7014837485418942221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11821070958743505703.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,462532,0.090961,7456,2,1315,5,13602,6,0,1081,14545,0


Converting to forward existential form...Done !
original formula: AF(EX(AX((p223==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!((p223==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,0,2.80779,109628,1,0,608,352741,541,404,5753,765925,730
FORMULA CO4-PT-11-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 316/316 transitions.
Graph (complete) has 394 edges and 261 vertex of which 254 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 253 transition count 187
Reduce places removed 120 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 243 place count 133 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 245 place count 131 transition count 185
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 245 place count 131 transition count 168
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 279 place count 114 transition count 168
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 284 place count 109 transition count 163
Iterating global reduction 3 with 5 rules applied. Total rules applied 289 place count 109 transition count 163
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 289 place count 109 transition count 160
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 295 place count 106 transition count 160
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 299 place count 102 transition count 156
Iterating global reduction 3 with 4 rules applied. Total rules applied 303 place count 102 transition count 156
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 329 place count 89 transition count 143
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 3 with 4 rules applied. Total rules applied 333 place count 89 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 88 transition count 139
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 337 place count 85 transition count 136
Iterating global reduction 5 with 3 rules applied. Total rules applied 340 place count 85 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 341 place count 85 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 349 place count 85 transition count 127
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 353 place count 85 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 357 place count 81 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 357 place count 81 transition count 122
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 359 place count 80 transition count 122
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 361 place count 79 transition count 121
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 366 place count 79 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 368 place count 77 transition count 119
Applied a total of 368 rules in 21 ms. Remains 77 /261 variables (removed 184) and now considering 119/316 (removed 197) transitions.
// Phase 1: matrix 119 rows 77 cols
[2024-06-02 18:14:33] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:14:33] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 18:14:33] [INFO ] Invariant cache hit.
[2024-06-02 18:14:33] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-06-02 18:14:33] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-02 18:14:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 119/196 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 0/196 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 80 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 119/196 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 109/189 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 0/196 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 189 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 2923ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 2924ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/261 places, 119/316 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3037 ms. Remains : 77/261 places, 119/316 transitions.
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:14:36] [INFO ] Input system was already deterministic with 119 transitions.
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:14:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality5277082210530031119.gal : 1 ms
[2024-06-02 18:14:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality16460439827273720957.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/CTLCardinality5277082210530031119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16460439827273720957.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,12746,0.022998,4308,2,300,5,2774,6,0,422,2561,0


Converting to forward existential form...Done !
original formula: A(((p1==0)||(p309==1)) U AF(!(((p399==0)||(p286==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(((p399==0)||(p286==1)))))))))) * !(E(!(!(EG(!(!(((p399==0)||(p286==1))))))) U (!(((p1=...226
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t29, t34, t55, t110, Intersection with reachable at each step enabled. (destroyed/r...191
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.303229,16940,1,0,356,82616,268,246,2675,71406,559
FORMULA CO4-PT-11-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-06-02 18:14:36] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:14:36] [INFO ] Flatten gal took : 5 ms
Total runtime 255244 ms.

BK_STOP 1717352076567

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

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