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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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-10-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717351683186

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-06-02 18:08:04] [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:08:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:08:04] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-02 18:08:04] [INFO ] Transformed 544 places.
[2024-06-02 18:08:04] [INFO ] Transformed 615 transitions.
[2024-06-02 18:08:04] [INFO ] Found NUPN structural information;
[2024-06-02 18:08:04] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 157 places in 16 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA CO4-PT-10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 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 375 transition count 435
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 66 place count 324 transition count 382
Iterating global reduction 1 with 51 rules applied. Total rules applied 117 place count 324 transition count 382
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 156 place count 285 transition count 343
Iterating global reduction 1 with 39 rules applied. Total rules applied 195 place count 285 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 196 place count 285 transition count 342
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 213 place count 268 transition count 325
Iterating global reduction 2 with 17 rules applied. Total rules applied 230 place count 268 transition count 325
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 231 place count 268 transition count 324
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 239 place count 260 transition count 316
Iterating global reduction 3 with 8 rules applied. Total rules applied 247 place count 260 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 248 place count 260 transition count 315
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 251 place count 257 transition count 312
Iterating global reduction 4 with 3 rules applied. Total rules applied 254 place count 257 transition count 312
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 255 place count 256 transition count 311
Iterating global reduction 4 with 1 rules applied. Total rules applied 256 place count 256 transition count 311
Applied a total of 256 rules in 110 ms. Remains 256 /387 variables (removed 131) and now considering 311/438 (removed 127) transitions.
// Phase 1: matrix 311 rows 256 cols
[2024-06-02 18:08:04] [INFO ] Computed 4 invariants in 20 ms
[2024-06-02 18:08:04] [INFO ] Implicit Places using invariants in 250 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 255/387 places, 311/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 408 ms. Remains : 255/387 places, 311/438 transitions.
Support contains 41 out of 255 places after structural reductions.
[2024-06-02 18:08:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:08:05] [INFO ] Flatten gal took : 45 ms
FORMULA CO4-PT-10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:08:05] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:08:05] [INFO ] Input system was already deterministic with 311 transitions.
Support contains 34 out of 255 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (51 resets) in 1853 ms. (21 steps per ms) remains 15/23 properties
BEST_FIRST walk for 4002 steps (36 resets) in 45 ms. (87 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4000 steps (35 resets) in 37 ms. (105 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4000 steps (27 resets) in 33 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (29 resets) in 58 ms. (67 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (32 resets) in 27 ms. (142 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (30 resets) in 27 ms. (142 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4001 steps (38 resets) in 14 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (31 resets) in 27 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (34 resets) in 53 ms. (74 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (36 resets) in 20 ms. (190 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (21 resets) in 17 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (23 resets) in 19 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (34 resets) in 13 ms. (285 steps per ms) remains 12/12 properties
// Phase 1: matrix 311 rows 255 cols
[2024-06-02 18:08:06] [INFO ] Computed 3 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/49 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 119/168 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 191/359 variables, 90/138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 11/370 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 9/379 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 127/506 variables, 76/221 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 42/548 variables, 25/246 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/548 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 15/563 variables, 10/256 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/563 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 3/566 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 0/566 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 258 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 33/49 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 119/168 variables, 32/48 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 191/359 variables, 90/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 11/370 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 9/379 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 127/506 variables, 76/233 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/506 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 42/548 variables, 25/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 15/563 variables, 10/268 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/563 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 3/566 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/566 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 0/566 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 270 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 2377ms problems are : Problem set: 0 solved, 12 unsolved
Finished Parikh walk after 14894 steps, including 189 resets, run visited all 1 properties in 24 ms. (steps per millisecond=620 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 149 ms.
[2024-06-02 18:08:08] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:08:08] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:08:08] [INFO ] Input system was already deterministic with 311 transitions.
Computed a total of 12 stabilizing places and 14 stable transitions
Graph (complete) has 380 edges and 255 vertex of which 249 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Graph (trivial) has 264 edges and 255 vertex of which 3 / 255 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 378 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 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 122 place count 246 transition count 181
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 242 place count 126 transition count 181
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 242 place count 126 transition count 167
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 270 place count 112 transition count 167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 274 place count 108 transition count 163
Iterating global reduction 2 with 4 rules applied. Total rules applied 278 place count 108 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 278 place count 108 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 280 place count 107 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 281 place count 106 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 282 place count 106 transition count 161
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 322 place count 86 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 327 place count 86 transition count 135
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 331 place count 84 transition count 133
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 333 place count 82 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 335 place count 82 transition count 131
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 344 place count 82 transition count 122
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 348 place count 82 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 352 place count 78 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 352 place count 78 transition count 117
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 354 place count 77 transition count 117
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 356 place count 76 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 358 place count 74 transition count 114
Applied a total of 358 rules in 96 ms. Remains 74 /255 variables (removed 181) and now considering 114/311 (removed 197) transitions.
// Phase 1: matrix 114 rows 74 cols
[2024-06-02 18:08:08] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:08:08] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:08:08] [INFO ] Invariant cache hit.
[2024-06-02 18:08:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:08:08] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 18:08:08] [INFO ] Redundant transitions in 3 ms returned []
Running 104 sub problems to find dead transitions.
[2024-06-02 18:08:08] [INFO ] Invariant cache hit.
[2024-06-02 18:08:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/187 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/188 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 78 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/187 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 104/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/188 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 182 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3779ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3781ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/255 places, 114/311 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4084 ms. Remains : 74/255 places, 114/311 transitions.
[2024-06-02 18:08:12] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:08:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:08:12] [INFO ] Input system was already deterministic with 114 transitions.
[2024-06-02 18:08:12] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:08:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:08:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality9654861846187727977.gal : 3 ms
[2024-06-02 18:08:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality15414652574736603575.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9654861846187727977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15414652574736603575.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,15121,0.035041,4188,2,228,5,2580,6,0,402,2862,0


Converting to forward existential form...Done !
original formula: AF(EG(E(((p427==0)||(p308==1)) U (p432==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(((p427==0)||(p308==1)) U (p432==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t23, t43, t48, t78, t111, 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.227653,12888,1,0,267,55817,259,166,2529,51896,364
FORMULA CO4-PT-10-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 235 transition count 291
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 235 transition count 291
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 235 transition count 290
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 224 transition count 279
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 224 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 224 transition count 278
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 217 transition count 271
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 217 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 217 transition count 270
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 85 place count 211 transition count 264
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 211 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 211 transition count 263
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 209 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 209 transition count 261
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 208 transition count 260
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 208 transition count 260
Applied a total of 98 rules in 28 ms. Remains 208 /255 variables (removed 47) and now considering 260/311 (removed 51) transitions.
// Phase 1: matrix 260 rows 208 cols
[2024-06-02 18:08:13] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:08:13] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 18:08:13] [INFO ] Invariant cache hit.
[2024-06-02 18:08:13] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-06-02 18:08:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 260/468 variables, 208/211 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-06-02 18:08:17] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 11 ms to minimize.
[2024-06-02 18:08:17] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 0/468 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 213 constraints, problems are : Problem set: 0 solved, 259 unsolved in 11163 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/468 variables, 208/213 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 259/472 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 0/468 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 472 constraints, problems are : Problem set: 0 solved, 259 unsolved in 12711 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 2/2 constraints]
After SMT, in 23919ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 23928ms
Starting structural reductions in LTL mode, iteration 1 : 208/255 places, 260/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24156 ms. Remains : 208/255 places, 260/311 transitions.
[2024-06-02 18:08:37] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:08:37] [INFO ] Flatten gal took : 38 ms
[2024-06-02 18:08:37] [INFO ] Input system was already deterministic with 260 transitions.
[2024-06-02 18:08:37] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:08:37] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:08:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality15466217950405267103.gal : 5 ms
[2024-06-02 18:08:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality111871028840589490.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/CTLCardinality15466217950405267103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality111871028840589490.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,485328,0.117981,7980,2,1918,5,16230,6,0,1090,18875,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(((p432==0)||(p222==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(((p432==0)||(p222==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t11, t12, t13, t14, t15, t17, t21, t29, t38, t40, t41, t42, t43, t44, t46, t49, t51,...396
(forward)formula 0,0,1.38548,50176,1,0,405,146633,542,231,5833,202529,551
FORMULA CO4-PT-10-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 235 transition count 291
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 235 transition count 291
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 235 transition count 290
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 223 transition count 278
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 223 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 223 transition count 277
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 217 transition count 271
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 217 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 217 transition count 270
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 212 transition count 265
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 212 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 212 transition count 264
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 92 place count 210 transition count 262
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 210 transition count 262
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 209 transition count 261
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 209 transition count 261
Applied a total of 96 rules in 20 ms. Remains 209 /255 variables (removed 46) and now considering 261/311 (removed 50) transitions.
// Phase 1: matrix 261 rows 209 cols
[2024-06-02 18:08:38] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 18:08:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 18:08:38] [INFO ] Invariant cache hit.
[2024-06-02 18:08:38] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-06-02 18:08:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 261/470 variables, 209/212 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 18:08:43] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
[2024-06-02 18:08:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:08:43] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 215 constraints, problems are : Problem set: 0 solved, 260 unsolved in 10671 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/470 variables, 209/215 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 260/475 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/470 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 475 constraints, problems are : Problem set: 0 solved, 260 unsolved in 14562 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints]
After SMT, in 25274ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 25278ms
Starting structural reductions in LTL mode, iteration 1 : 209/255 places, 261/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25472 ms. Remains : 209/255 places, 261/311 transitions.
[2024-06-02 18:09:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:09:04] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:09:04] [INFO ] Input system was already deterministic with 261 transitions.
[2024-06-02 18:09:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:04] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12124368584982648060.gal : 2 ms
[2024-06-02 18:09:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7022858525891969058.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/CTLCardinality12124368584982648060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7022858525891969058.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,391684,0.096394,7460,2,1503,5,14059,6,0,1095,14888,0


Converting to forward existential form...Done !
original formula: AG((AX(EF((p441==1))) + (p225==0)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((p225==0)))) * !(E(TRUE U (p441==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t13, t14, t15, t16, t18, t22, t30, t41, t43, t44, t45, t48, t51, t95, t129, t141, t...326
(forward)formula 0,0,1.02871,41736,1,0,352,108444,545,228,6008,109030,534
FORMULA CO4-PT-10-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Graph (trivial) has 267 edges and 255 vertex of which 3 / 255 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 378 edges and 253 vertex of which 247 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 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 246 transition count 179
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 246 place count 124 transition count 179
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 246 place count 124 transition count 165
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 274 place count 110 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 278 place count 106 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 282 place count 106 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 282 place count 106 transition count 159
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 286 place count 104 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 287 place count 103 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 288 place count 103 transition count 158
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 326 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 331 place count 84 transition count 133
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 335 place count 82 transition count 131
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 337 place count 80 transition count 129
Iterating global reduction 4 with 2 rules applied. Total rules applied 339 place count 80 transition count 129
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 348 place count 80 transition count 120
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 352 place count 80 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 356 place count 76 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 356 place count 76 transition count 115
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 75 transition count 115
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 360 place count 74 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 74 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 363 place count 72 transition count 112
Applied a total of 363 rules in 28 ms. Remains 72 /255 variables (removed 183) and now considering 112/311 (removed 199) transitions.
// Phase 1: matrix 112 rows 72 cols
[2024-06-02 18:09:05] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 18:09:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 18:09:05] [INFO ] Invariant cache hit.
[2024-06-02 18:09:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:05] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-02 18:09:05] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2024-06-02 18:09:05] [INFO ] Invariant cache hit.
[2024-06-02 18:09:05] [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, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 76 constraints, problems are : Problem set: 0 solved, 102 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 111/183 variables, 72/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 102/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 178 constraints, problems are : Problem set: 0 solved, 102 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 3564ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 3565ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/255 places, 112/311 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3693 ms. Remains : 72/255 places, 112/311 transitions.
[2024-06-02 18:09:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:09:09] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:09:09] [INFO ] Input system was already deterministic with 112 transitions.
[2024-06-02 18:09:09] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:09:09] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:09:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality652698573642853631.gal : 1 ms
[2024-06-02 18:09:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality8537079771982938240.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/CTLCardinality652698573642853631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8537079771982938240.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG(EF(((p302==0)&&(p505==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U ((p302==0)&&(p505==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t19, t38, t43, t73, t107, 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.18016,11120,1,0,229,44250,256,169,2620,36601,366
FORMULA CO4-PT-10-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 233 transition count 289
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 233 transition count 289
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 233 transition count 288
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 220 transition count 275
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 220 transition count 274
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 79 place count 213 transition count 267
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 213 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 213 transition count 266
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 207 transition count 260
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 207 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 207 transition count 259
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 205 transition count 257
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 205 transition count 257
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 204 transition count 256
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 204 transition count 256
Applied a total of 106 rules in 11 ms. Remains 204 /255 variables (removed 51) and now considering 256/311 (removed 55) transitions.
// Phase 1: matrix 256 rows 204 cols
[2024-06-02 18:09:09] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 18:09:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:09:09] [INFO ] Invariant cache hit.
[2024-06-02 18:09:09] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2024-06-02 18:09:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/460 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 18:09:13] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:09:13] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 209 constraints, problems are : Problem set: 0 solved, 255 unsolved in 10116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/460 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 255/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 464 constraints, problems are : Problem set: 0 solved, 255 unsolved in 14662 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints]
After SMT, in 24815ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 24819ms
Starting structural reductions in LTL mode, iteration 1 : 204/255 places, 256/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24995 ms. Remains : 204/255 places, 256/311 transitions.
[2024-06-02 18:09:34] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:09:34] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:09:34] [INFO ] Input system was already deterministic with 256 transitions.
[2024-06-02 18:09:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:09:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:09:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3912762583071306005.gal : 2 ms
[2024-06-02 18:09:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15375151036827202268.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/CTLCardinality3912762583071306005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15375151036827202268.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,377704,0.090944,7392,2,1304,5,13498,6,0,1070,14450,0


Converting to forward existential form...Done !
original formula: AX(AG(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t46, t49, t93, t148, t1...295
(forward)formula 0,0,0.812353,33972,1,0,330,88761,528,217,6004,109407,521
FORMULA CO4-PT-10-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Graph (trivial) has 259 edges and 255 vertex of which 3 / 255 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 378 edges and 253 vertex of which 247 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 246 transition count 185
Reduce places removed 116 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 117 rules applied. Total rules applied 235 place count 130 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 236 place count 129 transition count 184
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 236 place count 129 transition count 169
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 266 place count 114 transition count 169
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 270 place count 110 transition count 165
Iterating global reduction 3 with 4 rules applied. Total rules applied 274 place count 110 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 274 place count 110 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 109 transition count 164
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 314 place count 90 transition count 144
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 317 place count 90 transition count 141
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 319 place count 89 transition count 140
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 321 place count 87 transition count 138
Iterating global reduction 5 with 2 rules applied. Total rules applied 323 place count 87 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 332 place count 87 transition count 129
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 5 with 4 rules applied. Total rules applied 336 place count 87 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 340 place count 83 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 342 place count 82 transition count 124
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 344 place count 82 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 345 place count 82 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 347 place count 80 transition count 121
Applied a total of 347 rules in 35 ms. Remains 80 /255 variables (removed 175) and now considering 121/311 (removed 190) transitions.
// Phase 1: matrix 121 rows 80 cols
[2024-06-02 18:09:35] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:09:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 18:09:35] [INFO ] Invariant cache hit.
[2024-06-02 18:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:09:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-02 18:09:35] [INFO ] Redundant transitions in 3 ms returned []
Running 111 sub problems to find dead transitions.
[2024-06-02 18:09:35] [INFO ] Invariant cache hit.
[2024-06-02 18:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 120/200 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 1/201 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/201 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 84 constraints, problems are : Problem set: 0 solved, 111 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 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/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 120/200 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 111/194 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 1/201 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 195 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 4282ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 4284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/255 places, 121/311 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4432 ms. Remains : 80/255 places, 121/311 transitions.
[2024-06-02 18:09:39] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:09:39] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:09:39] [INFO ] Input system was already deterministic with 121 transitions.
[2024-06-02 18:09:39] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:09:39] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:09:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality2800123316743590817.gal : 1 ms
[2024-06-02 18:09:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality11257657016740668089.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/CTLCardinality2800123316743590817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11257657016740668089.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,13177,0.022721,4304,2,239,5,2556,6,0,433,2466,0


Converting to forward existential form...Done !
original formula: EF(((EF((p304==0)) * AF(E((p133==0) U (p443==1)))) * (AG((p313==1)) * (p314==1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (E(TRUE U (p304==0)) * !(EG(!(E((p133==0) U (p443==1))))))) * (p314==1)) * !(E(TRUE U !((p...176
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t23, t46, t51, t83, Intersection with reachable at each step enabled. (destroyed/re...190
(forward)formula 0,0,0.104949,8264,1,0,158,23712,263,85,2586,17100,251
FORMULA CO4-PT-10-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 234 transition count 290
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 234 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 234 transition count 289
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 222 transition count 277
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 222 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 68 place count 222 transition count 276
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 215 transition count 269
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 215 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 215 transition count 268
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 209 transition count 262
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 209 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 209 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 207 transition count 259
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 207 transition count 259
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 206 transition count 258
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 206 transition count 258
Applied a total of 102 rules in 11 ms. Remains 206 /255 variables (removed 49) and now considering 258/311 (removed 53) transitions.
// Phase 1: matrix 258 rows 206 cols
[2024-06-02 18:09:39] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 18:09:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:09:39] [INFO ] Invariant cache hit.
[2024-06-02 18:09:39] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 18:09:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/464 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 18:09:44] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:09:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 211 constraints, problems are : Problem set: 0 solved, 257 unsolved in 10413 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 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/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/464 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 257/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 13230 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints]
After SMT, in 23676ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 23680ms
Starting structural reductions in LTL mode, iteration 1 : 206/255 places, 258/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23858 ms. Remains : 206/255 places, 258/311 transitions.
[2024-06-02 18:10:03] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:10:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:03] [INFO ] Input system was already deterministic with 258 transitions.
[2024-06-02 18:10:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:03] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality13306398565420054639.gal : 2 ms
[2024-06-02 18:10:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality4427392702357617467.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/CTLCardinality13306398565420054639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4427392702357617467.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,404080,0.148721,7456,2,1314,5,13665,6,0,1080,14594,0


Converting to forward existential form...Done !
original formula: AX(AG(((p477==0) * EX(TRUE))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !((p477==0)))] = FALSE * [(FwdU(EY(Init),TRUE) * !(EX(TRUE)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t39, t40, t42, t43, t44, t45, t46, t48, t51, t95, t15...300
(forward)formula 0,0,0.945054,34460,1,0,334,90063,532,219,6058,111495,525
FORMULA CO4-PT-10-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Graph (trivial) has 258 edges and 255 vertex of which 3 / 255 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 378 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 117 place count 246 transition count 186
Reduce places removed 115 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 131 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 236 place count 129 transition count 184
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 236 place count 129 transition count 170
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 264 place count 115 transition count 170
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 269 place count 110 transition count 165
Iterating global reduction 3 with 5 rules applied. Total rules applied 274 place count 110 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 274 place count 110 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 278 place count 108 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 107 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 107 transition count 162
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 316 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 321 place count 89 transition count 138
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 325 place count 87 transition count 136
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 327 place count 85 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 329 place count 85 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 337 place count 85 transition count 126
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 340 place count 85 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 343 place count 82 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 343 place count 82 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 345 place count 81 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 7 with 2 rules applied. Total rules applied 347 place count 80 transition count 121
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 348 place count 80 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 350 place count 78 transition count 119
Applied a total of 350 rules in 34 ms. Remains 78 /255 variables (removed 177) and now considering 119/311 (removed 192) transitions.
// Phase 1: matrix 119 rows 78 cols
[2024-06-02 18:10:04] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:10:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:10:04] [INFO ] Invariant cache hit.
[2024-06-02 18:10:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:10:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-02 18:10:04] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-06-02 18:10:04] [INFO ] Invariant cache hit.
[2024-06-02 18:10:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 118/196 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 1/197 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 83 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 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/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 118/196 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 109/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1/197 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 192 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2259 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 4307ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 4308ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/255 places, 119/311 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4439 ms. Remains : 78/255 places, 119/311 transitions.
[2024-06-02 18:10:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:09] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:10:09] [INFO ] Input system was already deterministic with 119 transitions.
[2024-06-02 18:10:09] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:10:09] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:10:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality14996350539198183115.gal : 1 ms
[2024-06-02 18:10:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality1760362331234354138.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/CTLCardinality14996350539198183115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1760362331234354138.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,10981,0.021092,3972,2,232,5,2252,6,0,423,2112,0


Converting to forward existential form...Done !
original formula: (AG((((EG((p128!=0)) * ((p129==0)||(p139==1))) * (p415==0)) + AF((p143==0)))) * EF((p473!=0)))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(((EG((p128!=0)) * ((p129==0)||(p139==1))) * (p415==0)))),!((p143==0)))] = FALSE * [(...195
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t22, t40, t45, t80, Intersection with reachable at each step enabled. (destroyed/re...190
Hit Full ! (commute/partial/dont) 117/0/2
(forward)formula 0,0,0.135185,9568,1,0,204,32241,276,110,2797,24891,335
FORMULA CO4-PT-10-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Graph (trivial) has 267 edges and 255 vertex of which 3 / 255 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 378 edges and 253 vertex of which 247 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 246 transition count 180
Reduce places removed 121 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 122 rules applied. Total rules applied 245 place count 125 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 246 place count 124 transition count 179
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 246 place count 124 transition count 165
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 274 place count 110 transition count 165
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 279 place count 105 transition count 160
Iterating global reduction 3 with 5 rules applied. Total rules applied 284 place count 105 transition count 160
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 105 transition count 158
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 103 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 289 place count 102 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 290 place count 102 transition count 157
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 328 place count 83 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 333 place count 83 transition count 132
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 337 place count 81 transition count 130
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 339 place count 79 transition count 128
Iterating global reduction 5 with 2 rules applied. Total rules applied 341 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 350 place count 79 transition count 119
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 5 with 4 rules applied. Total rules applied 354 place count 79 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 358 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 358 place count 75 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 360 place count 74 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 362 place count 73 transition count 113
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 366 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 368 place count 71 transition count 111
Applied a total of 368 rules in 22 ms. Remains 71 /255 variables (removed 184) and now considering 111/311 (removed 200) transitions.
// Phase 1: matrix 111 rows 71 cols
[2024-06-02 18:10:09] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 18:10:09] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 18:10:09] [INFO ] Invariant cache hit.
[2024-06-02 18:10:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:10:09] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-02 18:10:09] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-02 18:10:09] [INFO ] Invariant cache hit.
[2024-06-02 18:10:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1598 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 3541ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 3542ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/255 places, 111/311 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3663 ms. Remains : 71/255 places, 111/311 transitions.
[2024-06-02 18:10:12] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:12] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:10:12] [INFO ] Input system was already deterministic with 111 transitions.
[2024-06-02 18:10:12] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:10:12] [INFO ] Flatten gal took : 2 ms
[2024-06-02 18:10:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality14495459571940052863.gal : 1 ms
[2024-06-02 18:10:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality15653749784272961603.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/CTLCardinality14495459571940052863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15653749784272961603.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,8911,0.024489,3940,2,227,5,2263,6,0,387,1993,0


Converting to forward existential form...Done !
original formula: AG(EF((p381==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p381==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t17, t33, t38, t69, t103, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,0,0.09801,7424,1,0,152,20710,242,78,2359,15073,231
FORMULA CO4-PT-10-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 311/311 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 240 transition count 296
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 240 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 31 place count 240 transition count 295
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 231 transition count 286
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 231 transition count 286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 231 transition count 285
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 226 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 226 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 226 transition count 279
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 65 place count 222 transition count 275
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 222 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 222 transition count 274
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 221 transition count 273
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 221 transition count 273
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 220 transition count 272
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 220 transition count 272
Applied a total of 74 rules in 19 ms. Remains 220 /255 variables (removed 35) and now considering 272/311 (removed 39) transitions.
// Phase 1: matrix 272 rows 220 cols
[2024-06-02 18:10:12] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 18:10:13] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 18:10:13] [INFO ] Invariant cache hit.
[2024-06-02 18:10:13] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-06-02 18:10:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 272/492 variables, 220/223 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-06-02 18:10:17] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:10:17] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/492 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/492 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 225 constraints, problems are : Problem set: 0 solved, 271 unsolved in 11508 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/492 variables, 220/225 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/492 variables, 271/496 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 496 constraints, problems are : Problem set: 0 solved, 271 unsolved in 15414 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 2/2 constraints]
After SMT, in 26984ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 26987ms
Starting structural reductions in LTL mode, iteration 1 : 220/255 places, 272/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27159 ms. Remains : 220/255 places, 272/311 transitions.
[2024-06-02 18:10:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:40] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:10:40] [INFO ] Input system was already deterministic with 272 transitions.
[2024-06-02 18:10:40] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:40] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:10:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality3670708030514219779.gal : 2 ms
[2024-06-02 18:10:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality12701604976937508551.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/CTLCardinality3670708030514219779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12701604976937508551.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,416200,0.210817,11720,2,1416,5,28486,6,0,1149,40489,0


Converting to forward existential form...Done !
original formula: E(!(E((((p213==0)&&(p325==1)) * (((p162==1)||(p128==0)) * AF((p353==1)))) U (AG((((p179==1)||(p385==0))||(p413==1))) + !(((((p300==1)||(p...242
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,!(E((((p213==0)&&(p325==1)) * (((p162==1)||(p128==0)) * !(EG(!((p353==1)))))) U (!(E(TRUE U...316
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t23, t31, t40, t42, t43, t44, t45, t46, t48, t51, t101, t157, t...296
(forward)formula 0,1,13.1705,461676,1,0,1016,2.84178e+06,589,590,7101,2.93696e+06,1310
FORMULA CO4-PT-10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-06-02 18:10:53] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:53] [INFO ] Flatten gal took : 7 ms
Total runtime 169142 ms.

BK_STOP 1717351853507

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

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