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.r092-tall-171624189700641.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 DES-PT-02b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189700641
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 08:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 08:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 08:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 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 DES-PT-02b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-02b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-02b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-02b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-02b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-02b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716337776173

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 00:29:37] [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-05-22 00:29:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:29:37] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-22 00:29:37] [INFO ] Transformed 288 places.
[2024-05-22 00:29:37] [INFO ] Transformed 239 transitions.
[2024-05-22 00:29:37] [INFO ] Found NUPN structural information;
[2024-05-22 00:29:37] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA DES-PT-02b-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 287 transition count 239
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 275 transition count 227
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 275 transition count 227
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 270 transition count 222
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 270 transition count 222
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 270 transition count 217
Applied a total of 40 rules in 63 ms. Remains 270 /288 variables (removed 18) and now considering 217/239 (removed 22) transitions.
// Phase 1: matrix 217 rows 270 cols
[2024-05-22 00:29:37] [INFO ] Computed 64 invariants in 23 ms
[2024-05-22 00:29:37] [INFO ] Implicit Places using invariants in 292 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 320 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 269/288 places, 217/239 transitions.
Applied a total of 0 rules in 6 ms. Remains 269 /269 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 411 ms. Remains : 269/288 places, 217/239 transitions.
Support contains 75 out of 269 places after structural reductions.
[2024-05-22 00:29:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 00:29:38] [INFO ] Flatten gal took : 45 ms
FORMULA DES-PT-02b-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:29:38] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:29:38] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 71 out of 269 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (340 resets) in 1663 ms. (24 steps per ms) remains 3/41 properties
BEST_FIRST walk for 40003 steps (48 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (55 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (45 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
// Phase 1: matrix 217 rows 269 cols
[2024-05-22 00:29:38] [INFO ] Computed 63 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 139/195 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 60/255 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/262 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 210/472 variables, 262/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/478 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/478 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/482 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/484 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/486 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/486 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/486 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 332 constraints, problems are : Problem set: 0 solved, 3 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 139/195 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 60/255 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
[2024-05-22 00:29:39] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/262 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 210/472 variables, 262/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:29:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/478 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/482 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/484 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/486 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/486 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/486 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 348 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints]
After SMT, in 1628ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 845 ms.
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 217/217 transitions.
Graph (complete) has 486 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 264 transition count 192
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 41 place count 245 transition count 192
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 245 transition count 182
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 235 transition count 182
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 223 transition count 170
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 223 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 223 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 223 transition count 167
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 89 place count 222 transition count 167
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 96 place count 215 transition count 160
Iterating global reduction 3 with 7 rules applied. Total rules applied 103 place count 215 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 8 rules applied. Total rules applied 111 place count 215 transition count 152
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 114 place count 213 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 114 place count 213 transition count 149
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 118 place count 211 transition count 149
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 262 place count 139 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 266 place count 137 transition count 79
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 137 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 136 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 135 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 270 place count 134 transition count 77
Applied a total of 270 rules in 64 ms. Remains 134 /269 variables (removed 135) and now considering 77/217 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 134/269 places, 77/217 transitions.
RANDOM walk for 40000 steps (1659 resets) in 863 ms. (46 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (312 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (355 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (312 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 2050695 steps, run timeout after 3001 ms. (steps per millisecond=683 ) properties seen :2 out of 3
Probabilistic random walk after 2050695 steps, saw 293706 distinct states, run finished after 3006 ms. (steps per millisecond=682 ) properties seen :2
// Phase 1: matrix 77 rows 134 cols
[2024-05-22 00:29:44] [INFO ] Computed 63 invariants in 6 ms
[2024-05-22 00:29:44] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/73 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/111 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/123 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/126 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/201 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/211 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/211 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/73 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/111 variables, 27/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/123 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/126 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 75/201 variables, 126/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/211 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/211 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/211 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 134/134 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 213ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 77/77 transitions.
Graph (complete) has 399 edges and 134 vertex of which 130 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 129 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 128 transition count 74
Applied a total of 5 rules in 15 ms. Remains 128 /134 variables (removed 6) and now considering 74/77 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 128/134 places, 74/77 transitions.
RANDOM walk for 40000 steps (1856 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (316 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2276584 steps, run timeout after 3001 ms. (steps per millisecond=758 ) properties seen :0 out of 1
Probabilistic random walk after 2276584 steps, saw 324245 distinct states, run finished after 3001 ms. (steps per millisecond=758 ) properties seen :0
// Phase 1: matrix 74 rows 128 cols
[2024-05-22 00:29:48] [INFO ] Computed 60 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/69 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/99 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/111 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/114 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 68/182 variables, 114/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 13/195 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/195 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/195 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/197 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/197 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/197 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/201 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/201 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/201 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/202 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/202 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/202 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/69 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 30/99 variables, 23/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/111 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/114 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/182 variables, 114/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 13/195 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/195 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/195 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/197 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/197 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/197 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/201 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/201 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/201 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/202 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/202 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/202 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 74/74 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 128/128 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 74/74 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-22 00:29:48] [INFO ] Invariant cache hit.
[2024-05-22 00:29:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 00:29:48] [INFO ] Invariant cache hit.
[2024-05-22 00:29:48] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-22 00:29:48] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-22 00:29:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/125 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 2/127 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 74/201 variables, 127/194 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 1/202 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/202 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 15 (OVERLAPS) 0/202 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 196 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3338 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/125 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 2/127 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 74/201 variables, 127/195 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 70/265 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 1/202 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/202 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 16 (OVERLAPS) 0/202 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 270 constraints, problems are : Problem set: 0 solved, 70 unsolved in 9795 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 12/12 constraints]
After SMT, in 13156ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 13158ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13380 ms. Remains : 128/128 places, 74/74 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 74
Applied a total of 1 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 128 cols
[2024-05-22 00:30:01] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:30:02] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:30:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2024-05-22 00:30:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 4 ms returned sat
[2024-05-22 00:30:02] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
TRAPS : Iteration 1
[2024-05-22 00:30:02] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:30:02] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 258 ms.
[2024-05-22 00:30:02] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:30:02] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:30:02] [INFO ] Input system was already deterministic with 217 transitions.
Computed a total of 72 stabilizing places and 64 stable transitions
Graph (complete) has 486 edges and 269 vertex of which 260 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 253 transition count 203
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 253 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 253 transition count 201
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 39 place count 246 transition count 194
Iterating global reduction 2 with 7 rules applied. Total rules applied 46 place count 246 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 50 place count 246 transition count 190
Applied a total of 50 rules in 19 ms. Remains 246 /269 variables (removed 23) and now considering 190/217 (removed 27) transitions.
// Phase 1: matrix 190 rows 246 cols
[2024-05-22 00:30:02] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 00:30:02] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 00:30:02] [INFO ] Invariant cache hit.
[2024-05-22 00:30:02] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-22 00:30:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/246 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/436 variables, 246/307 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 5 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:30:09] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 9/322 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:10] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:30:10] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:30:10] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:30:10] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:30:10] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:30:10] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:30:10] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:30:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:30:11] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 9/331 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:17] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:30:17] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/436 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:30:20] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:22] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/436 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:25] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/436 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/436 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 18 (OVERLAPS) 0/436 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 352 constraints, problems are : Problem set: 0 solved, 189 unsolved in 27792 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/246 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 45/106 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:30:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 7/113 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-05-22 00:30:32] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:30:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:30:34] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:30:35] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (OVERLAPS) 190/436 variables, 246/371 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 189/560 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:39] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:30:40] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:30:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:30:50] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:30:51] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2024-05-22 00:30:55] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 567 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 71/71 constraints]
After SMT, in 57838ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 57841ms
Starting structural reductions in LTL mode, iteration 1 : 246/269 places, 190/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58144 ms. Remains : 246/269 places, 190/217 transitions.
[2024-05-22 00:31:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:31:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:31:00] [INFO ] Input system was already deterministic with 190 transitions.
[2024-05-22 00:31:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:31:00] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:31:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17072382709364012564.gal : 3 ms
[2024-05-22 00:31:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality12808202091321562301.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/CTLCardinality17072382709364012564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12808202091321562301.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.
Detected timeout of ITS tools.
[2024-05-22 00:31:30] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:31:30] [INFO ] Applying decomposition
[2024-05-22 00:31:30] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17686939986545583969.txt' '-o' '/tmp/graph17686939986545583969.bin' '-w' '/tmp/graph17686939986545583969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17686939986545583969.bin' '-l' '-1' '-v' '-w' '/tmp/graph17686939986545583969.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:31:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:31:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:31:30] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 00:31:30] [INFO ] Flatten gal took : 92 ms
[2024-05-22 00:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 15 ms.
[2024-05-22 00:31:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality4033258789227117651.gal : 17 ms
[2024-05-22 00:31:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1736609034121990898.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/CTLCardinality4033258789227117651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1736609034121990898.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83894e+17,0.695015,32152,3521,86,60113,759,641,128772,90,2536,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(AF(((i6.u31.p123==0)&&(i3.u12.p41==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(!(EG(!(((i6.u31.p123==0)&&(i3.u12.p41==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t89, t140, t150, t151, t183, i0.u80.t17, i1.u35.t79, i2.u15.t114, i2.u17.t111, i3.u1...758
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 251 transition count 201
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 251 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 251 transition count 199
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 242 transition count 190
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 242 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 241 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 241 transition count 182
Applied a total of 63 rules in 17 ms. Remains 241 /269 variables (removed 28) and now considering 182/217 (removed 35) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-22 00:32:00] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 00:32:01] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-22 00:32:01] [INFO ] Invariant cache hit.
[2024-05-22 00:32:01] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:32:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:32:03] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:32:04] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:32:05] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:32:05] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:07] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:32:07] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:32:07] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:32:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:32:07] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:32:08] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:32:10] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 2 ms to minimize.
[2024-05-22 00:32:11] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:32:13] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:32:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:16] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:32:17] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:32:18] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:32:20] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:32:21] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24304 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:32:27] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:28] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:29] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:32:30] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 54333ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54335ms
Starting structural reductions in LTL mode, iteration 1 : 241/269 places, 182/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54774 ms. Remains : 241/269 places, 182/217 transitions.
[2024-05-22 00:32:55] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:32:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:32:55] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-22 00:32:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:32:55] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:32:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality10300777576441503142.gal : 2 ms
[2024-05-22 00:32:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality11671372677649782199.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/CTLCardinality10300777576441503142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11671372677649782199.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.
Detected timeout of ITS tools.
[2024-05-22 00:33:25] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:33:25] [INFO ] Applying decomposition
[2024-05-22 00:33:25] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10477430430532931550.txt' '-o' '/tmp/graph10477430430532931550.bin' '-w' '/tmp/graph10477430430532931550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10477430430532931550.bin' '-l' '-1' '-v' '-w' '/tmp/graph10477430430532931550.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:33:25] [INFO ] Decomposing Gal with order
[2024-05-22 00:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:33:25] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:33:25] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:33:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 00:33:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality11051506326562112409.gal : 4 ms
[2024-05-22 00:33:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality15307227626992687274.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/CTLCardinality11051506326562112409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15307227626992687274.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.045e+17,1.02168,43124,3871,89,75792,646,697,197040,89,1978,0


Converting to forward existential form...Done !
original formula: AX((i4.i1.u29.p125==1))
=> equivalent forward existential formula: [(EY(Init) * !((i4.i1.u29.p125==1)))] = FALSE
(forward)formula 0,0,1.04302,43388,1,0,75792,646,879,197040,102,1978,2163
FORMULA DES-PT-02b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Graph (complete) has 486 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 263 transition count 196
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 247 transition count 196
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 247 transition count 186
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 237 transition count 186
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 65 place count 225 transition count 174
Iterating global reduction 2 with 12 rules applied. Total rules applied 77 place count 225 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 225 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 79 place count 225 transition count 171
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 81 place count 224 transition count 171
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 88 place count 217 transition count 164
Iterating global reduction 3 with 7 rules applied. Total rules applied 95 place count 217 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 8 rules applied. Total rules applied 103 place count 217 transition count 156
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 106 place count 215 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 106 place count 215 transition count 153
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 110 place count 213 transition count 153
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 138 rules applied. Total rules applied 248 place count 144 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 142 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 141 transition count 82
Applied a total of 251 rules in 38 ms. Remains 141 /269 variables (removed 128) and now considering 82/217 (removed 135) transitions.
// Phase 1: matrix 82 rows 141 cols
[2024-05-22 00:33:27] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:33:27] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 00:33:27] [INFO ] Invariant cache hit.
[2024-05-22 00:33:27] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-22 00:33:27] [INFO ] Redundant transitions in 3 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-22 00:33:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-22 00:33:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 82/223 variables, 141/203 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 203 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2137 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 4/140 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-22 00:33:29] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-22 00:33:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 82/223 variables, 141/208 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 78/286 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 15 (OVERLAPS) 0/223 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 286 constraints, problems are : Problem set: 0 solved, 78 unsolved in 5718 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints]
After SMT, in 7868ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7869ms
Starting structural reductions in SI_CTL mode, iteration 1 : 141/269 places, 82/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8123 ms. Remains : 141/269 places, 82/217 transitions.
[2024-05-22 00:33:35] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:33:35] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:33:35] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-22 00:33:35] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:33:35] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:33:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality5576557771164183891.gal : 1 ms
[2024-05-22 00:33:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality11375714601740590744.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/CTLCardinality5576557771164183891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11375714601740590744.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11442e+11,13.6506,367824,2,375368,5,1.93075e+06,6,0,639,1.76522e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:34:05] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:34:05] [INFO ] Applying decomposition
[2024-05-22 00:34:05] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9772678740020013058.txt' '-o' '/tmp/graph9772678740020013058.bin' '-w' '/tmp/graph9772678740020013058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9772678740020013058.bin' '-l' '-1' '-v' '-w' '/tmp/graph9772678740020013058.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:34:05] [INFO ] Decomposing Gal with order
[2024-05-22 00:34:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:34:05] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 00:34:05] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:34:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 00:34:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality4625133605460228753.gal : 16 ms
[2024-05-22 00:34:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality225654199034735479.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/CTLCardinality4625133605460228753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality225654199034735479.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11442e+11,0.182387,13360,3309,97,25803,367,356,22491,84,884,0


Converting to forward existential form...Done !
original formula: EF((EG(!(E((i0.i0.u0.p2!=1) U (i12.i1.u6.p78==1)))) * ((i0.i0.u14.p134==0)||(i13.u46.p253==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * ((i0.i0.u14.p134==0)||(i13.u46.p253==1))),!(E((i0.i0.u0.p2!=1) U (i12.i1.u6.p78==1))))]...164
Reverse transition relation is NOT exact ! Due to transitions t1, t57, t59, t72, t75, t78, u51.t3, i1.u1.t16, i1.u7.t9, i2.u3.t12, i2.u3.t18, i12.t56, i12....330
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,3.42903,176248,1,0,508722,962,1757,550255,462,2949,811041
FORMULA DES-PT-02b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 251 transition count 201
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 251 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 251 transition count 199
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 242 transition count 190
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 242 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 241 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 241 transition count 182
Applied a total of 63 rules in 10 ms. Remains 241 /269 variables (removed 28) and now considering 182/217 (removed 35) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-22 00:34:08] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 00:34:08] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 00:34:08] [INFO ] Invariant cache hit.
[2024-05-22 00:34:09] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:34:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:34:18] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:34:19] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:26] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:34:26] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:34:26] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:28] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:34:28] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:34:29] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24304 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 2 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 4 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 54342ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54345ms
Starting structural reductions in LTL mode, iteration 1 : 241/269 places, 182/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54621 ms. Remains : 241/269 places, 182/217 transitions.
[2024-05-22 00:35:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:35:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:35:03] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-22 00:35:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:35:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:35:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11348013581742232377.gal : 1 ms
[2024-05-22 00:35:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality4437508248469808041.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/CTLCardinality11348013581742232377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4437508248469808041.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.
Detected timeout of ITS tools.
[2024-05-22 00:35:33] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:35:33] [INFO ] Applying decomposition
[2024-05-22 00:35:33] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14772386876077984998.txt' '-o' '/tmp/graph14772386876077984998.bin' '-w' '/tmp/graph14772386876077984998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14772386876077984998.bin' '-l' '-1' '-v' '-w' '/tmp/graph14772386876077984998.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:35:33] [INFO ] Decomposing Gal with order
[2024-05-22 00:35:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:35:33] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 00:35:33] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:35:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 00:35:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality7996401016457751853.gal : 2 ms
[2024-05-22 00:35:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9806777012640759793.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/CTLCardinality7996401016457751853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9806777012640759793.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.045e+17,0.734029,30752,2920,95,59653,701,716,105868,89,2044,0


Converting to forward existential form...Done !
original formula: EG(EX((AF(((i6.i1.u35.p137==0)&&(i6.i1.u35.p142==0))) + AF(((i8.i0.u54.p196==0)||(i9.i1.u55.p198==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX((!(EG(!(((i6.i1.u35.p137==0)&&(i6.i1.u35.p142==0))))) + !(EG(!(((i8.i0.u54.p196==0)||(i9.i1.u55.p1...178
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t87, t134, t143, t144, t176, i0.i1.u33.t79, i1.u14.t112, i1.u16.t109, i2.t119, ...764
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 251 transition count 201
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 251 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 251 transition count 199
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 242 transition count 190
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 242 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 241 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 241 transition count 182
Applied a total of 63 rules in 8 ms. Remains 241 /269 variables (removed 28) and now considering 182/217 (removed 35) transitions.
[2024-05-22 00:36:03] [INFO ] Invariant cache hit.
[2024-05-22 00:36:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 00:36:03] [INFO ] Invariant cache hit.
[2024-05-22 00:36:03] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:36:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:36:06] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:36:07] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:36:08] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:09] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
[2024-05-22 00:36:10] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:12] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:36:23] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24289 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:37] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:36:45] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 54320ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54322ms
Starting structural reductions in LTL mode, iteration 1 : 241/269 places, 182/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54600 ms. Remains : 241/269 places, 182/217 transitions.
[2024-05-22 00:36:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:36:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:36:58] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-22 00:36:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:36:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:36:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1640263437593741382.gal : 2 ms
[2024-05-22 00:36:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality1487997188939232136.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/CTLCardinality1640263437593741382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1487997188939232136.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.
Detected timeout of ITS tools.
[2024-05-22 00:37:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:37:28] [INFO ] Applying decomposition
[2024-05-22 00:37:28] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5024365248140506190.txt' '-o' '/tmp/graph5024365248140506190.bin' '-w' '/tmp/graph5024365248140506190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5024365248140506190.bin' '-l' '-1' '-v' '-w' '/tmp/graph5024365248140506190.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:37:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:37:28] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 00:37:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 00:37:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9603184039727305758.gal : 2 ms
[2024-05-22 00:37:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality9728576436117073727.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/CTLCardinality9603184039727305758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9728576436117073727.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.045e+17,0.978588,44792,4298,88,101140,1262,630,146045,91,4465,0


Converting to forward existential form...Done !
original formula: AX(AF(EG(!(A(((i7.i1.i2.u50.p188==0)||(i6.u57.p208==1)) U ((i7.i1.i4.u51.p191==0)||(i7.i1.i1.u44.p170==1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG(!(!((E(!(((i7.i1.i4.u51.p191==0)||(i7.i1.i1.u44.p170==1))) U (!(((i7.i1.i2.u50.p188==0)||(i6...299
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t134, t143, t144, t176, i0.u10.t115, i1.t119, i1.u8.t124, i1.u8.t125, i1.u9.t12...707
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 268 transition count 217
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 254 transition count 203
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 254 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 254 transition count 201
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 38 place count 247 transition count 194
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 247 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 49 place count 247 transition count 190
Applied a total of 49 rules in 7 ms. Remains 247 /269 variables (removed 22) and now considering 190/217 (removed 27) transitions.
// Phase 1: matrix 190 rows 247 cols
[2024-05-22 00:37:58] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 00:37:58] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 00:37:58] [INFO ] Invariant cache hit.
[2024-05-22 00:37:58] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2024-05-22 00:37:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 2/247 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 2 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 11/127 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 12/150 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 14 (OVERLAPS) 190/437 variables, 247/401 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/437 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/437 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/437 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/437 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/437 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/437 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 416 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 107/107 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 2/247 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 107/169 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:32] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:38:32] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:38:32] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (OVERLAPS) 190/437 variables, 247/423 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 189/612 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:38:41] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 3/615 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 00:38:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 616 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 118/118 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 247/269 places, 190/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60342 ms. Remains : 247/269 places, 190/217 transitions.
[2024-05-22 00:38:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:38:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:38:58] [INFO ] Input system was already deterministic with 190 transitions.
[2024-05-22 00:38:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:38:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:38:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality12864521739449093194.gal : 1 ms
[2024-05-22 00:38:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality6361903310079143676.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/CTLCardinality12864521739449093194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6361903310079143676.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.
Detected timeout of ITS tools.
[2024-05-22 00:39:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:39:28] [INFO ] Applying decomposition
[2024-05-22 00:39:28] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12698546722575515542.txt' '-o' '/tmp/graph12698546722575515542.bin' '-w' '/tmp/graph12698546722575515542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12698546722575515542.bin' '-l' '-1' '-v' '-w' '/tmp/graph12698546722575515542.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:39:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:39:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:39:28] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 00:39:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:39:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 00:39:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality3969651517767518501.gal : 2 ms
[2024-05-22 00:39:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7171407376276359370.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/CTLCardinality3969651517767518501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7171407376276359370.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83894e+17,3.46812,126800,15437,88,373627,591,670,182232,88,1638,0


Converting to forward existential form...Done !
original formula: AX(((!(E((((i5.i2.u40.p153==0)||(i2.u12.p46==1))||(i1.u7.p30!=1)) U ((AX((i7.u45.p171==1)) + (i2.u1.p2==0)) + (i1.u6.p23==1)))) + AX(AF((...257
=> equivalent forward existential formula: [FwdG(EY(((EY(Init) * !(((i2.u33.p131==0)&&(i8.i1.u57.p204==1)))) * !(!(E((((i5.i2.u40.p153==0)||(i2.u12.p46==1)...314
Reverse transition relation is NOT exact ! Due to transitions t52, t58, t89, t140, t150, t151, t183, i0.u34.t79, i1.t125, i1.u7.t130, i1.u7.t131, i1.u8.t12...767
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 251 transition count 201
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 251 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 251 transition count 199
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 242 transition count 190
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 242 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 241 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 241 transition count 182
Applied a total of 63 rules in 8 ms. Remains 241 /269 variables (removed 28) and now considering 182/217 (removed 35) transitions.
// Phase 1: matrix 182 rows 241 cols
[2024-05-22 00:39:59] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:39:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 00:39:59] [INFO ] Invariant cache hit.
[2024-05-22 00:39:59] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:39:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:40:01] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:40:02] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:03] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:40:03] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:40:03] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/423 variables, 241/317 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:05] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:40:05] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:40:05] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:40:05] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:40:05] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:40:06] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:40:06] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:40:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:08] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:40:08] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:09] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:40:09] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:40:09] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:40:11] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:40:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:40:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:40:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:40:13] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
[2024-05-22 00:40:14] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:40:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:40:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 5/340 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:15] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:40:15] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:40:15] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:40:15] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:40:15] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 5/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:17] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:40:17] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:40:17] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:19] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:40:19] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:40:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 3/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/423 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 351 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24555 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:40:25] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:25] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:40:26] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:40:26] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:40:26] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:27] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:28] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:40:28] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:40:28] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:40:28] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 182/423 variables, 241/362 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 181/543 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:33] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:40:41] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:40:41] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:40:41] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 64/64 constraints]
After SMT, in 54585ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54588ms
Starting structural reductions in LTL mode, iteration 1 : 241/269 places, 182/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54882 ms. Remains : 241/269 places, 182/217 transitions.
[2024-05-22 00:40:53] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:40:53] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:40:53] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-22 00:40:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:40:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:40:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality12581925320766702609.gal : 1 ms
[2024-05-22 00:40:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10576139628520082206.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/CTLCardinality12581925320766702609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10576139628520082206.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.
Detected timeout of ITS tools.
[2024-05-22 00:41:24] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:41:24] [INFO ] Applying decomposition
[2024-05-22 00:41:24] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18413726539642372173.txt' '-o' '/tmp/graph18413726539642372173.bin' '-w' '/tmp/graph18413726539642372173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18413726539642372173.bin' '-l' '-1' '-v' '-w' '/tmp/graph18413726539642372173.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:41:24] [INFO ] Decomposing Gal with order
[2024-05-22 00:41:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:41:24] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 00:41:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:41:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 00:41:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality15920460201065258837.gal : 3 ms
[2024-05-22 00:41:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality7769696558283834816.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/CTLCardinality15920460201065258837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7769696558283834816.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.045e+17,0.580203,24092,2614,89,47411,626,693,66163,87,1950,0


Converting to forward existential form...Done !
original formula: EG((((i10.i3.u62.p218==0)||(i7.u42.p158==1)) + (AX(EG(((i12.u79.p286==0)&&(i9.i0.u52.p192==1)))) * !(E(AG((i5.u36.p139==0)) U ((i1.u9.p37...186
=> equivalent forward existential formula: [FwdG(Init,(((i10.i3.u62.p218==0)||(i7.u42.p158==1)) + (!(EX(!(EG(((i12.u79.p286==0)&&(i9.i0.u52.p192==1)))))) *...247
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t87, t134, t143, t144, t176, i0.i0.u33.t79, i1.t119, i1.u8.t124, i1.u8.t125, i1...736
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Graph (complete) has 486 edges and 269 vertex of which 260 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 259 transition count 195
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 243 transition count 195
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 33 place count 243 transition count 186
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 51 place count 234 transition count 186
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 63 place count 222 transition count 174
Iterating global reduction 2 with 12 rules applied. Total rules applied 75 place count 222 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 222 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 77 place count 222 transition count 171
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 79 place count 221 transition count 171
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 86 place count 214 transition count 164
Iterating global reduction 3 with 7 rules applied. Total rules applied 93 place count 214 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 8 rules applied. Total rules applied 101 place count 214 transition count 156
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 212 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 104 place count 212 transition count 153
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 108 place count 210 transition count 153
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 244 place count 142 transition count 85
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 142 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 140 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 248 place count 139 transition count 83
Applied a total of 248 rules in 72 ms. Remains 139 /269 variables (removed 130) and now considering 83/217 (removed 134) transitions.
// Phase 1: matrix 83 rows 139 cols
[2024-05-22 00:41:54] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 00:41:54] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 00:41:54] [INFO ] Invariant cache hit.
[2024-05-22 00:41:54] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-22 00:41:54] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 00:41:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 83/221 variables, 138/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/222 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:41:56] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 199 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3502 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 2/138 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 83/221 variables, 138/198 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 80/278 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:41:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 00:42:00] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 1/222 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 281 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8748 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 4/4 constraints]
After SMT, in 12261ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12262ms
Starting structural reductions in SI_CTL mode, iteration 1 : 139/269 places, 83/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12659 ms. Remains : 139/269 places, 83/217 transitions.
[2024-05-22 00:42:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:42:06] [INFO ] Flatten gal took : 2 ms
[2024-05-22 00:42:06] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-22 00:42:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:42:06] [INFO ] Flatten gal took : 2 ms
[2024-05-22 00:42:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14413121001225985537.gal : 1 ms
[2024-05-22 00:42:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality2068504005346214181.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/CTLCardinality14413121001225985537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2068504005346214181.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,8.92147e+10,8.42841,241368,2,267200,5,1.20076e+06,6,0,636,1.07952e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:42:36] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:42:36] [INFO ] Applying decomposition
[2024-05-22 00:42:36] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9222915427533379203.txt' '-o' '/tmp/graph9222915427533379203.bin' '-w' '/tmp/graph9222915427533379203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9222915427533379203.bin' '-l' '-1' '-v' '-w' '/tmp/graph9222915427533379203.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:42:36] [INFO ] Decomposing Gal with order
[2024-05-22 00:42:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:42:36] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 00:42:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:42:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-22 00:42:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality14502136172397898084.gal : 1 ms
[2024-05-22 00:42:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality947625358399452516.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/CTLCardinality14502136172397898084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality947625358399452516.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.92147e+10,0.082729,7276,1045,99,9053,281,347,8914,89,655,0


Converting to forward existential form...Done !
original formula: AF(EG((AG(((u15.p138==0)||(i11.i1.u38.p220==1))) + EF(((u0.p25==0)&&(i10.u25.p181==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !(((u15.p138==0)||(i11.i1.u38.p220==1))))) + E(TRUE U ((u0.p25==0)&&(i10.u25.p181==1...171
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t71, t75, t78, u1.t50, u0.t15, u15.t60, u50.t3, i1.u2.t11, i1.u2.t17, i2.t59, i2.u6.t...295
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 253 transition count 203
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 253 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 253 transition count 201
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 41 place count 244 transition count 192
Iterating global reduction 2 with 9 rules applied. Total rules applied 50 place count 244 transition count 192
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 55 place count 244 transition count 187
Applied a total of 55 rules in 7 ms. Remains 244 /269 variables (removed 25) and now considering 187/217 (removed 30) transitions.
// Phase 1: matrix 187 rows 244 cols
[2024-05-22 00:43:07] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 00:43:07] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 00:43:07] [INFO ] Invariant cache hit.
[2024-05-22 00:43:07] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-05-22 00:43:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/244 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:43:09] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:43:10] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:43:11] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:43:12] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:14] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:43:14] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:43:16] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:43:17] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 13 (OVERLAPS) 187/431 variables, 244/339 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:43:19] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:43:20] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:43:21] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:43:24] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/431 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:43:25] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 19 (OVERLAPS) 0/431 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 359 constraints, problems are : Problem set: 0 solved, 186 unsolved in 22701 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/244 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 54/115 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:31] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:43:33] [INFO ] Deduced a trap composed of 33 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:34] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:43:35] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:36] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:43:37] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:38] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 13 (OVERLAPS) 187/431 variables, 244/375 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 186/561 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:43:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 564 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 73/73 constraints]
After SMT, in 52748ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 52750ms
Starting structural reductions in LTL mode, iteration 1 : 244/269 places, 187/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53055 ms. Remains : 244/269 places, 187/217 transitions.
[2024-05-22 00:44:00] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:44:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:44:00] [INFO ] Input system was already deterministic with 187 transitions.
[2024-05-22 00:44:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:44:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:44:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality2142310597269530895.gal : 1 ms
[2024-05-22 00:44:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality1448809445384255803.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/CTLCardinality2142310597269530895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1448809445384255803.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.
Detected timeout of ITS tools.
[2024-05-22 00:44:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:44:30] [INFO ] Applying decomposition
[2024-05-22 00:44:30] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11917300783251793411.txt' '-o' '/tmp/graph11917300783251793411.bin' '-w' '/tmp/graph11917300783251793411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11917300783251793411.bin' '-l' '-1' '-v' '-w' '/tmp/graph11917300783251793411.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:44:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:44:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:44:30] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 00:44:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:44:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 00:44:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality17624283566271461495.gal : 3 ms
[2024-05-22 00:44:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1226914650087996159.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/CTLCardinality17624283566271461495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1226914650087996159.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39823e+17,1.06988,46324,4339,97,97013,1224,732,174526,88,4246,0


Converting to forward existential form...Done !
original formula: EG(((AX(EF(((i9.i0.i0.u62.p214==0)&&(i9.i1.i0.u44.p159==1)))) + EG(((((i9.i1.i3.u64.p234==0)||(i8.u41.p152==0))||(i1.u18.p70==1)) * AF((i...217
=> equivalent forward existential formula: [FwdG(Init,((!(EX(!(E(TRUE U ((i9.i0.i0.u62.p214==0)&&(i9.i1.i0.u44.p159==1)))))) + EG(((((i9.i1.i3.u64.p234==0)...284
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t56, t87, t138, t148, t149, i0.i1.i1.u35.t79, i1.u15.t113, i1.u17.t110, i2.t123, i2....779
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 254 transition count 204
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 254 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 254 transition count 203
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 246 transition count 195
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 246 transition count 195
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 246 transition count 189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 245 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 245 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 245 transition count 187
Applied a total of 54 rules in 18 ms. Remains 245 /269 variables (removed 24) and now considering 187/217 (removed 30) transitions.
// Phase 1: matrix 187 rows 245 cols
[2024-05-22 00:45:00] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:45:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 00:45:00] [INFO ] Invariant cache hit.
[2024-05-22 00:45:00] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-05-22 00:45:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/245 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:02] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:45:03] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:45:03] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:45:03] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:45:03] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:45:03] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:45:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:45:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:45:04] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:45:04] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:04] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:45:04] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:45:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:45:04] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:45:04] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:45:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:06] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:45:06] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:45:06] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:45:06] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:06] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:45:07] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 6/88 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:45:08] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:10] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 13 (OVERLAPS) 187/432 variables, 245/339 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:12] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:45:13] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:45:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/432 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:17] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:45:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:45:18] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/432 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:45:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:45:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/432 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/432 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/432 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/432 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/432 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:28] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/432 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 432/432 variables, and 355 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/245 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 49/110 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:31] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:45:32] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 187/432 variables, 245/357 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 186/543 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:45:37] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:47] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:45:57] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:45:57] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:45:58] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 432/432 variables, and 549 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 57/57 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Starting structural reductions in LTL mode, iteration 1 : 245/269 places, 187/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60373 ms. Remains : 245/269 places, 187/217 transitions.
[2024-05-22 00:46:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:46:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:46:00] [INFO ] Input system was already deterministic with 187 transitions.
[2024-05-22 00:46:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:46:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:46:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17944920645643940484.gal : 1 ms
[2024-05-22 00:46:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13593282427598516017.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/CTLCardinality17944920645643940484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13593282427598516017.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.
Detected timeout of ITS tools.
[2024-05-22 00:46:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:46:30] [INFO ] Applying decomposition
[2024-05-22 00:46:30] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17371059647254273611.txt' '-o' '/tmp/graph17371059647254273611.bin' '-w' '/tmp/graph17371059647254273611.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17371059647254273611.bin' '-l' '-1' '-v' '-w' '/tmp/graph17371059647254273611.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:46:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:46:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:46:30] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-22 00:46:30] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:46:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 00:46:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality10487762031065559664.gal : 2 ms
[2024-05-22 00:46:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11809885475002831973.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/CTLCardinality10487762031065559664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11809885475002831973.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.23125e+17,0.6071,28452,3650,84,55800,576,615,96893,94,1634,0


Converting to forward existential form...Done !
original formula: AX(((AF(((i5.u22.p87!=0)&&(i8.u57.p204!=1))) * EX(((i11.u77.p270!=0)&&(i9.i0.i1.u65.p222!=1)))) + (AX(AF(((i5.u9.p29==0)||(i9.i0.i0.u47.p...243
=> equivalent forward existential formula: ([FwdG(EY((EY(Init) * !((!(EG(!(((i5.u22.p87!=0)&&(i8.u57.p204!=1))))) * EX(((i11.u77.p270!=0)&&(i9.i0.i1.u65.p2...577
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t57, t88, t121, t137, t147, t180, i0.u79.t17, i1.u34.t80, i1.u36.t77, i2.u14.t114, i...705
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 252 transition count 202
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 252 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 252 transition count 200
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 42 place count 244 transition count 192
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 244 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 244 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 243 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 243 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 243 transition count 184
Applied a total of 59 rules in 15 ms. Remains 243 /269 variables (removed 26) and now considering 184/217 (removed 33) transitions.
// Phase 1: matrix 184 rows 243 cols
[2024-05-22 00:47:00] [INFO ] Computed 61 invariants in 1 ms
[2024-05-22 00:47:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 00:47:00] [INFO ] Invariant cache hit.
[2024-05-22 00:47:01] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-22 00:47:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:47:03] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:04] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2024-05-22 00:47:05] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:47:06] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 184/427 variables, 243/338 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:08] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:47:09] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:47:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:47:10] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:47:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:47:13] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:47:13] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:47:13] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/427 variables, 4/354 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:14] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:47:14] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:17] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 15 (OVERLAPS) 0/427 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 357 constraints, problems are : Problem set: 0 solved, 183 unsolved in 20799 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 53/114 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:47:23] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:47:24] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 13/127 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:24] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:25] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 184/427 variables, 243/372 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 183/555 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:30] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:47:31] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:39] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:47:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 559 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 72/72 constraints]
After SMT, in 50827ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 50829ms
Starting structural reductions in LTL mode, iteration 1 : 243/269 places, 184/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51114 ms. Remains : 243/269 places, 184/217 transitions.
[2024-05-22 00:47:51] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:47:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:47:51] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-22 00:47:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:47:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:47:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7160480553911205871.gal : 1 ms
[2024-05-22 00:47:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality6594131001160468019.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/CTLCardinality7160480553911205871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6594131001160468019.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.
Detected timeout of ITS tools.
[2024-05-22 00:48:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:48:22] [INFO ] Applying decomposition
[2024-05-22 00:48:22] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6774392122377312345.txt' '-o' '/tmp/graph6774392122377312345.bin' '-w' '/tmp/graph6774392122377312345.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6774392122377312345.bin' '-l' '-1' '-v' '-w' '/tmp/graph6774392122377312345.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:48:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:48:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:48:22] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:48:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:48:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 00:48:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality2363176565236372925.gal : 2 ms
[2024-05-22 00:48:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10547047455298795712.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/CTLCardinality2363176565236372925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10547047455298795712.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2425e+17,0.466616,23568,2677,90,47448,807,695,64571,94,2288,0


Converting to forward existential form...Done !
original formula: AF(AX(AX(AG(((i4.i1.u5.p17==0)&&(i5.i2.u74.p274==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EX(!(!(E(TRUE U !(((i4.i1.u5.p17==0)&&(i5.i2.u74.p274==1)))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t57, t59, t88, t135, t144, t145, t156, t178, i0.t120, i0.u8.t125, i0.u8.t126, i0.u9....742
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 253 transition count 203
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 253 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 253 transition count 202
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 39 place count 245 transition count 194
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 245 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 245 transition count 189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 244 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 244 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 244 transition count 187
Applied a total of 55 rules in 7 ms. Remains 244 /269 variables (removed 25) and now considering 187/217 (removed 30) transitions.
// Phase 1: matrix 187 rows 244 cols
[2024-05-22 00:48:52] [INFO ] Computed 61 invariants in 3 ms
[2024-05-22 00:48:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 00:48:52] [INFO ] Invariant cache hit.
[2024-05-22 00:48:52] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-05-22 00:48:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/244 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:48:54] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:48:54] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:48:55] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:48:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 187/431 variables, 244/316 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:48:58] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:48:59] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 9/325 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:49:01] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:49:02] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 11/338 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:03] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:49:03] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:49:04] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:49:04] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:06] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:49:06] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:49:07] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:11] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/431 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:12] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 19 (OVERLAPS) 0/431 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 348 constraints, problems are : Problem set: 0 solved, 186 unsolved in 25208 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/244 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:18] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:49:18] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:49:18] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:49:19] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:49:19] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:49:19] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:49:19] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:49:19] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:19] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:49:20] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:49:20] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:49:20] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:49:20] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:21] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:22] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (OVERLAPS) 187/431 variables, 244/363 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 186/549 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:25] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-22 00:49:25] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:49:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 00:49:36] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:49:36] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:49:37] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:49:37] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:49:37] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:49:37] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:49:42] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 7/559 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 559 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 68/68 constraints]
After SMT, in 55241ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 55243ms
Starting structural reductions in LTL mode, iteration 1 : 244/269 places, 187/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55511 ms. Remains : 244/269 places, 187/217 transitions.
[2024-05-22 00:49:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:49:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:49:47] [INFO ] Input system was already deterministic with 187 transitions.
[2024-05-22 00:49:47] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:49:47] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:49:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality12196930160535548522.gal : 2 ms
[2024-05-22 00:49:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11030371231302877350.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/CTLCardinality12196930160535548522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11030371231302877350.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.
Detected timeout of ITS tools.
[2024-05-22 00:50:17] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:50:17] [INFO ] Applying decomposition
[2024-05-22 00:50:17] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4285128575661979224.txt' '-o' '/tmp/graph4285128575661979224.bin' '-w' '/tmp/graph4285128575661979224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4285128575661979224.bin' '-l' '-1' '-v' '-w' '/tmp/graph4285128575661979224.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:50:17] [INFO ] Decomposing Gal with order
[2024-05-22 00:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:50:17] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-22 00:50:17] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:50:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 00:50:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality11607981280157866779.gal : 2 ms
[2024-05-22 00:50:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality2072479475859045625.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/CTLCardinality11607981280157866779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2072479475859045625.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76913e+17,0.94433,41648,5281,87,77749,569,629,179051,90,1625,0


Converting to forward existential form...Done !
original formula: EG((((A((((i9.u78.p270==0)||(i8.u51.p185==1))&&(i7.u66.p223==0)) U (((i8.u44.p161==1)||(i4.u31.p111==0))||(i4.u6.p76==1))) * EG(AX(((i5.u...330
=> equivalent forward existential formula: [FwdG(Init,(((!((E(!((((i8.u44.p161==1)||(i4.u31.p111==0))||(i4.u6.p76==1))) U (!((((i9.u78.p270==0)||(i8.u51.p1...528
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t137, t147, t148, t180, i0.u35.t79, i0.u37.t76, i1.t122, i1.u9.t127, i1.u9.t128...719
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 217/217 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 217
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 17 place count 252 transition count 202
Iterating global reduction 1 with 15 rules applied. Total rules applied 32 place count 252 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 252 transition count 200
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 42 place count 244 transition count 192
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 244 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 56 place count 244 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 243 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 243 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 243 transition count 184
Applied a total of 59 rules in 15 ms. Remains 243 /269 variables (removed 26) and now considering 184/217 (removed 33) transitions.
// Phase 1: matrix 184 rows 243 cols
[2024-05-22 00:50:47] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 00:50:47] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 00:50:47] [INFO ] Invariant cache hit.
[2024-05-22 00:50:48] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-22 00:50:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:50:50] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:50:51] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:50:52] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:50:52] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:50:52] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:50:52] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:50:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:50:53] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 184/427 variables, 243/333 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:50:54] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:50:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 5/338 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:50:57] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:50:59] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:51:02] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/427 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:51:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:51:04] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:51:05] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:51:06] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:51:06] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:51:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:51:06] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:51:06] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:51:06] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:51:08] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:51:08] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:51:08] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:51:10] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:51:10] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:51:10] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/427 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 19 (OVERLAPS) 0/427 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 368 constraints, problems are : Problem set: 0 solved, 183 unsolved in 26220 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 64/125 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 184/427 variables, 243/368 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 183/551 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:51:19] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:51:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 3/554 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:51:28] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:51:32] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-22 00:51:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:51:41] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-05-22 00:51:41] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:51:41] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 560 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 73/73 constraints]
After SMT, in 56255ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 56257ms
Starting structural reductions in LTL mode, iteration 1 : 243/269 places, 184/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56566 ms. Remains : 243/269 places, 184/217 transitions.
[2024-05-22 00:51:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:51:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:51:44] [INFO ] Input system was already deterministic with 184 transitions.
[2024-05-22 00:51:44] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:51:44] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:51:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality9837349704371683821.gal : 1 ms
[2024-05-22 00:51:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality10907272136583116738.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/CTLCardinality9837349704371683821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10907272136583116738.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.
Detected timeout of ITS tools.
[2024-05-22 00:52:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:52:14] [INFO ] Applying decomposition
[2024-05-22 00:52:14] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9585340672477886876.txt' '-o' '/tmp/graph9585340672477886876.bin' '-w' '/tmp/graph9585340672477886876.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9585340672477886876.bin' '-l' '-1' '-v' '-w' '/tmp/graph9585340672477886876.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:52:14] [INFO ] Decomposing Gal with order
[2024-05-22 00:52:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:52:14] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:52:14] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:52:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 00:52:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality15361079038385673674.gal : 2 ms
[2024-05-22 00:52:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2124208299413635585.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/CTLCardinality15361079038385673674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2124208299413635585.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.045e+17,0.611415,28856,3652,91,62707,970,689,75980,91,3528,0


Converting to forward existential form...Done !
original formula: (EF((AF(((i0.i0.u33.p133==0)&&(i4.i0.u24.p83==1))) * EF((((i4.i0.u30.p130==0)||(i9.i1.u52.p193==1))||((i3.u18.p72==0)||(i2.u13.p55==1))))...215
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(EG(!(((i0.i0.u33.p133==0)&&(i4.i0.u24.p83==1))))) * E(TRUE U (((i4.i0.u30.p130==0)||(i9....313
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t56, t87, t136, t145, t146, t178, i0.i0.u33.t79, i1.t121, i1.u8.t126, i1.u8.t127, i1...767
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-22 00:52:44] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:52:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:52:44] [INFO ] Applying decomposition
[2024-05-22 00:52:44] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8843080681925914476.txt' '-o' '/tmp/graph8843080681925914476.bin' '-w' '/tmp/graph8843080681925914476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8843080681925914476.bin' '-l' '-1' '-v' '-w' '/tmp/graph8843080681925914476.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:52:44] [INFO ] Decomposing Gal with order
[2024-05-22 00:52:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:52:44] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-22 00:52:44] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:52:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-05-22 00:52:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12343304367195109202.gal : 2 ms
[2024-05-22 00:52:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality16961862058714548347.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/CTLCardinality12343304367195109202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16961862058714548347.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0025e+18,0.836678,35492,3509,96,77882,862,786,77035,103,2716,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(AF(((i6.u32.p123==0)&&(i1.u13.p41==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(!(EG(!(((i6.u32.p123==0)&&(i1.u13.p41==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t57, t96, t141, t157, t173, t185, i0.i0.u36.t82, i0.i1.u39.t79, i1.t158, i1.u12.t131, i1.u13....898
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 00:54:14] [INFO ] Applying decomposition
[2024-05-22 00:54:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:54:14] [INFO ] Decomposing Gal with order
[2024-05-22 00:54:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:54:14] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-22 00:54:14] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:54:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 10 ms.
[2024-05-22 00:54:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6646312840604181895.gal : 5 ms
[2024-05-22 00:54:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2329838016823224182.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/CTLCardinality6646312840604181895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2329838016823224182.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0025e+18,33.3276,968204,63444,353,1.16281e+06,1856,633,9.06524e+06,146,10122,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(AF(((i1.i0.i1.i0.i1.i1.u134.p123==0)&&(i1.i0.i0.i0.i0.i0.u17.p41==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(!(EG(!(((i1.i0.i1.i0.i1.i1.u134.p123==0)&&(i1.i0.i0.i0.i0.i0.u17.p41==1)...176
Reverse transition relation is NOT exact ! Due to transitions t158, i1.i0.i0.u20.t117, i1.i0.i0.u20.t119, i1.i0.i0.i0.u19.t122, i1.i0.i0.i0.i0.u18.t126, i1...1920
ITS-tools command line returned an error code 137
[2024-05-22 01:03:53] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:03:53] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-22 01:03:53] [INFO ] Transformed 269 places.
[2024-05-22 01:03:53] [INFO ] Transformed 217 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:03:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17976070926642601480.gal : 1 ms
[2024-05-22 01:03:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality7480013670862636268.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/CTLCardinality17976070926642601480.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7480013670862636268.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0025e+18,6.759,197944,2,120935,5,865609,6,0,1288,772921,0


Converting to forward existential form...Done !
original formula: EF(AX(AG(AF(((p123==0)&&(p41==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !(!(EG(!(((p123==0)&&(p41==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t23, t26, t32, t35, t37, t40, t51, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62,...470
ITS-tools command line returned an error code 137
Total runtime 2639377 ms.

BK_STOP 1716340416741

--------------------
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="DES-PT-02b"
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 DES-PT-02b, 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 r092-tall-171624189700641"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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