Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683760900377.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 ShieldPPPs-PT-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760900377
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 13 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 35K May 18 16:43 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 ShieldPPPs-PT-002B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPs-PT-002B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716951647190

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 03:00:48] [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-29 03:00:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:00:48] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-29 03:00:48] [INFO ] Transformed 139 places.
[2024-05-29 03:00:48] [INFO ] Transformed 129 transitions.
[2024-05-29 03:00:48] [INFO ] Found NUPN structural information;
[2024-05-29 03:00:48] [INFO ] Parsed PT model containing 139 places and 129 transitions and 354 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA ShieldPPPs-PT-002B-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 129/129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 127
Applied a total of 4 rules in 27 ms. Remains 137 /139 variables (removed 2) and now considering 127/129 (removed 2) transitions.
// Phase 1: matrix 127 rows 137 cols
[2024-05-29 03:00:48] [INFO ] Computed 23 invariants in 18 ms
[2024-05-29 03:00:48] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-29 03:00:48] [INFO ] Invariant cache hit.
[2024-05-29 03:00:48] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-29 03:00:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:49] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 15 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 2 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 2 ms to minimize.
[2024-05-29 03:00:50] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:00:51] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 3 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:00:52] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:00:53] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:00:54] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:54] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:00:55] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:56] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:00:56] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 11 (OVERLAPS) 127/264 variables, 137/238 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:57] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:58] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:59] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:00:59] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:00:59] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:00:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:00:59] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:01] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:01:01] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 19 (OVERLAPS) 0/264 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 248 constraints, problems are : Problem set: 0 solved, 126 unsolved in 14645 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 88/111 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:04] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:01:04] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:01:04] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:01:04] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:04] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:05] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:01:05] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:01:05] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:01:05] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:05] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:01:05] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:01:05] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:01:05] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:06] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:01:06] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 127/264 variables, 137/263 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 126/389 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:07] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:01:07] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:01:07] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:01:08] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
[2024-05-29 03:01:08] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:01:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 6/395 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:10] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:01:11] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:01:11] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:01:11] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:01:11] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 5/400 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:13] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:01:14] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:16] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:19] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:01:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:22] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:25] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:01:25] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:01:25] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:31] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:01:31] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:01:31] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/264 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/264 variables, and 412 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 126/126 constraints]
After SMT, in 44711ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 44724ms
Starting structural reductions in LTL mode, iteration 1 : 137/139 places, 127/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45137 ms. Remains : 137/139 places, 127/129 transitions.
Support contains 78 out of 137 places after structural reductions.
[2024-05-29 03:01:33] [INFO ] Flatten gal took : 41 ms
[2024-05-29 03:01:33] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:01:33] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 40000 steps (95 resets) in 1127 ms. (35 steps per ms) remains 2/64 properties
BEST_FIRST walk for 40004 steps (27 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 161 ms. (246 steps per ms) remains 1/2 properties
[2024-05-29 03:01:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/116 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/137 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/264 variables, 137/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 110/116 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 03:01:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:01:35] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 116/264 variables, and 23 constraints, problems are : Problem set: 1 solved, 0 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 21/23 constraints, State Equation: 0/137 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 583ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA ShieldPPPs-PT-002B-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 03:01:35] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:01:35] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:01:35] [INFO ] Input system was already deterministic with 127 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 127/127 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 16 place count 136 transition count 110
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 120 transition count 110
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 120 transition count 100
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 52 place count 110 transition count 100
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 64 place count 98 transition count 88
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 98 transition count 88
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 98 transition count 82
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 92 transition count 82
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 142 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 63 transition count 53
Applied a total of 144 rules in 38 ms. Remains 63 /137 variables (removed 74) and now considering 53/127 (removed 74) transitions.
// Phase 1: matrix 53 rows 63 cols
[2024-05-29 03:01:35] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:01:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 03:01:35] [INFO ] Invariant cache hit.
[2024-05-29 03:01:35] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-29 03:01:35] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-29 03:01:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 53/116 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 0/116 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 86 constraints, problems are : Problem set: 0 solved, 51 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 53/116 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 51/137 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:01:36] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/116 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 138 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
After SMT, in 1953ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1954ms
Starting structural reductions in SI_CTL mode, iteration 1 : 63/137 places, 53/127 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2164 ms. Remains : 63/137 places, 53/127 transitions.
[2024-05-29 03:01:37] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:01:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:01:37] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-29 03:01:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:01:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:01:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality1123006928683956209.gal : 8 ms
[2024-05-29 03:01:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality3428173697850934219.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/CTLCardinality1123006928683956209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3428173697850934219.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39688e+09,0.909504,34792,2,3038,5,106737,6,0,308,223555,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((p19==0)||(p124==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((p19==0)||(p124==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t37, t38, t39, t40...295
Detected timeout of ITS tools.
[2024-05-29 03:02:07] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:02:07] [INFO ] Applying decomposition
[2024-05-29 03:02:07] [INFO ] Flatten gal took : 11 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/graph4469803495078627564.txt' '-o' '/tmp/graph4469803495078627564.bin' '-w' '/tmp/graph4469803495078627564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4469803495078627564.bin' '-l' '-1' '-v' '-w' '/tmp/graph4469803495078627564.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:02:07] [INFO ] Decomposing Gal with order
[2024-05-29 03:02:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:02:07] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-29 03:02:07] [INFO ] Flatten gal took : 29 ms
[2024-05-29 03:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2024-05-29 03:02:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality4556066825080299272.gal : 3 ms
[2024-05-29 03:02:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality1489962013709441961.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/CTLCardinality4556066825080299272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1489962013709441961.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.39688e+09,1.16116,36436,643,31,55515,98,166,110613,36,344,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((i0.i0.u2.p19==0)||(i6.u21.p124==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((i0.i0.u2.p19==0)||(i6.u21.p124==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t9, t10, t23, t25, t46, i0.i0.u3.t0, i1.t41, i1.t26, i1.u11.t7, i1.u11.t8, i2.t22, i2...413
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 : 137/137 places, 127/127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 129 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 129 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 128 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 128 transition count 118
Applied a total of 18 rules in 13 ms. Remains 128 /137 variables (removed 9) and now considering 118/127 (removed 9) transitions.
// Phase 1: matrix 118 rows 128 cols
[2024-05-29 03:02:37] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:02:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 03:02:37] [INFO ] Invariant cache hit.
[2024-05-29 03:02:37] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-29 03:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 7 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:02:39] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:40] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:42] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:02:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:42] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:42] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:02:42] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:02:45] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 15 (OVERLAPS) 118/246 variables, 128/208 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:47] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:02:47] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:02:47] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:02:47] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:02:47] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:02:47] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/246 variables, 6/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:48] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:02:48] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:02:48] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:48] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:02:49] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/246 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/246 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:50] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:02:50] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:02:50] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/246 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/246 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:51] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:02:51] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:02:51] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/246 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:52] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:02:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/246 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/246 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:53] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:02:53] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/246 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/246 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/246 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 30 (OVERLAPS) 0/246 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 237 constraints, problems are : Problem set: 0 solved, 117 unsolved in 18700 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/246 variables, 128/237 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 117/354 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:02:57] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:02:58] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 10/364 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:03:01] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 9/373 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:03:02] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:03:03] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:03:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:03:05] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:03:06] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:03:08] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:03:12] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:03:15] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:03:15] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:03:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:03:18] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:03:18] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:03:18] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:03:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 387 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 119/119 constraints]
After SMT, in 48728ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 48730ms
Starting structural reductions in LTL mode, iteration 1 : 128/137 places, 118/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48891 ms. Remains : 128/137 places, 118/127 transitions.
[2024-05-29 03:03:26] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:03:26] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:03:26] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-29 03:03:26] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:03:26] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:03:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality15252699713786562962.gal : 2 ms
[2024-05-29 03:03:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8730389731402940290.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/CTLCardinality15252699713786562962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8730389731402940290.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-29 03:03:56] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:03:56] [INFO ] Applying decomposition
[2024-05-29 03:03:56] [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/graph16048705470272613422.txt' '-o' '/tmp/graph16048705470272613422.bin' '-w' '/tmp/graph16048705470272613422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16048705470272613422.bin' '-l' '-1' '-v' '-w' '/tmp/graph16048705470272613422.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:03:56] [INFO ] Decomposing Gal with order
[2024-05-29 03:03:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:03:56] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:03:56] [INFO ] Flatten gal took : 13 ms
[2024-05-29 03:03:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 03:03:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality10253190875790197308.gal : 3 ms
[2024-05-29 03:03:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality17838005502691245770.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/CTLCardinality10253190875790197308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17838005502691245770.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,5.4326e+12,6.03175,134356,2018,53,200164,421,379,444592,49,3105,0


Converting to forward existential form...Done !
original formula: (!(E((i4.i0.u11.p26!=0) U (EF((E((i8.u42.p121==1) U (i7.i0.u33.p91==0)) * EX(TRUE))) * EG(((i2.i1.u17.p40!=1)||(((i1.i1.u5.p11==0)||(i4.i...293
=> equivalent forward existential formula: ([FwdG((FwdU(Init,(i4.i0.u11.p26!=0)) * E(TRUE U (E((i8.u42.p121==1) U (i7.i0.u33.p91==0)) * EX(TRUE)))),((i2.i1...367
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t72, t75, t78, i0.u1.t82, i1.i0.u19.t66, i1.i0.u19.t67, i1.i1.u6.t81, i2.i0.u7.t80,...699
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 130 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 130 transition count 120
Applied a total of 14 rules in 10 ms. Remains 130 /137 variables (removed 7) and now considering 120/127 (removed 7) transitions.
// Phase 1: matrix 120 rows 130 cols
[2024-05-29 03:04:26] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:04:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 03:04:26] [INFO ] Invariant cache hit.
[2024-05-29 03:04:26] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-29 03:04:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:04:27] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:04:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:29] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:04:29] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:04:29] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:04:29] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:04:29] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:04:29] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:04:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:04:29] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:30] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:04:30] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:04:30] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:04:30] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:04:30] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:04:30] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/250 variables, 130/194 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:31] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:04:31] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:04:31] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:32] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:04:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:04:32] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/250 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:33] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:04:33] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:33] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:04:33] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/250 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:35] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:35] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:37] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:04:37] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:04:37] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:37] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/250 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:37] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:38] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 21 (OVERLAPS) 0/250 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 213 constraints, problems are : Problem set: 0 solved, 119 unsolved in 13653 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 60/83 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:41] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:04:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:04:41] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:04:41] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:41] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:04:41] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/250 variables, 130/219 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 119/338 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:42] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:04:43] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:04:43] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:44] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:04:44] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:04:44] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:04:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:04:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:04:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:46] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:48] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:04:48] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:52] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/250 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:04:54] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:04:58] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:04:59] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:04:59] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:04:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/250 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:05:04] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/250 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:05:06] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:05:09] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:05:09] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:05:09] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/250 variables, and 365 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 93/93 constraints]
After SMT, in 43679ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 43680ms
Starting structural reductions in LTL mode, iteration 1 : 130/137 places, 120/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43838 ms. Remains : 130/137 places, 120/127 transitions.
[2024-05-29 03:05:10] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:05:10] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:05:10] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-29 03:05:10] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:05:10] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:05:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality15389316912547128562.gal : 1 ms
[2024-05-29 03:05:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality8536322459391431810.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/CTLCardinality15389316912547128562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8536322459391431810.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-29 03:05:40] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:05:40] [INFO ] Applying decomposition
[2024-05-29 03:05:40] [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/graph14165986463147406645.txt' '-o' '/tmp/graph14165986463147406645.bin' '-w' '/tmp/graph14165986463147406645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14165986463147406645.bin' '-l' '-1' '-v' '-w' '/tmp/graph14165986463147406645.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:05:40] [INFO ] Decomposing Gal with order
[2024-05-29 03:05:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:05:40] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:05:40] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:05:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:05:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality10827794124414932128.gal : 3 ms
[2024-05-29 03:05:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality14213895153715155216.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/CTLCardinality10827794124414932128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14213895153715155216.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,5.50275e+12,5.25919,126956,2603,53,199747,275,357,397150,45,1182,0


Converting to forward existential form...Done !
original formula: EX((E(!((((i8.u44.p123==1)&&(i3.i1.u21.p60!=0)) + ((EG((i2.i1.u23.p63==1)) * (i1.i0.u4.p11==1)) * (i7.i1.u41.p113==1)))) U (!(AF((i5.i1.u...377
=> equivalent forward existential formula: (([FwdG(FwdU(EY(Init),!((((i8.u44.p123==1)&&(i3.i1.u21.p60!=0)) + ((EG((i2.i1.u23.p63==1)) * (i1.i0.u4.p11==1)) ...794
Reverse transition relation is NOT exact ! Due to transitions t45, t48, t73, t76, i0.i0.u1.t83, i1.t79, i1.i0.u5.t82, i1.i1.u6.t81, i2.i0.u9.t78, i2.i1.u22...696
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 : 137/137 places, 127/127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 129 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 129 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 128 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 128 transition count 118
Applied a total of 18 rules in 6 ms. Remains 128 /137 variables (removed 9) and now considering 118/127 (removed 9) transitions.
// Phase 1: matrix 118 rows 128 cols
[2024-05-29 03:06:10] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:06:10] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 03:06:10] [INFO ] Invariant cache hit.
[2024-05-29 03:06:11] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-29 03:06:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:06:11] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 19/42 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:06:12] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:06:13] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:06:14] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:15] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:06:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 118/246 variables, 128/200 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:16] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:17] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:06:17] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:06:17] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:06:17] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:17] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:06:17] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:06:18] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:18] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:06:18] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:06:18] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:06:19] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:20] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/246 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:20] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 18 (OVERLAPS) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 214 constraints, problems are : Problem set: 0 solved, 117 unsolved in 11531 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:23] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:06:23] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-29 03:06:23] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:06:23] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:23] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:06:23] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/246 variables, 128/220 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 117/337 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:06:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:06:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:06:25] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:27] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:06:27] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:06:27] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:31] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:06:32] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:06:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (OVERLAPS) 0/246 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 348 constraints, problems are : Problem set: 0 solved, 117 unsolved in 20842 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 80/80 constraints]
After SMT, in 32384ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 32386ms
Starting structural reductions in LTL mode, iteration 1 : 128/137 places, 118/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32533 ms. Remains : 128/137 places, 118/127 transitions.
[2024-05-29 03:06:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:06:43] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:06:43] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-29 03:06:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:06:43] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:06:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3729201020112093276.gal : 1 ms
[2024-05-29 03:06:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8619188122187076983.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/CTLCardinality3729201020112093276.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8619188122187076983.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.45245e+12,28.8556,748588,2,35343,5,2.27007e+06,6,0,632,5.21476e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:07:13] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:07:13] [INFO ] Applying decomposition
[2024-05-29 03:07:13] [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/graph6423710777284051776.txt' '-o' '/tmp/graph6423710777284051776.bin' '-w' '/tmp/graph6423710777284051776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6423710777284051776.bin' '-l' '-1' '-v' '-w' '/tmp/graph6423710777284051776.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:07:13] [INFO ] Decomposing Gal with order
[2024-05-29 03:07:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:07:13] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:07:13] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:07:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:07:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality10116794787433466135.gal : 2 ms
[2024-05-29 03:07:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality2526399509865280521.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/CTLCardinality10116794787433466135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2526399509865280521.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,5.45245e+12,4.09251,96628,1550,54,151961,458,367,280802,45,2635,0


Converting to forward existential form...Done !
original formula: EF((AG((EX((i7.i0.u34.p90==0)) + (i4.u22.p54==1))) + (EF((i6.i1.u40.p109==0)) * AG(A(((i3.i1.u16.p46==0)||(i2.i1.u6.p14==1)) U ((i7.i0.u3...187
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((EX((i7.i0.u34.p90==0)) + (i4.u22.p54==1))))))] != FALSE + [((FwdU(Init,TRUE) ...403
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t49, t72, t75, i0.u1.t82, i1.i0.u13.t74, i1.i1.u23.t56, i1.i1.u24.t10, i1.i1.u24.t1...695
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 : 137/137 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 125 transition count 115
Applied a total of 24 rules in 16 ms. Remains 125 /137 variables (removed 12) and now considering 115/127 (removed 12) transitions.
// Phase 1: matrix 115 rows 125 cols
[2024-05-29 03:07:43] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:07:43] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 03:07:43] [INFO ] Invariant cache hit.
[2024-05-29 03:07:43] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-29 03:07:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:07:44] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:45] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:07:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:07:45] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:45] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:07:45] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:07:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:07:46] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:46] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:07:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:07:46] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:07:46] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 115/240 variables, 125/176 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:47] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:07:47] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 178 constraints, problems are : Problem set: 0 solved, 114 unsolved in 5143 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/240 variables, 125/178 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 114/292 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:49] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:07:49] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:07:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 10/302 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:07:52] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 10/312 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:07:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:07:56] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:07:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:07:56] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:07:56] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 318 constraints, problems are : Problem set: 0 solved, 114 unsolved in 12936 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 56/56 constraints]
After SMT, in 18090ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 18091ms
Starting structural reductions in LTL mode, iteration 1 : 125/137 places, 115/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18240 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:08:01] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:08:01] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:08:01] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-29 03:08:01] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:08:01] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:08:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality1630482645632352117.gal : 1 ms
[2024-05-29 03:08:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality9961286552294312578.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/CTLCardinality1630482645632352117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9961286552294312578.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.76134e+12,23.9837,631024,2,31245,5,1.96679e+06,6,0,617,4.38304e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:08:31] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:08:31] [INFO ] Applying decomposition
[2024-05-29 03:08:31] [INFO ] Flatten gal took : 3 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/graph2809769347708906210.txt' '-o' '/tmp/graph2809769347708906210.bin' '-w' '/tmp/graph2809769347708906210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2809769347708906210.bin' '-l' '-1' '-v' '-w' '/tmp/graph2809769347708906210.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:08:31] [INFO ] Decomposing Gal with order
[2024-05-29 03:08:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:08:31] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:08:31] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:08:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:08:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17164510283682448074.gal : 3 ms
[2024-05-29 03:08:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality4347159277910897048.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/CTLCardinality17164510283682448074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4347159277910897048.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,4.76134e+12,1.83479,56480,1531,49,92898,441,339,200143,45,3205,0


Converting to forward existential form...Done !
original formula: AF((AF((i9.u36.p97==1)) * (AX((((i6.i1.u45.p125==0)&&(i6.i0.u31.p85==1))||((i8.i0.u34.p96==0)&&(i8.i1.u39.p107==1)))) + ((i6.i0.u31.p85==...186
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((i9.u36.p97==1)))) * (!(EX(!((((i6.i1.u45.p125==0)&&(i6.i0.u31.p85==1))||((i8.i0.u34.p96==0...249
Reverse transition relation is NOT exact ! Due to transitions t42, t45, t48, t69, t72, t75, i0.u1.t79, i1.i0.u5.t78, i2.i0.u6.t77, i2.i1.u16.t66, i2.i1.u17...657
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 130 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 130 transition count 120
Applied a total of 14 rules in 3 ms. Remains 130 /137 variables (removed 7) and now considering 120/127 (removed 7) transitions.
// Phase 1: matrix 120 rows 130 cols
[2024-05-29 03:09:01] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:09:02] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-29 03:09:02] [INFO ] Invariant cache hit.
[2024-05-29 03:09:02] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-29 03:09:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:09:03] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:09:04] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 4 ms to minimize.
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:09:05] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:07] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:09:07] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:07] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:09:07] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:09:08] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:09:08] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:09:08] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:09:08] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 120/250 variables, 130/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:09] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:09:09] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:09:10] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:11] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:09:12] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:09:13] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:13] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:09:13] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:14] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/250 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:15] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:09:15] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:09:15] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:09:16] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:09:16] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/250 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/250 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 24 (OVERLAPS) 0/250 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 232 constraints, problems are : Problem set: 0 solved, 119 unsolved in 15506 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 79/102 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:18] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:18] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:09:18] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:18] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:09:18] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:09:18] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:19] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:19] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:09:19] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 2 ms to minimize.
[2024-05-29 03:09:19] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:20] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:09:20] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:09:20] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:09:20] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:09:20] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:09:20] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:20] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:21] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:09:22] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:09:22] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:09:22] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:09:22] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:09:22] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:09:22] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:09:22] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 120/250 variables, 130/267 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 119/386 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:23] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:09:24] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:26] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:09:26] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:09:31] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/250 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 20 (OVERLAPS) 0/250 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 391 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20346 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 119/119 constraints]
After SMT, in 35876ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 35878ms
Starting structural reductions in LTL mode, iteration 1 : 130/137 places, 120/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36280 ms. Remains : 130/137 places, 120/127 transitions.
[2024-05-29 03:09:38] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:09:38] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:09:38] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-29 03:09:38] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:09:38] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:09:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality11626865199893068324.gal : 1 ms
[2024-05-29 03:09:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11211644791686296157.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/CTLCardinality11626865199893068324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11211644791686296157.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-29 03:10:08] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:10:08] [INFO ] Applying decomposition
[2024-05-29 03:10:08] [INFO ] Flatten gal took : 3 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/graph12748552200054039073.txt' '-o' '/tmp/graph12748552200054039073.bin' '-w' '/tmp/graph12748552200054039073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12748552200054039073.bin' '-l' '-1' '-v' '-w' '/tmp/graph12748552200054039073.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:10:08] [INFO ] Decomposing Gal with order
[2024-05-29 03:10:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:10:08] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:10:08] [INFO ] Flatten gal took : 17 ms
[2024-05-29 03:10:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 03:10:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality1751066400006396908.gal : 6 ms
[2024-05-29 03:10:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality4036071565120237700.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/CTLCardinality1751066400006396908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4036071565120237700.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,5.47859e+12,2.69742,79708,2993,55,129575,263,346,253671,49,1550,0


Converting to forward existential form...Done !
original formula: (AG(((E(((i10.u48.p133==0)||(i7.u45.p123==1)) U (i1.i1.u5.p12==0)) * ((i10.u49.p138==0)||(i8.i1.u41.p109==1))) * ((((i6.i0.u28.p77==0)||(...305
=> equivalent forward existential formula: (([(FwdU((Init * !(!(!((E(!(EG(!(!(E(TRUE U !((i5.u25.p71==0))))))) U (!(!(E(TRUE U !(!(EX(!((i8.i1.u40.p104==1)...973
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t73, t76, t79, i0.u1.t83, i1.i0.u19.t67, i1.i0.u19.t68, i1.i1.u6.t82, i2.u7.t81, i3...723
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 SI_CTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 136 transition count 112
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 122 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 121 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 30 place count 121 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 52 place count 110 transition count 100
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 63 place count 99 transition count 89
Iterating global reduction 3 with 11 rules applied. Total rules applied 74 place count 99 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 74 place count 99 transition count 84
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 84 place count 94 transition count 84
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 140 place count 66 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 65 transition count 55
Applied a total of 141 rules in 19 ms. Remains 65 /137 variables (removed 72) and now considering 55/127 (removed 72) transitions.
// Phase 1: matrix 55 rows 65 cols
[2024-05-29 03:10:38] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:10:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 03:10:38] [INFO ] Invariant cache hit.
[2024-05-29 03:10:38] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-29 03:10:38] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-29 03:10:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 03:10:38] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 03:10:39] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:10:39] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/120 variables, 65/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 03:10:39] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 03:10:39] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 03:10:39] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 03:10:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/120 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/120 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 95 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/120 variables, 65/95 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 54/149 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 149 constraints, problems are : Problem set: 0 solved, 54 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
After SMT, in 2687ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2688ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/137 places, 55/127 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2818 ms. Remains : 65/137 places, 55/127 transitions.
[2024-05-29 03:10:41] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:10:41] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:10:41] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-29 03:10:41] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:10:41] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:10:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality10885140910156746264.gal : 15 ms
[2024-05-29 03:10:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality13071743636776441395.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/CTLCardinality10885140910156746264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13071743636776441395.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15977e+09,0.585687,26456,2,2726,5,79600,6,0,317,165168,0


Converting to forward existential form...Done !
original formula: EG(E(AG((p135==1)) U (EG((((p68!=1)||(p41==1))||((p135==0)||(p74==1)))) * EF((p118==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(!(E(TRUE U !((p135==1)))) U (EG((((p68!=1)||(p41==1))||((p135==0)||(p74==1)))) * E(TRUE U (p118==0)...169
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t37, t38, t39...300
Detected timeout of ITS tools.
[2024-05-29 03:11:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:11:11] [INFO ] Applying decomposition
[2024-05-29 03:11:11] [INFO ] Flatten gal took : 1 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/graph4487630238772438256.txt' '-o' '/tmp/graph4487630238772438256.bin' '-w' '/tmp/graph4487630238772438256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4487630238772438256.bin' '-l' '-1' '-v' '-w' '/tmp/graph4487630238772438256.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:11:11] [INFO ] Decomposing Gal with order
[2024-05-29 03:11:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:11:11] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-29 03:11:11] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:11:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 1 ms.
[2024-05-29 03:11:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality8377095614464780428.gal : 1 ms
[2024-05-29 03:11:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality355689478803265160.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/CTLCardinality8377095614464780428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality355689478803265160.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.15977e+09,2.0576,60008,685,31,84519,124,176,248643,33,580,0


Converting to forward existential form...Done !
original formula: EG(E(AG((i5.i0.u24.p135==1)) U (EG((((i3.u11.p68!=1)||(i0.u8.p41==1))||((i5.i0.u24.p135==0)||(i5.i0.u12.p74==1)))) * EF((i6.u23.p118==0))...158
=> equivalent forward existential formula: [FwdG(Init,E(!(E(TRUE U !((i5.i0.u24.p135==1)))) U (EG((((i3.u11.p68!=1)||(i0.u8.p41==1))||((i5.i0.u24.p135==0)|...219
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t46, i0.t25, i0.t24, i0.u8.t3, i0.u8.t4, i2.t40, i2.t39, i2.u10.t5, i2.u...434
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 127 transition count 117
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 127 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 126 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 126 transition count 116
Applied a total of 22 rules in 4 ms. Remains 126 /137 variables (removed 11) and now considering 116/127 (removed 11) transitions.
// Phase 1: matrix 116 rows 126 cols
[2024-05-29 03:11:41] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:11:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 03:11:41] [INFO ] Invariant cache hit.
[2024-05-29 03:11:41] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-29 03:11:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:11:42] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:43] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:43] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:11:43] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/242 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/242 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:46] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:11:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:47] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/242 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 2 ms to minimize.
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 180 constraints, problems are : Problem set: 0 solved, 115 unsolved in 8837 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 31/54 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/242 variables, 126/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 115/296 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 9/305 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:11:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:11:55] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:11:55] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:11:55] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:57] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:11:57] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:11:57] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:11:57] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:11:58] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:12:02] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:12:02] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/242 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:12:04] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:12:04] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:12:04] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:12:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:12:08] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/242 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:12:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/242 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:12:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/242 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:12:19] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:12:20] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2024-05-29 03:12:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 328 constraints, problems are : Problem set: 0 solved, 115 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 64/64 constraints]
After SMT, in 38859ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 38860ms
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 116/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39038 ms. Remains : 126/137 places, 116/127 transitions.
[2024-05-29 03:12:20] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:12:20] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:12:20] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-29 03:12:20] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:12:20] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:12:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality6600432496217039981.gal : 1 ms
[2024-05-29 03:12:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality15153117677371667999.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/CTLCardinality6600432496217039981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15153117677371667999.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,4.76678e+12,24.3133,626676,2,31152,5,1.94903e+06,6,0,622,4.35809e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:12:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:12:50] [INFO ] Applying decomposition
[2024-05-29 03:12:50] [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/graph4250906274355028299.txt' '-o' '/tmp/graph4250906274355028299.bin' '-w' '/tmp/graph4250906274355028299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4250906274355028299.bin' '-l' '-1' '-v' '-w' '/tmp/graph4250906274355028299.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:12:50] [INFO ] Decomposing Gal with order
[2024-05-29 03:12:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:12:50] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:12:50] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:12:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:12:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14702696745494826999.gal : 1 ms
[2024-05-29 03:12:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality36394158606841666.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/CTLCardinality14702696745494826999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality36394158606841666.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,4.76678e+12,4.02599,114020,1923,57,192298,283,362,380073,45,1901,0


Converting to forward existential form...Done !
original formula: ((AF((((((i10.i0.u36.p95==0)||(i8.u45.p127==1)) * AX((i3.i0.u8.p18==0))) + (i8.u44.p119==1)) * !(A((((i8.u43.p121==0)||(i1.i0.u3.p8==1))|...357
=> equivalent forward existential formula: (([FwdG(Init,!((((((i10.i0.u36.p95==0)||(i8.u45.p127==1)) * !(EX(!((i3.i0.u8.p18==0))))) + (i8.u44.p119==1)) * !...526
Reverse transition relation is NOT exact ! Due to transitions t43, t49, t70, t73, t76, i0.u1.t80, i1.i1.u6.t79, i2.i0.u10.t75, i2.i1.u23.t56, i2.i1.u24.t9,...661
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 125 transition count 115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 124 transition count 114
Applied a total of 26 rules in 3 ms. Remains 124 /137 variables (removed 13) and now considering 114/127 (removed 13) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-05-29 03:13:20] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:13:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 03:13:20] [INFO ] Invariant cache hit.
[2024-05-29 03:13:20] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:13:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:13:21] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:13:22] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:13:22] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:22] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:13:22] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 03:13:22] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:23] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:13:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:13:24] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:25] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5888 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:27] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:27] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:27] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:13:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:28] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:29] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:13:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:13:29] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:13:29] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:13:29] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:13:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:13:30] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:32] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:13:32] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:13:32] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:13:32] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:13:32] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:34] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:13:34] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:13:36] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:13:36] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:13:36] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:13:36] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:13:36] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:37] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:13:38] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:13:38] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:13:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:13:40] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:13:40] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:13:40] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:13:40] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19983 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 25882ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25883ms
Starting structural reductions in LTL mode, iteration 1 : 124/137 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26012 ms. Remains : 124/137 places, 114/127 transitions.
[2024-05-29 03:13:46] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:13:46] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:13:46] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-29 03:13:46] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:13:46] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:13:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality13252772019085181065.gal : 1 ms
[2024-05-29 03:13:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6406193710073303486.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/CTLCardinality13252772019085181065.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6406193710073303486.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,4.17748e+12,27.5481,615140,2,30408,5,1.915e+06,6,0,612,4.27745e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:14:16] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:14:16] [INFO ] Applying decomposition
[2024-05-29 03:14:16] [INFO ] Flatten gal took : 3 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/graph17391692397690508227.txt' '-o' '/tmp/graph17391692397690508227.bin' '-w' '/tmp/graph17391692397690508227.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17391692397690508227.bin' '-l' '-1' '-v' '-w' '/tmp/graph17391692397690508227.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:14:16] [INFO ] Decomposing Gal with order
[2024-05-29 03:14:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:14:16] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:14:16] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:14:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 03:14:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality16740919545716868193.gal : 2 ms
[2024-05-29 03:14:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15879257597878492069.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/CTLCardinality16740919545716868193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15879257597878492069.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,4.17748e+12,3.47074,91040,1504,45,146191,350,337,304660,42,2185,0


Converting to forward existential form...Done !
original formula: E(EX(TRUE) U EX(AG(A((i2.i1.u17.p45==0) U (i4.i1.u20.p57==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,EX(TRUE))) * !(E(TRUE U !(!((E(!((i4.i1.u20.p57==1)) U (!((i2.i1.u17.p45==0)) * !((i4.i1.u20.p57=...205
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t47, t68, t71, t74, i0.u1.t78, i1.i1.u5.t77, i2.i0.u6.t76, i2.i1.u15.t65, i2.i1.u16...642
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 136 transition count 111
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 121 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 121 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 110 transition count 100
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 63 place count 99 transition count 89
Iterating global reduction 2 with 11 rules applied. Total rules applied 74 place count 99 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 74 place count 99 transition count 83
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 93 transition count 83
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 138 place count 67 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 65 transition count 55
Applied a total of 140 rules in 31 ms. Remains 65 /137 variables (removed 72) and now considering 55/127 (removed 72) transitions.
// Phase 1: matrix 55 rows 65 cols
[2024-05-29 03:14:46] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:14:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 03:14:46] [INFO ] Invariant cache hit.
[2024-05-29 03:14:46] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-29 03:14:46] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-29 03:14:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 03:14:47] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 55/120 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 52/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-29 03:14:47] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:14:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 143 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
After SMT, in 1787ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1788ms
Starting structural reductions in SI_CTL mode, iteration 1 : 65/137 places, 55/127 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1934 ms. Remains : 65/137 places, 55/127 transitions.
[2024-05-29 03:14:48] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:14:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:14:48] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-29 03:14:48] [INFO ] Flatten gal took : 1 ms
[2024-05-29 03:14:48] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:14:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality13339196635535302757.gal : 4 ms
[2024-05-29 03:14:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality9759932911370268433.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/CTLCardinality13339196635535302757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9759932911370268433.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.85729e+09,1.30863,45812,2,8224,5,145617,6,0,317,294504,0


Converting to forward existential form...Done !
original formula: EG(!(E((p88!=1) U AG(((p109==1)&&(p83==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E((p88!=1) U !(E(TRUE U !(((p109==1)&&(p83==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t23, t41, t42...305
(forward)formula 0,1,5.75615,165572,1,0,234,749032,140,64,2074,1.11509e+06,208
FORMULA ShieldPPPs-PT-002B-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 125 transition count 115
Applied a total of 24 rules in 5 ms. Remains 125 /137 variables (removed 12) and now considering 115/127 (removed 12) transitions.
// Phase 1: matrix 115 rows 125 cols
[2024-05-29 03:14:54] [INFO ] Computed 23 invariants in 4 ms
[2024-05-29 03:14:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 03:14:54] [INFO ] Invariant cache hit.
[2024-05-29 03:14:54] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-29 03:14:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:14:55] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:14:57] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:14:58] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:14:58] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 115/240 variables, 125/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:58] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:14:59] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:14:59] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:14:59] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:14:59] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:14:59] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:00] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:15:00] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:15:00] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:15:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:15:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:00] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 197 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7411 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 49/72 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:02] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:15:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:03] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:15:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/240 variables, 125/201 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 114/315 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 7/322 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:08] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:15:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/240 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:16] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:15:21] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:15:21] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/240 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:24] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:15:24] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:15:24] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:28] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/240 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/240 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 334 constraints, problems are : Problem set: 0 solved, 114 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 72/72 constraints]
After SMT, in 37431ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 37432ms
Starting structural reductions in LTL mode, iteration 1 : 125/137 places, 115/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37572 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:15:32] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:15:32] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:15:32] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-29 03:15:32] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:15:32] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:15:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality17070041204620959700.gal : 1 ms
[2024-05-29 03:15:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality14368988706715518842.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/CTLCardinality17070041204620959700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14368988706715518842.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1775e+12,25.8065,620600,2,30997,5,1.92434e+06,6,0,617,4.31601e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:16:02] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:16:02] [INFO ] Applying decomposition
[2024-05-29 03:16:02] [INFO ] Flatten gal took : 3 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/graph12440047812419007686.txt' '-o' '/tmp/graph12440047812419007686.bin' '-w' '/tmp/graph12440047812419007686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12440047812419007686.bin' '-l' '-1' '-v' '-w' '/tmp/graph12440047812419007686.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:16:02] [INFO ] Decomposing Gal with order
[2024-05-29 03:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:16:02] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:16:02] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:16:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 03:16:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality9750096041024408305.gal : 1 ms
[2024-05-29 03:16:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality7472115603584987834.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/CTLCardinality9750096041024408305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7472115603584987834.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,4.1775e+12,3.03891,81272,1611,43,139234,277,341,232829,42,1505,0


Converting to forward existential form...Done !
original formula: AX(AF((i5.u23.p71==1)))
=> equivalent forward existential formula: [FwdG(EY(Init),!((i5.u23.p71==1)))] = FALSE
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 : 137/137 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 125 transition count 115
Applied a total of 24 rules in 3 ms. Remains 125 /137 variables (removed 12) and now considering 115/127 (removed 12) transitions.
// Phase 1: matrix 115 rows 125 cols
[2024-05-29 03:16:32] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:16:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 03:16:32] [INFO ] Invariant cache hit.
[2024-05-29 03:16:32] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-29 03:16:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:16:33] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:16:34] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:16:34] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:16:34] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:34] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:16:34] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:16:34] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:34] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:16:35] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:35] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:16:35] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:16:35] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:35] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:16:36] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:36] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 115/240 variables, 125/177 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:37] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:37] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:16:37] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:16:37] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:16:37] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:38] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:16:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:39] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/240 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (OVERLAPS) 0/240 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 185 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8752 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 37/60 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:16:41] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:16:41] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:16:41] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:16:41] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:16:41] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:42] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/240 variables, 125/192 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 114/306 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:43] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:16:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:16:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:45] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:16:45] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:16:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:16:45] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:16:45] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:16:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:16:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 7/316 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:16:47] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:16:47] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:49] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:16:49] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:16:49] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:16:49] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:16:49] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:51] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:16:51] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:56] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/240 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:17:01] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/240 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 18 (OVERLAPS) 0/240 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 328 constraints, problems are : Problem set: 0 solved, 114 unsolved in 26095 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 66/66 constraints]
After SMT, in 34866ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 34867ms
Starting structural reductions in LTL mode, iteration 1 : 125/137 places, 115/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35002 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:17:07] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:17:07] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:17:07] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-29 03:17:07] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:17:07] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:17:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality12833792313271414932.gal : 1 ms
[2024-05-29 03:17:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality1324304851311314347.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/CTLCardinality12833792313271414932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1324304851311314347.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,4.70127e+12,24.7883,628140,2,31014,5,1.95612e+06,6,0,617,4.37602e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:17:37] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:17:37] [INFO ] Applying decomposition
[2024-05-29 03:17:37] [INFO ] Flatten gal took : 2 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/graph8336001998703373909.txt' '-o' '/tmp/graph8336001998703373909.bin' '-w' '/tmp/graph8336001998703373909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8336001998703373909.bin' '-l' '-1' '-v' '-w' '/tmp/graph8336001998703373909.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:17:37] [INFO ] Decomposing Gal with order
[2024-05-29 03:17:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:17:37] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:17:37] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:17:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:17:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality1413656384514759906.gal : 2 ms
[2024-05-29 03:17:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality12776512114167895345.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/CTLCardinality1413656384514759906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12776512114167895345.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,4.70127e+12,3.43288,88400,1749,51,135967,229,358,245764,50,1080,0


Converting to forward existential form...Done !
original formula: AX(A(AF((EX((i9.u47.p132==0)) + !(EX((i6.u35.p94==0))))) U AG(AX((i8.i1.u28.p76!=0)))))
=> equivalent forward existential formula: ([(EY(FwdU((FwdU(EY(Init),!(!(E(TRUE U !(!(EX(!((i8.i1.u28.p76!=0))))))))) * !(!(EG(!((EX((i9.u47.p132==0)) + !(...298
Reverse transition relation is NOT exact ! Due to transitions t42, t45, t48, t69, t72, i0.t75, i0.i1.u6.t78, i0.i2.u7.t77, i1.u23.t55, i1.u24.t9, i1.u24.t1...646
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 : 137/137 places, 127/127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 125 transition count 115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 124 transition count 114
Applied a total of 26 rules in 5 ms. Remains 124 /137 variables (removed 13) and now considering 114/127 (removed 13) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-05-29 03:18:07] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:18:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 03:18:07] [INFO ] Invariant cache hit.
[2024-05-29 03:18:07] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:18:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:18:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:10] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:18:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:18:10] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:18:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:12] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5940 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:14] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:18:14] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:18:20] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:18:22] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:18:22] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:18:22] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:18:22] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:18:23] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:24] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:18:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:18:24] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:18:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 26019ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26020ms
Starting structural reductions in LTL mode, iteration 1 : 124/137 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26175 ms. Remains : 124/137 places, 114/127 transitions.
[2024-05-29 03:18:33] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:18:33] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:18:33] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-29 03:18:33] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:18:33] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:18:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality8819189419410410154.gal : 1 ms
[2024-05-29 03:18:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality16801025175259526793.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/CTLCardinality8819189419410410154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16801025175259526793.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,4.17748e+12,24.0218,615408,2,30408,5,1.915e+06,6,0,612,4.27745e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:19:03] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:19:03] [INFO ] Applying decomposition
[2024-05-29 03:19:03] [INFO ] Flatten gal took : 2 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/graph13131548221280137690.txt' '-o' '/tmp/graph13131548221280137690.bin' '-w' '/tmp/graph13131548221280137690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13131548221280137690.bin' '-l' '-1' '-v' '-w' '/tmp/graph13131548221280137690.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:19:03] [INFO ] Decomposing Gal with order
[2024-05-29 03:19:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:19:03] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:19:03] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:19:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 03:19:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality14029062511770407849.gal : 13 ms
[2024-05-29 03:19:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality402201848311383570.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/CTLCardinality14029062511770407849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality402201848311383570.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,4.17748e+12,3.36139,92108,1774,42,146998,330,346,315668,42,1711,0


Converting to forward existential form...Done !
original formula: AX(AF(!(E((i9.i1.u31.p84==1) U (AF((i5.i0.u35.p93==1)) + EG((i2.i1.u25.p69==1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E((i9.i1.u31.p84==1) U (!(EG(!((i5.i0.u35.p93==1)))) + EG((i2.i1.u25.p69==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t68, t71, t74, i0.u1.t78, i1.i1.u6.t77, i2.i0.u10.t73, i2.i1.u23.t54, i2.i1.u24.t9,...649
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 SI_CTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 136 transition count 111
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 121 transition count 111
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 121 transition count 102
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 112 transition count 102
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 59 place count 101 transition count 91
Iterating global reduction 2 with 11 rules applied. Total rules applied 70 place count 101 transition count 91
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 70 place count 101 transition count 86
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 80 place count 96 transition count 86
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 136 place count 68 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 66 transition count 56
Applied a total of 138 rules in 17 ms. Remains 66 /137 variables (removed 71) and now considering 56/127 (removed 71) transitions.
// Phase 1: matrix 56 rows 66 cols
[2024-05-29 03:19:33] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 03:19:33] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 03:19:33] [INFO ] Invariant cache hit.
[2024-05-29 03:19:33] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-29 03:19:33] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 03:19:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 03:19:34] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:19:34] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 56/122 variables, 66/91 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 03:19:34] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/122 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 56/122 variables, 66/92 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 53/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1144 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 3/3 constraints]
After SMT, in 2225ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2228ms
Starting structural reductions in SI_CTL mode, iteration 1 : 66/137 places, 56/127 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2374 ms. Remains : 66/137 places, 56/127 transitions.
[2024-05-29 03:19:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:19:36] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:19:36] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-29 03:19:36] [INFO ] Flatten gal took : 1 ms
[2024-05-29 03:19:36] [INFO ] Flatten gal took : 1 ms
[2024-05-29 03:19:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality7009131423779719787.gal : 1 ms
[2024-05-29 03:19:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality752019625835656941.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/CTLCardinality7009131423779719787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality752019625835656941.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08995e+09,1.41954,50892,2,3353,5,163333,6,0,322,336221,0


Converting to forward existential form...Done !
original formula: EF(EG(E(((p55==0)||(p21==1)) U ((p117==0)||(p127==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),E(((p55==0)||(p21==1)) U ((p117==0)||(p127==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t39, t40, t41...300
(forward)formula 0,1,3.22793,87120,1,0,312,443334,138,117,2006,647165,283
FORMULA ShieldPPPs-PT-002B-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 03:19:39] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:19:39] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:19:39] [INFO ] Applying decomposition
[2024-05-29 03:19:39] [INFO ] Flatten gal took : 3 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/graph17789285157650768770.txt' '-o' '/tmp/graph17789285157650768770.bin' '-w' '/tmp/graph17789285157650768770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17789285157650768770.bin' '-l' '-1' '-v' '-w' '/tmp/graph17789285157650768770.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:19:39] [INFO ] Decomposing Gal with order
[2024-05-29 03:19:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:19:39] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:19:39] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:19:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 03:19:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality13191630707783175059.gal : 13 ms
[2024-05-29 03:19:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality3520016225078784413.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13191630707783175059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3520016225078784413.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 12 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.07158e+12,8.87996,199868,3751,64,310298,462,354,597461,53,2831,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((i1.i2.u8.p19==0)||(i7.i1.u45.p124==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((i1.i2.u8.p19==0)||(i7.i1.u45.p124==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t49, t52, t55, t80, t83, i0.u1.t90, i1.t86, i1.i1.u6.t89, i1.i1.u19.t73, i1.i1.u19.t74, i1.i2...796
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-29 03:22:13] [INFO ] Applying decomposition
[2024-05-29 03:22:13] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:22:13] [INFO ] Decomposing Gal with order
[2024-05-29 03:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:22:13] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-29 03:22:13] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 2 ms.
[2024-05-29 03:22:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality7095764941741824564.gal : 2 ms
[2024-05-29 03:22:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality7643561882889933558.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/CTLCardinality7095764941741824564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7643561882889933558.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 12 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.07158e+12,101.856,2527420,27760,276,4.82212e+06,1197,226,1.81846e+07,95,18002,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((i0.i1.i0.i0.i0.i0.i0.i0.i1.u12.p19==0)||(i1.i0.u43.p124==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((i0.i1.i0.i0.i0.i0.i0.i0.i1.u12.p19==0)||(i1.i0.u43.p124==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t90, i0.i1.u23.t11, i0.i1.u23.t12, i0.i1.u23.t13, i0.i1.u23.t63, i0.i1.u23.t66, i0.i1.i...1221
ITS-tools command line returned an error code 137
[2024-05-29 03:32:02] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:32:02] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-29 03:32:02] [INFO ] Transformed 137 places.
[2024-05-29 03:32:02] [INFO ] Transformed 127 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-29 03:32:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality14611646817341034142.gal : 7 ms
[2024-05-29 03:32:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality17249702232838424564.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/CTLCardinality14611646817341034142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17249702232838424564.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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 12 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.07158e+12,30.0132,728420,2,133053,5,2.13122e+06,6,0,677,5.11543e+06,0


Converting to forward existential form...Done !
original formula: EF(EG(AF(((p19==0)||(p124==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(((p19==0)||(p124==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t17, t18, t19, t20, t21, t22, t23, t24, t25, ...414
ITS-tools command line returned an error code 137
Total runtime 2535579 ms.

BK_STOP 1716954184033

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPs-PT-002B"
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 ShieldPPPs-PT-002B, 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 r356-tall-171683760900377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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