Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761000378.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761000378
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716951701212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
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
CTLFireability PT
Running Version 202405141337
[2024-05-29 03:01:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:01:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:01:42] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-29 03:01:42] [INFO ] Transformed 139 places.
[2024-05-29 03:01:42] [INFO ] Transformed 129 transitions.
[2024-05-29 03:01:42] [INFO ] Found NUPN structural information;
[2024-05-29 03:01:42] [INFO ] Parsed PT model containing 139 places and 129 transitions and 354 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 96 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 22 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:01:42] [INFO ] Computed 23 invariants in 12 ms
[2024-05-29 03:01:42] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 03:01:42] [INFO ] Invariant cache hit.
[2024-05-29 03:01:42] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-29 03:01:42] [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:01:43] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 10 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 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:01:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-29 03:01:44] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:45] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:46] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:01:46] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:01:46] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 127/264 variables, 137/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:47] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:01:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:01:47] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:48] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:01:48] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:01:48] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:01:48] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:01:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:50] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:51] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:01:51] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:01:51] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:01:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:52] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:01:52] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:01:52] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 17 (OVERLAPS) 0/264 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 218 constraints, problems are : Problem set: 0 solved, 126 unsolved in 11738 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 58/58 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, 58/81 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:01:55] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:01:56] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:01:57] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:01:58] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:59] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:01:59] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:01:59] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:01:59] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:01:59] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2024-05-29 03:01:59] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:01:59] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 47 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 10/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 5 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:00] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:01] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:02:01] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:02:01] [INFO ] Deduced a trap composed of 40 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:02:01] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:02:01] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:02:02] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:02:02] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:02:02] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 127/264 variables, 137/299 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 126/425 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:02:04] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:02:07] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:02:07] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:07] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:02:07] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:02:07] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:02:07] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:02:08] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:08] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:08] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:02:08] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:02:08] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 11/437 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:02:12] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:02:12] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/264 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:02:20] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 5 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/264 variables, 1/440 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 440 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 154/154 constraints]
After SMT, in 41803ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 41816ms
Starting structural reductions in LTL mode, iteration 1 : 137/139 places, 127/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42198 ms. Remains : 137/139 places, 127/129 transitions.
Support contains 96 out of 137 places after structural reductions.
[2024-05-29 03:02:24] [INFO ] Flatten gal took : 30 ms
[2024-05-29 03:02:25] [INFO ] Flatten gal took : 11 ms
[2024-05-29 03:02:25] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 40000 steps (100 resets) in 1695 ms. (23 steps per ms) remains 7/95 properties
BEST_FIRST walk for 40003 steps (20 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (23 resets) in 104 ms. (380 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (20 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (21 resets) in 86 ms. (459 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (25 resets) in 69 ms. (571 steps per ms) remains 4/5 properties
[2024-05-29 03:02:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/137 variables, 23/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 03:02:25] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:02:25] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
Problem AtomicPropp7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 127/264 variables, 137/162 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 162 constraints, problems are : Problem set: 3 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Int declared 15/264 variables, and 1 constraints, problems are : Problem set: 4 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/23 constraints, State Equation: 0/137 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/2 constraints]
After SMT, in 220ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-29 03:02:26] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:02:26] [INFO ] Flatten gal took : 11 ms
[2024-05-29 03:02:26] [INFO ] Input system was already deterministic with 127 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
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 14 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:02:26] [INFO ] Computed 23 invariants in 5 ms
[2024-05-29 03:02:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 03:02:26] [INFO ] Invariant cache hit.
[2024-05-29 03:02:26] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-29 03:02:26] [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:02:26] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:02:26] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 20 places in 26 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:02:27] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:02:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:02:28] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:28] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:02:28] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:02:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:28] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:02:29] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 115/240 variables, 125/170 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:29] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:30] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:02:30] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:31] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/240 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:33] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:02:33] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/240 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:35] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:02:35] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:02:35] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:02:35] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/240 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/240 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:36] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/240 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/240 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:02:37] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:02:37] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:37] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:02:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:02:37] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/240 variables, 6/190 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:38] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/240 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 24 (OVERLAPS) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 191 constraints, problems are : Problem set: 0 solved, 114 unsolved in 13835 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 43/43 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, 43/66 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/240 variables, 125/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 114/305 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:02:41] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:02:42] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:02:42] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 7/312 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:43] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:02:44] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 7/319 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:45] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-29 03:02:46] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:48] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:02:48] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:02:48] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:51] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-29 03:02:51] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:52] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:02:53] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-29 03:02:54] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 9/339 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:02:57] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:03:00] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:03:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:03:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:03:03] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:03:04] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:03:06] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:03:07] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:03:07] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 3/349 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 349 constraints, problems are : Problem set: 0 solved, 114 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 87/87 constraints]
After SMT, in 43862ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 43863ms
Starting structural reductions in LTL mode, iteration 1 : 125/137 places, 115/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44033 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:03:10] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:03:10] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:03:10] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-29 03:03:10] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:03:10] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:03:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9165914524218670418.gal : 3 ms
[2024-05-29 03:03:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10930898988329533639.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9165914524218670418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10930898988329533639.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.17986e+12,24.996,636464,2,31454,5,1.95879e+06,6,0,617,4.42201e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:03:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:03:40] [INFO ] Applying decomposition
[2024-05-29 03:03:40] [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/graph15769356863442616329.txt' '-o' '/tmp/graph15769356863442616329.bin' '-w' '/tmp/graph15769356863442616329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15769356863442616329.bin' '-l' '-1' '-v' '-w' '/tmp/graph15769356863442616329.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:03:40] [INFO ] Decomposing Gal with order
[2024-05-29 03:03:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:03:40] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:03:40] [INFO ] Flatten gal took : 48 ms
[2024-05-29 03:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 03:03:40] [INFO ] Time to serialize gal into /tmp/CTLFireability709503295719062082.gal : 7 ms
[2024-05-29 03:03:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17578049716197337994.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/CTLFireability709503295719062082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17578049716197337994.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.17986e+12,3.8274,104224,1677,42,173909,314,355,299390,42,1579,0


Converting to forward existential form...Done !
original formula: AF((A(EX(((((i3.i0.u14.p35==1)&&(i3.i1.u21.p58==1))||(i2.i1.u23.p68==1)) * AF((i4.i1.u3.p9==1)))) U (i1.u16.p38==1)) + (!(A(EF((i2.i1.u23...265
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((i1.u16.p38==1)) U (!(EX(((((i3.i0.u14.p35==1)&&(i3.i1.u21.p58==1))||(i2.i1.u23.p68==1)) * ...520
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t47, t69, t72, i0.u1.t79, i1.t66, i1.u16.t68, i1.u17.t3, i1.u17.t4, i1.u17.t5, i2.i...656
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 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 100 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 100 transition count 90
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 72 place count 100 transition count 85
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 82 place count 95 transition count 85
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 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 38 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:04:10] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 03:04:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 03:04:10] [INFO ] Invariant cache hit.
[2024-05-29 03:04:10] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-29 03:04:10] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-29 03:04:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-29 03:04:10] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/122 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 90 constraints, problems are : Problem set: 0 solved, 55 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/122 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 55/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 145 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
After SMT, in 1933ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1934ms
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 2132 ms. Remains : 66/137 places, 56/127 transitions.
[2024-05-29 03:04:12] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:04:12] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:04:12] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-29 03:04:12] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:04:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:04:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13683865222822289674.gal : 4 ms
[2024-05-29 03:04:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14722792541948879464.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/CTLFireability13683865222822289674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14722792541948879464.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,2.61523e+09,0.989253,37624,2,3621,5,113579,6,0,323,246102,0


Converting to forward existential form...Done !
original formula: EF(((p129==1) + (A(!(((p108==1)&&(p132==1))) U AF((p55==1))) * EG((((p41==1)||((p95==1)&&(p135==1)))&&((p100==0)||(p133==0)))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p129==1))] != FALSE + [FwdG((FwdU(Init,TRUE) * !((E(!(!(EG(!((p55==1))))) U (!(!(((p108==1...299
(forward)formula 0,1,0.990027,37624,1,0,7,113579,8,1,326,246102,1
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 136 transition count 113
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 123 transition count 113
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 26 place count 123 transition count 100
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 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 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 132 place count 70 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 68 transition count 58
Applied a total of 134 rules in 26 ms. Remains 68 /137 variables (removed 69) and now considering 58/127 (removed 69) transitions.
// Phase 1: matrix 58 rows 68 cols
[2024-05-29 03:04:13] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:04:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 03:04:13] [INFO ] Invariant cache hit.
[2024-05-29 03:04:13] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-29 03:04:13] [INFO ] Redundant transitions in 4 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-29 03:04:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 03:04:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:04:14] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:04:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
[2024-05-29 03:04:14] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
[2024-05-29 03:04:14] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 58/126 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 96 constraints, problems are : Problem set: 0 solved, 56 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 58/126 variables, 68/96 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 56/152 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-29 03:04:15] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 153 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 6/6 constraints]
After SMT, in 2348ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2352ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/137 places, 58/127 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2521 ms. Remains : 68/137 places, 58/127 transitions.
[2024-05-29 03:04:16] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:04:16] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:04:16] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-29 03:04:16] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:04:16] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:04:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12079602666435976248.gal : 1 ms
[2024-05-29 03:04:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16645666328044756342.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/CTLFireability12079602666435976248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16645666328044756342.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.81876e+09,1.12046,42080,2,4612,5,134859,6,0,331,265691,0


Converting to forward existential form...Done !
original formula: EG((!(E(((p16==1)&&(p49==1)) U AG(!(((p30==1)&&(p120==1)))))) * AF(((AG(((p102==0)||(p122==0))) + AF((p76==0))) + AG(((p30==0)||(p120==0)...161
=> equivalent forward existential formula: [FwdG(Init,(!(E(((p16==1)&&(p49==1)) U !(E(TRUE U !(!(((p30==1)&&(p120==1)))))))) * !(EG(!(((!(E(TRUE U !(((p102...252
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, t22, t23, t39...310
Detected timeout of ITS tools.
[2024-05-29 03:04:46] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:04:46] [INFO ] Applying decomposition
[2024-05-29 03:04:46] [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/graph18289766397244458520.txt' '-o' '/tmp/graph18289766397244458520.bin' '-w' '/tmp/graph18289766397244458520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18289766397244458520.bin' '-l' '-1' '-v' '-w' '/tmp/graph18289766397244458520.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:04:46] [INFO ] Decomposing Gal with order
[2024-05-29 03:04:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:04:46] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-29 03:04:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:04:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2024-05-29 03:04:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1143279337338111251.gal : 2 ms
[2024-05-29 03:04:46] [INFO ] Time to serialize properties into /tmp/CTLFireability10171625376645537392.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/CTLFireability1143279337338111251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10171625376645537392.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.81876e+09,1.4398,46292,759,38,74281,123,183,141546,48,539,0


Converting to forward existential form...Done !
original formula: EG((!(E(((i2.u3.p16==1)&&(i2.u9.p49==1)) U AG(!(((i0.u6.p30==1)&&(i7.u21.p120==1)))))) * AF(((AG(((i5.i0.u19.p102==0)||(i7.u21.p122==0)))...223
=> equivalent forward existential formula: [FwdG(Init,(!(E(((i2.u3.p16==1)&&(i2.u9.p49==1)) U !(E(TRUE U !(!(((i0.u6.p30==1)&&(i7.u21.p120==1)))))))) * !(E...314
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t8, t22, t23, t39, t46, t50, i0.t48, i0.t31, i0.u11.t5, i0.u11.t6, i1.t45, i1.t44, i1...444
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 5 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:05:16] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:05:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 03:05:16] [INFO ] Invariant cache hit.
[2024-05-29 03:05:16] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-29 03:05:16] [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:05:17] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:05:17] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:05:18] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:05:19] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 116/242 variables, 126/190 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:21] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:05:22] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:23] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:05:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:05:23] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:05:23] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:24] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:05:24] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:05:24] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:05:24] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/242 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:25] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:26] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:05:26] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:27] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:05:27] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/242 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/242 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 21 (OVERLAPS) 0/242 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 209 constraints, problems are : Problem set: 0 solved, 115 unsolved in 12501 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 60/60 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, 60/83 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:05:29] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:29] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:05:30] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/242 variables, 126/214 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 115/329 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:31] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:05:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:33] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:05:33] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:05:34] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:05:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:05:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 5/336 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:36] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:05:37] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/242 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:05:45] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:05:48] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 342 constraints, problems are : Problem set: 0 solved, 115 unsolved in 29254 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 78/78 constraints]
After SMT, in 41769ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 41771ms
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 116/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41913 ms. Remains : 126/137 places, 116/127 transitions.
[2024-05-29 03:05:58] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:05:58] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:05:58] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-29 03:05:58] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:05:58] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:05:58] [INFO ] Time to serialize gal into /tmp/CTLFireability12120768896901281332.gal : 4 ms
[2024-05-29 03:05:58] [INFO ] Time to serialize properties into /tmp/CTLFireability8517069913077941282.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/CTLFireability12120768896901281332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8517069913077941282.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,5.35974e+12,27.9544,719096,2,33502,5,2.19602e+06,6,0,622,5.01358e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:06:28] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:06:28] [INFO ] Applying decomposition
[2024-05-29 03:06:28] [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/graph16402255979042489098.txt' '-o' '/tmp/graph16402255979042489098.bin' '-w' '/tmp/graph16402255979042489098.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16402255979042489098.bin' '-l' '-1' '-v' '-w' '/tmp/graph16402255979042489098.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:06:28] [INFO ] Decomposing Gal with order
[2024-05-29 03:06:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:06:28] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:06:28] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:06:28] [INFO ] Time to serialize gal into /tmp/CTLFireability1405932637070150618.gal : 3 ms
[2024-05-29 03:06:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12335197191854361319.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/CTLFireability1405932637070150618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12335197191854361319.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.35974e+12,5.39492,150392,2712,69,282337,384,376,467618,53,2398,0


Converting to forward existential form...Done !
original formula: (AG((AF(((i0.u20.p57==0) * AF(((i8.u30.p87==0)||(i9.u31.p89==0))))) + AF(((i10.i0.u33.p92==1) * AG((i4.i1.u2.p6==1)))))) * (A((((i0.u8.p2...492
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(!(EG(!(((i0.u20.p57==0) * !(EG(!(((i8.u30.p87==0)||(i9.u31.p89==0))))))))))),!(((i10...1108
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t49, t70, t73, t76, i0.u6.t78, i0.u20.t6, i0.u20.t7, i0.u20.t8, i1.i0.u9.t75, i1.i1...632
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
Applied a total of 20 rules in 11 ms. Remains 127 /137 variables (removed 10) and now considering 117/127 (removed 10) transitions.
// Phase 1: matrix 117 rows 127 cols
[2024-05-29 03:06:58] [INFO ] Computed 23 invariants in 3 ms
[2024-05-29 03:06:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 03:06:58] [INFO ] Invariant cache hit.
[2024-05-29 03:06:58] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-29 03:06:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:06:59] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:07:00] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:07:01] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:07:01] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:07:01] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:07:01] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:07:01] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 117/244 variables, 127/180 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:07:02] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:07:03] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:04] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:04] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:07:04] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:05] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:07:06] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:07] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:07:07] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:07:07] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:07:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:07:07] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:07:07] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:07:08] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:07:08] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:07:08] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 9/204 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/244 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:09] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/244 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/244 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 20 (OVERLAPS) 0/244 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 205 constraints, problems are : Problem set: 0 solved, 116 unsolved in 12053 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 55/78 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/244 variables, 127/205 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 116/321 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:07:12] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:15] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:07:15] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:07:15] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:07:15] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-29 03:07:16] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/244 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:24] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:07:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:07:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:28] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-29 03:07:30] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:07:31] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:07:31] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (OVERLAPS) 0/244 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 342 constraints, problems are : Problem set: 0 solved, 116 unsolved in 28766 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 76/76 constraints]
After SMT, in 40833ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 40834ms
Starting structural reductions in LTL mode, iteration 1 : 127/137 places, 117/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40983 ms. Remains : 127/137 places, 117/127 transitions.
[2024-05-29 03:07:39] [INFO ] Flatten gal took : 8 ms
[2024-05-29 03:07:39] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:07:39] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-29 03:07:39] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:07:39] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:07:39] [INFO ] Time to serialize gal into /tmp/CTLFireability13772627559062023758.gal : 2 ms
[2024-05-29 03:07:39] [INFO ] Time to serialize properties into /tmp/CTLFireability5589919276029637744.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/CTLFireability13772627559062023758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5589919276029637744.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.24328e+12,28.2816,742832,2,54447,5,2.2555e+06,6,0,627,5.20816e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:08:09] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:08:09] [INFO ] Applying decomposition
[2024-05-29 03:08:09] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12064564670822593878.txt' '-o' '/tmp/graph12064564670822593878.bin' '-w' '/tmp/graph12064564670822593878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12064564670822593878.bin' '-l' '-1' '-v' '-w' '/tmp/graph12064564670822593878.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:08:09] [INFO ] Decomposing Gal with order
[2024-05-29 03:08:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:08:09] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:08:09] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:08:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:08:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13032924060500973215.gal : 2 ms
[2024-05-29 03:08:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6067478382856209891.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/CTLFireability13032924060500973215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6067478382856209891.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.24328e+12,2.77396,82368,2514,42,138103,333,349,268340,42,1790,0


Converting to forward existential form...Done !
original formula: !(A(A((((((((i5.i0.u30.p88==1)&&(i5.i1.u44.p125==1))||(i5.i1.u42.p118==1)) * E((i7.u40.p105==1) U (i4.i0.u26.p75==1))) * AF(((i2.i0.u10.p...454
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(!(EX(!(((i6.i0.u34.p95==1)&&(i6.i1.u47.p136==1))))) U !(!(E(TRUE U !(((i3.i0...1030
Reverse transition relation is NOT exact ! Due to transitions t42, t45, t48, t70, t73, t76, i0.i1.u5.t79, i0.i2.u1.t80, i1.i0.u12.t72, i1.i1.u22.t55, i1.i1...679
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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:08:39] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:08:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 03:08:39] [INFO ] Invariant cache hit.
[2024-05-29 03:08:39] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:08:39] [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:08:40] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:08:40] [INFO ] Deduced a trap composed of 20 places in 33 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:08:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:08:41] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:08:41] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 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:08:41] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:08:41] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:08:41] [INFO ] Deduced a trap composed of 35 places in 43 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:08:42] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:08:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 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:08:43] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:08:43] [INFO ] Deduced a trap composed of 18 places in 30 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:08:44] [INFO ] Deduced a trap composed of 36 places in 47 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 5943 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:08:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 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:08:46] [INFO ] Deduced a trap composed of 34 places in 40 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:08:46] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:08:46] [INFO ] Deduced a trap composed of 20 places in 39 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:08:47] [INFO ] Deduced a trap composed of 20 places in 34 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:08:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:48] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:08:48] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:08:48] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:08:48] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:08:49] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:08:49] [INFO ] Deduced a trap composed of 19 places in 38 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:08:50] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:08:51] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:08:51] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:08:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:08:51] [INFO ] Deduced a trap composed of 16 places in 35 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:08:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:08:52] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 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:08:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:08:54] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:08:54] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:08:55] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:08:55] [INFO ] Deduced a trap composed of 26 places in 28 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:08:56] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:08:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 8 ms to minimize.
[2024-05-29 03:08:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:57] [INFO ] Deduced a trap composed of 18 places in 35 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:08:59] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:08:59] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:08:59] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:08:59] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 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 19656 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 25618ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25619ms
Starting structural reductions in LTL mode, iteration 1 : 124/137 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25765 ms. Remains : 124/137 places, 114/127 transitions.
[2024-05-29 03:09:05] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:09:05] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:09:05] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-29 03:09:05] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:09:05] [INFO ] Flatten gal took : 19 ms
[2024-05-29 03:09:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13279178508857680190.gal : 1 ms
[2024-05-29 03:09:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1806459034656426187.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/CTLFireability13279178508857680190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1806459034656426187.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,22.9797,615372,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:09:35] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:09:35] [INFO ] Applying decomposition
[2024-05-29 03:09:35] [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/graph17891491069146907589.txt' '-o' '/tmp/graph17891491069146907589.bin' '-w' '/tmp/graph17891491069146907589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17891491069146907589.bin' '-l' '-1' '-v' '-w' '/tmp/graph17891491069146907589.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:09:35] [INFO ] Decomposing Gal with order
[2024-05-29 03:09:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:09:35] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:09:35] [INFO ] Flatten gal took : 18 ms
[2024-05-29 03:09:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:09:35] [INFO ] Time to serialize gal into /tmp/CTLFireability13436367560632400266.gal : 5 ms
[2024-05-29 03:09:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14143155385125906279.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/CTLFireability13436367560632400266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14143155385125906279.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.63314,96868,1647,44,152647,268,355,292868,42,1396,0


Converting to forward existential form...Done !
original formula: AX(AG(AX(EF((i2.i1.u16.p37==0)))))
=> equivalent forward existential formula: [(EY(FwdU(EY(Init),TRUE)) * !(E(TRUE U (i2.i1.u16.p37==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t47, t68, t71, t74, i0.i0.u13.t70, i0.i1.u23.t54, i0.i1.u24.t9, i0.i1.u24.t10, i0.i...643
(forward)formula 0,1,4.46316,96868,1,0,152647,326,1657,292868,198,1396,131929
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 136 transition count 115
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 125 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 124 transition count 114
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 24 place count 124 transition count 102
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 48 place count 112 transition count 102
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 59 place count 101 transition count 91
Iterating global reduction 3 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 3 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 3 with 10 rules applied. Total rules applied 80 place count 96 transition count 86
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 122 place count 75 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 73 transition count 63
Applied a total of 124 rules in 17 ms. Remains 73 /137 variables (removed 64) and now considering 63/127 (removed 64) transitions.
// Phase 1: matrix 63 rows 73 cols
[2024-05-29 03:09:40] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 03:09:40] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 03:09:40] [INFO ] Invariant cache hit.
[2024-05-29 03:09:40] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-29 03:09:40] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-29 03:09:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 2/73 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 03:09:40] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:09:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:09:40] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:09:41] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:09:41] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:09:41] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 03:09:41] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 63/136 variables, 73/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 03:09:42] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/136 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 104 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2492 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 2/73 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 63/136 variables, 73/104 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 61/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-29 03:09:43] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:09:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/136 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/136 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 167 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2085 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 10/10 constraints]
After SMT, in 4589ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4594ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/137 places, 63/127 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4783 ms. Remains : 73/137 places, 63/127 transitions.
[2024-05-29 03:09:44] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:09:44] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:09:44] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-29 03:09:44] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:09:44] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:09:44] [INFO ] Time to serialize gal into /tmp/CTLFireability5155456234296818087.gal : 1 ms
[2024-05-29 03:09:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10787151037343995829.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/CTLFireability5155456234296818087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10787151037343995829.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.14594e+09,1.48444,53432,2,10264,5,179699,6,0,356,345032,0


Converting to forward existential form...Done !
original formula: AG((E((((((p30==1)&&(p120==1))&&((p39==1)&&(p90==1)))||((p98==1)&&(p66==1)))||((p64==1)||(p118==1))) U AF(!(((p19==1)&&(p43==1))))) + ((p...175
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p83==1)&&(p116==1)))) * !(E((((((p30==1)&&(p120==1))&&((p39==1)&&(p90==1)))||((p98==1)&...238
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t31, t32...305
(forward)formula 0,1,21.5023,638720,1,0,871,3.42665e+06,152,312,2245,5.34661e+06,969
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

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 8 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:10:06] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:10:06] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 03:10:06] [INFO ] Invariant cache hit.
[2024-05-29 03:10:06] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-29 03:10:06] [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:10:07] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:10:07] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:10:08] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:10:08] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:10:08] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:10:08] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:10:08] [INFO ] Deduced a trap composed of 38 places in 41 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:10:08] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 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:10:08] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:10:08] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:09] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 116/242 variables, 126/168 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:10] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:10:10] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:10:10] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:10:10] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 03:10:10] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:10:10] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:10] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:10:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:11] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:10:11] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:10:12] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2024-05-29 03:10:12] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:12] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 181 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7296 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 32/32 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, 32/55 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/242 variables, 126/181 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 115/296 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:15] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:16] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:10:16] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 4 ms to minimize.
[2024-05-29 03:10:16] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-29 03:10:17] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:10:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:10:17] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:10:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:10:17] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:19] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:10:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 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:10:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:10:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:22] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 03:10:22] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 03:10:22] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:24] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-29 03:10:24] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:26] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:29] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:10:29] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:10:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/242 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/242 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:36] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:10:36] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/242 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-29 03:10:40] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/242 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 322 constraints, problems are : Problem set: 0 solved, 115 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 58/58 constraints]
After SMT, in 37318ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 37319ms
Starting structural reductions in LTL mode, iteration 1 : 126/137 places, 116/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37551 ms. Remains : 126/137 places, 116/127 transitions.
[2024-05-29 03:10:44] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:10:44] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:10:44] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-29 03:10:44] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:10:44] [INFO ] Flatten gal took : 17 ms
[2024-05-29 03:10:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16928039560171248014.gal : 1 ms
[2024-05-29 03:10:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5926046794816200414.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/CTLFireability16928039560171248014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5926046794816200414.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:11:14] [INFO ] Flatten gal took : 15 ms
[2024-05-29 03:11:14] [INFO ] Applying decomposition
[2024-05-29 03:11:14] [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/graph14842999443663117383.txt' '-o' '/tmp/graph14842999443663117383.bin' '-w' '/tmp/graph14842999443663117383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14842999443663117383.bin' '-l' '-1' '-v' '-w' '/tmp/graph14842999443663117383.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:11:14] [INFO ] Decomposing Gal with order
[2024-05-29 03:11:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:11:14] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:11:14] [INFO ] Flatten gal took : 17 ms
[2024-05-29 03:11:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 03:11:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16167838316398223629.gal : 1 ms
[2024-05-29 03:11:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7872738138258769146.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/CTLFireability16167838316398223629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7872738138258769146.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.37604e+12,4.9423,120624,1787,78,182732,435,355,354917,53,3384,0


Converting to forward existential form...Done !
original formula: EX(E(!((EF((i1.i1.u20.p56==1)) * EF((i3.u23.p65==1)))) U ((i2.i1.u16.p41==1)||(i0.i0.u3.p7==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),!((E(TRUE U (i1.i1.u20.p56==1)) * E(TRUE U (i3.u23.p65==1))))) * ((i2.i1.u16.p41==1)||(i0.i0.u3....173
Reverse transition relation is NOT exact ! Due to transitions t43, t46, t49, t70, t73, i0.t76, i0.i0.u5.t79, i0.i1.u6.t78, i1.i0.u12.t72, i1.i1.u19.t61, i1...675
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 128 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 128 transition count 118
Applied a total of 18 rules in 2 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:11:44] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:11:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 03:11:44] [INFO ] Invariant cache hit.
[2024-05-29 03:11:44] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-29 03:11:44] [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:11:45] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:11:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:11:46] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:11:46] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/246 variables, 128/171 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:46] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:47] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:11:47] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:11:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:11:47] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:11:47] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:11:48] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:49] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:11:49] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:11:49] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:49] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:50] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 186 constraints, problems are : Problem set: 0 solved, 117 unsolved in 7519 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 35/35 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, 35/58 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 22 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 33 ms of which 1 ms to minimize.
[2024-05-29 03:11:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 118/246 variables, 128/191 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 117/308 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:53] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:11:53] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:11:54] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:11:54] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:11:54] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:11:54] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 6/314 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:56] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:11:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:11:56] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:11:56] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:11:56] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:11:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:11:57] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:11:58] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:11:58] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:11:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:11:58] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:12:00] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:12:02] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:12:02] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:12:06] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:12:06] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/246 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:12:08] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-29 03:12:10] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 17 (OVERLAPS) 0/246 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 332 constraints, problems are : Problem set: 0 solved, 117 unsolved in 23621 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 64/64 constraints]
After SMT, in 31155ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 31158ms
Starting structural reductions in LTL mode, iteration 1 : 128/137 places, 118/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31314 ms. Remains : 128/137 places, 118/127 transitions.
[2024-05-29 03:12:15] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:12:15] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:12:15] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-29 03:12:15] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:12:15] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:12:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10086815266806073222.gal : 1 ms
[2024-05-29 03:12:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10501024507380838182.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/CTLFireability10086815266806073222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10501024507380838182.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:12:45] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:12:45] [INFO ] Applying decomposition
[2024-05-29 03:12:45] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14729752096009825950.txt' '-o' '/tmp/graph14729752096009825950.bin' '-w' '/tmp/graph14729752096009825950.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14729752096009825950.bin' '-l' '-1' '-v' '-w' '/tmp/graph14729752096009825950.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:12:45] [INFO ] Decomposing Gal with order
[2024-05-29 03:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:12:45] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:12:45] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:12:45] [INFO ] Time to serialize gal into /tmp/CTLFireability698342492810559864.gal : 11 ms
[2024-05-29 03:12:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5314459249697335348.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/CTLFireability698342492810559864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5314459249697335348.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,5.45275e+12,7.99673,196384,3148,64,310509,448,377,636341,53,2841,0


Converting to forward existential form...Done !
original formula: AX(A(E(AX(EF(((i6.i0.u35.p93==1)&&(i8.u42.p111==1)))) U ((i0.u0.p1==1) * A(((i1.i2.u9.p19==1)&&(i2.i1.u17.p43==1)) U (i6.i1.u48.p131==1))...449
=> equivalent forward existential formula: ([((FwdU(EY(Init),!(E(!(E(TRUE U !((((i3.i0.u13.p30==1)&&(i9.u45.p120==1))&&((i8.u31.p83==1)&&(i5.i0.u43.p116==1...1230
Reverse transition relation is NOT exact ! Due to transitions t44, t47, t50, t71, t74, i0.u1.t81, i1.t77, i1.i1.u6.t80, i1.i2.u7.t79, i2.i0.u10.t76, i2.i1....669
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6 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:15] [INFO ] Computed 23 invariants in 7 ms
[2024-05-29 03:13:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 03:13:15] [INFO ] Invariant cache hit.
[2024-05-29 03:13:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:13:16] [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:16] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:13:16] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:13:16] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-29 03:13:16] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2024-05-29 03:13:16] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:13:16] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:13:16] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 20 places in 54 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:13:17] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:13:17] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 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:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:13:18] [INFO ] Deduced a trap composed of 17 places in 15 ms of which 0 ms to minimize.
[2024-05-29 03:13:18] [INFO ] Deduced a trap composed of 35 places in 46 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:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:13:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:13:19] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2024-05-29 03:13:19] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:13:19] [INFO ] Deduced a trap composed of 26 places in 37 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:20] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:13:20] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:13:20] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:13:20] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:13:20] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:13:20] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:13:20] [INFO ] Deduced a trap composed of 18 places in 48 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:13:21] [INFO ] Deduced a trap composed of 36 places in 47 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 6301 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:22] [INFO ] Deduced a trap composed of 16 places in 43 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:23] [INFO ] Deduced a trap composed of 34 places in 26 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:13:23] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:13:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 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:23] [INFO ] Deduced a trap composed of 20 places in 42 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:13:25] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:13:25] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:13:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:13:25] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:13:25] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:13:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:13:25] [INFO ] Deduced a trap composed of 19 places in 31 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:27] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:13:27] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:13:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:13:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:13:28] [INFO ] Deduced a trap composed of 16 places in 28 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:13:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:13:29] [INFO ] Deduced a trap composed of 17 places in 35 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:31] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:13:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:13:31] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:13:31] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:13:31] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:13:31] [INFO ] Deduced a trap composed of 26 places in 26 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:13:33] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:13:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:13:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:13:33] [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:35] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:13:36] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:13:36] [INFO ] Deduced a trap composed of 26 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 25 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 19803 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 26136ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26137ms
Starting structural reductions in LTL mode, iteration 1 : 124/137 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26302 ms. Remains : 124/137 places, 114/127 transitions.
[2024-05-29 03:13:42] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:13:42] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:13:42] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-29 03:13:42] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:13:42] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:13:42] [INFO ] Time to serialize gal into /tmp/CTLFireability8489471868729536620.gal : 1 ms
[2024-05-29 03:13:42] [INFO ] Time to serialize properties into /tmp/CTLFireability14376008328496385410.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/CTLFireability8489471868729536620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14376008328496385410.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,22.9768,615168,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:12] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:14:12] [INFO ] Applying decomposition
[2024-05-29 03:14:12] [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/graph10301478607048926589.txt' '-o' '/tmp/graph10301478607048926589.bin' '-w' '/tmp/graph10301478607048926589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10301478607048926589.bin' '-l' '-1' '-v' '-w' '/tmp/graph10301478607048926589.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:14:12] [INFO ] Decomposing Gal with order
[2024-05-29 03:14:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:14:12] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:14:12] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:14:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 03:14:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5218819992967563893.gal : 2 ms
[2024-05-29 03:14:12] [INFO ] Time to serialize properties into /tmp/CTLFireability11201132137770452574.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/CTLFireability5218819992967563893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11201132137770452574.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.17748e+12,5.00951,131432,1754,42,208315,313,341,472610,42,1714,0


Converting to forward existential form...Done !
original formula: (EG(((i6.i0.u34.p95==1)&&(i6.i1.u46.p136==1))) + AG(((i6.i1.u45.p131==0) + AX((i1.i0.u14.p32==1)))))
=> equivalent forward existential formula: [(EY((FwdU((Init * !(EG(((i6.i0.u34.p95==1)&&(i6.i1.u46.p136==1))))),TRUE) * !((i6.i1.u45.p131==0)))) * !((i1.i0...178
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t47, t68, t71, i0.t74, i0.i1.u6.t76, i0.i2.u5.t77, i1.i0.u12.t70, i1.i1.u19.t59, i1...648
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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:14:42] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 03:14:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 03:14:42] [INFO ] Invariant cache hit.
[2024-05-29 03:14:42] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-29 03:14:42] [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:43] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:14:43] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:44] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:14:44] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:14:44] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:14:44] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:14:44] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:14:46] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 115/240 variables, 125/188 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:47] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:14:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/240 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 190 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7073 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 42/42 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, 42/65 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:14:50] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:14:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:14:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:14:50] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:50] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:14:50] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:14:51] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:14:52] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:14:52] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:14:52] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:14:52] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:14:52] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 115/240 variables, 125/215 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 114/329 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:53] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:14:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:14:53] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:14:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:14:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 5/338 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:14:58] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:14:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:14:58] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-29 03:14:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 03:14:59] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 5/343 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:15:04] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/240 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (OVERLAPS) 0/240 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 345 constraints, problems are : Problem set: 0 solved, 114 unsolved in 22567 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 83/83 constraints]
After SMT, in 29652ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 29653ms
Starting structural reductions in LTL mode, iteration 1 : 125/137 places, 115/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29800 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:15:12] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:15:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:15:12] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-29 03:15:12] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:15:12] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:15:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8651581331173884053.gal : 1 ms
[2024-05-29 03:15:12] [INFO ] Time to serialize properties into /tmp/CTLFireability1414633522569372679.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/CTLFireability8651581331173884053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1414633522569372679.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 03:15:42] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:15:42] [INFO ] Applying decomposition
[2024-05-29 03:15:42] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16860061156679619500.txt' '-o' '/tmp/graph16860061156679619500.bin' '-w' '/tmp/graph16860061156679619500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16860061156679619500.bin' '-l' '-1' '-v' '-w' '/tmp/graph16860061156679619500.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:15:42] [INFO ] Decomposing Gal with order
[2024-05-29 03:15:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:15:42] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:15:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:15:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:15:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13507932810366755664.gal : 2 ms
[2024-05-29 03:15:42] [INFO ] Time to serialize properties into /tmp/CTLFireability12712307077915515650.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/CTLFireability13507932810366755664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12712307077915515650.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.18759e+12,5.19627,123816,1980,42,189987,391,347,397583,46,2342,0


Converting to forward existential form...Done !
original formula: EG((((i3.i1.u18.p45==1) + !(E(AF(((i4.i0.u15.p35==1)&&(i2.i1.u21.p55==1))) U (i3.i0.u11.p25==1)))) + (EX((((i5.i1.u30.p82==0)||(i5.i1.u42...242
=> equivalent forward existential formula: [FwdG(Init,(((i3.i1.u18.p45==1) + !(E(!(EG(!(((i4.i0.u15.p35==1)&&(i2.i1.u21.p55==1))))) U (i3.i0.u11.p25==1))))...303
Reverse transition relation is NOT exact ! Due to transitions t42, t45, t48, t69, t72, t75, i0.u1.t79, i1.i1.u6.t78, i2.i0.u7.t77, i2.i1.u20.t60, i2.i1.u21...688
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 1 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:12] [INFO ] Computed 23 invariants in 3 ms
[2024-05-29 03:16:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 03:16:12] [INFO ] Invariant cache hit.
[2024-05-29 03:16:12] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-29 03:16:12] [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:13] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:16:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 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:16:14] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:16:14] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:16:14] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:16:14] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:16:14] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:16:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:16:14] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:16:14] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/240 variables, 125/174 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:15] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:16:16] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:16:16] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:16:16] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:17] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/240 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:18] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:16:18] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:16:18] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:16:18] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:16:18] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:18] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:19] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:16:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:16:19] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:20] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:16:20] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:21] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:16:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/240 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:22] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/240 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/240 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 20 (OVERLAPS) 0/240 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 194 constraints, problems are : Problem set: 0 solved, 114 unsolved in 11443 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 46/46 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, 46/69 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/240 variables, 125/199 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 114/313 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:16:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:16:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:28] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:16:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:16:28] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:16:29] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:16:29] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:16:29] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:16:29] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 7/325 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:32] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/240 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:34] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:37] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:16:39] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:16:39] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:16:39] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:16:39] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:16:39] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:16:39] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 7/335 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:43] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/240 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-29 03:16:45] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 18 (OVERLAPS) 0/240 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 337 constraints, problems are : Problem set: 0 solved, 114 unsolved in 28285 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 75/75 constraints]
After SMT, in 39739ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 39740ms
Starting structural reductions in LTL mode, iteration 1 : 125/137 places, 115/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39883 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:16:52] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:16:52] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:16:52] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-29 03:16:52] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:16:52] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:16:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5090888543939409548.gal : 0 ms
[2024-05-29 03:16:52] [INFO ] Time to serialize properties into /tmp/CTLFireability293199723261053096.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/CTLFireability5090888543939409548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability293199723261053096.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,4.17751e+12,24.7144,623500,2,31088,5,1.93501e+06,6,0,617,4.34153e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:17:22] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:17:22] [INFO ] Applying decomposition
[2024-05-29 03:17:22] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10785944656624689810.txt' '-o' '/tmp/graph10785944656624689810.bin' '-w' '/tmp/graph10785944656624689810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10785944656624689810.bin' '-l' '-1' '-v' '-w' '/tmp/graph10785944656624689810.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:17:22] [INFO ] Decomposing Gal with order
[2024-05-29 03:17:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:17:22] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:17:22] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:17:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:17:22] [INFO ] Time to serialize gal into /tmp/CTLFireability12771256330402655067.gal : 16 ms
[2024-05-29 03:17:22] [INFO ] Time to serialize properties into /tmp/CTLFireability80026727595464172.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/CTLFireability12771256330402655067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability80026727595464172.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.17751e+12,5.45277,131960,1806,37,213313,282,343,435982,42,1668,0


Converting to forward existential form...Done !
original formula: E(EX(EF(AG(EX(((i1.i1.u6.p15==1)&&(i1.i0.u19.p50==1)))))) U (AF(EX(EG(((i7.i0.u34.p93==1)&&(i7.i1.u40.p111==1))))) + EX(E(((AG(((i6.u38.p...254
=> equivalent forward existential formula: ([(FwdU(Init,EX(E(TRUE U !(E(TRUE U !(EX(((i1.i1.u6.p15==1)&&(i1.i0.u19.p50==1))))))))) * !(EG(!(EX(EG(((i7.i0.u...437
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t47, t69, t72, i0.u1.t79, i1.t75, i1.i1.u6.t78, i1.i2.u7.t77, i2.i0.u13.t71, i2.i1....645
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 2 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:17:52] [INFO ] Computed 23 invariants in 3 ms
[2024-05-29 03:17:52] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 03:17:52] [INFO ] Invariant cache hit.
[2024-05-29 03:17:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-29 03:17:52] [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:17:53] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:17:53] [INFO ] Deduced a trap composed of 20 places in 33 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:17:54] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 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:17:54] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 35 places in 30 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:17:55] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:17:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:17:55] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:17:55] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 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:17:56] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 18 places in 36 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:17:57] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 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 5923 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:17:58] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 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:17:59] [INFO ] Deduced a trap composed of 34 places in 57 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:17:59] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 20 places in 56 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:17:59] [INFO ] Deduced a trap composed of 20 places in 33 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:01] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:18:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 03:18:01] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:18:01] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 03:18:01] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-05-29 03:18:01] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:18:01] [INFO ] Deduced a trap composed of 19 places in 35 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:18:03] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:18:04] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 03:18:04] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:18:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:18:04] [INFO ] Deduced a trap composed of 16 places in 29 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:18:05] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 03:18:05] [INFO ] Deduced a trap composed of 17 places in 19 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:07] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:18:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:18:07] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:18:07] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:18:07] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:18:07] [INFO ] Deduced a trap composed of 26 places in 19 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:18:09] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 11 ms to minimize.
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:18:09] [INFO ] Deduced a trap composed of 18 places in 36 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:18:11] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:18:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:18:12] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:18:12] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 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 19747 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 25695ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 25696ms
Starting structural reductions in LTL mode, iteration 1 : 124/137 places, 114/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25857 ms. Remains : 124/137 places, 114/127 transitions.
[2024-05-29 03:18:18] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:18:18] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:18:18] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-29 03:18:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:18:18] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:18:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3556532595699611063.gal : 3 ms
[2024-05-29 03:18:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10455613595173992382.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/CTLFireability3556532595699611063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10455613595173992382.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,23.2262,616228,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:18:48] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:18:48] [INFO ] Applying decomposition
[2024-05-29 03:18:48] [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/graph155307319166022084.txt' '-o' '/tmp/graph155307319166022084.bin' '-w' '/tmp/graph155307319166022084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph155307319166022084.bin' '-l' '-1' '-v' '-w' '/tmp/graph155307319166022084.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:18:48] [INFO ] Decomposing Gal with order
[2024-05-29 03:18:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:18:48] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:18:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:18:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:18:48] [INFO ] Time to serialize gal into /tmp/CTLFireability7588439182126457783.gal : 2 ms
[2024-05-29 03:18:48] [INFO ] Time to serialize properties into /tmp/CTLFireability13880800427813558230.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/CTLFireability7588439182126457783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13880800427813558230.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.17748e+12,3.59377,100268,2015,42,162199,254,358,345610,42,1394,0


Converting to forward existential form...Done !
original formula: AF(EX(((i5.i1.u30.p81==1) + !(E(!(((i5.i1.u30.p80==1)&&(i6.i1.u47.p130==1))) U ((i8.u32.p86==1)&&(i8.u40.p110==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((i5.i1.u30.p81==1) + !(E(!(((i5.i1.u30.p80==1)&&(i6.i1.u47.p130==1))) U ((i8.u32.p86==1)&&(i8.u...182
Reverse transition relation is NOT exact ! Due to transitions t41, t44, t47, t68, t71, i0.i0.u1.t78, i1.t74, i1.i0.u6.t77, i1.i1.u7.t76, i2.i0.u13.t70, i2....625
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 131 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 131 transition count 121
Applied a total of 12 rules in 6 ms. Remains 131 /137 variables (removed 6) and now considering 121/127 (removed 6) transitions.
// Phase 1: matrix 121 rows 131 cols
[2024-05-29 03:19:18] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 03:19:18] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-29 03:19:18] [INFO ] Invariant cache hit.
[2024-05-29 03:19:18] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-29 03:19:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:19:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:19:20] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-29 03:19:21] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:21] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:19:21] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:19:21] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-29 03:19:21] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:21] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/252 variables, 131/190 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:22] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:19:23] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:24] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:19:25] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 204 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8452 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 50/73 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:27] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:19:27] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:19:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:19:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/252 variables, 131/209 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 120/329 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:29] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:19:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:19:29] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:19:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:19:29] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 03:19:30] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:19:30] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:19:30] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 03:19:30] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 9/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:31] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:33] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:19:33] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:19:33] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:35] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:19:35] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:37] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:39] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:41] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:43] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-29 03:19:45] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/252 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 18 (OVERLAPS) 0/252 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 349 constraints, problems are : Problem set: 0 solved, 120 unsolved in 24243 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 75/75 constraints]
After SMT, in 32722ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 32723ms
Starting structural reductions in LTL mode, iteration 1 : 131/137 places, 121/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32978 ms. Remains : 131/137 places, 121/127 transitions.
[2024-05-29 03:19:51] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:19:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:19:51] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-29 03:19:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:19:51] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:19:51] [INFO ] Time to serialize gal into /tmp/CTLFireability18243577725729132142.gal : 1 ms
[2024-05-29 03:19:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4847919470903295014.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/CTLFireability18243577725729132142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4847919470903295014.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:20:21] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:20:21] [INFO ] Applying decomposition
[2024-05-29 03:20:21] [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/graph9295197435771380592.txt' '-o' '/tmp/graph9295197435771380592.bin' '-w' '/tmp/graph9295197435771380592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9295197435771380592.bin' '-l' '-1' '-v' '-w' '/tmp/graph9295197435771380592.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:20:21] [INFO ] Decomposing Gal with order
[2024-05-29 03:20:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:20:21] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:20:21] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:20:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-29 03:20:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9607535177892239913.gal : 1 ms
[2024-05-29 03:20:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15198562140184030211.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/CTLFireability9607535177892239913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15198562140184030211.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,6.23111e+12,2.61416,80252,3352,65,133065,424,380,300461,57,3317,0


Converting to forward existential form...Done !
original formula: EF(((A((A(EX((i7.i1.u40.p113==1)) U (((i4.i0.u11.p26==1)&&(i4.i1.u16.p41==1))&&(i7.i1.u40.p113==1))) + EG((i9.u46.p132==1))) U (i3.i1.u23...585
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(!((i3.i1.u23.p64==1))))) * !(E(!((i3.i1.u23.p64==1)) U (!((!((E(!((((i4.i0.u11.p26==...1591
Reverse transition relation is NOT exact ! Due to transitions t47, t50, t74, t77, t80, i0.u1.t84, i1.i1.u5.t83, i2.i0.u6.t82, i2.i1.u19.t65, i2.i1.u20.t6, ...736
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 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 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 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 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 11 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:20:51] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:20:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 03:20:51] [INFO ] Invariant cache hit.
[2024-05-29 03:20:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-29 03:20:51] [INFO ] Redundant transitions in 0 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-29 03:20:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:20:51] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:20:51] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/116 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 88 constraints, problems are : Problem set: 0 solved, 51 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 2/2 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, 2/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 03:20:52] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 140 constraints, problems are : Problem set: 0 solved, 51 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 3/3 constraints]
After SMT, in 1544ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1544ms
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 1683 ms. Remains : 63/137 places, 53/127 transitions.
[2024-05-29 03:20:53] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:20:53] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:20:53] [INFO ] Input system was already deterministic with 53 transitions.
RANDOM walk for 466 steps (0 resets) in 9 ms. (46 steps per ms) remains 0/1 properties
FORMULA ShieldPPPs-PT-002B-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 03:20:53] [INFO ] Flatten gal took : 1 ms
[2024-05-29 03:20:53] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:20:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7924180668930847532.gal : 1 ms
[2024-05-29 03:20:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14555592257047338404.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7924180668930847532.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14555592257047338404.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 131 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 131 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 130 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 130 transition count 120
Applied a total of 14 rules in 2 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:20:53] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 03:20:53] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 03:20:53] [INFO ] Invariant cache hit.
[2024-05-29 03:20:53] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-29 03:20:53] [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:20:54] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:20:54] [INFO ] Deduced a trap composed of 17 places in 33 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:20:55] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:20:55] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:20:56] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:20:57] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:20:57] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:20:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:20:59] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:20:59] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-29 03:20:59] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:20:59] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:21:00] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:21:01] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:21:01] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:21:01] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:21:01] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:21:01] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:21:01] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 03:21:01] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:02] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/130 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 120/250 variables, 130/238 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:03] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:21:03] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:21:03] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:21:03] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:21:03] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 5/243 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:04] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/250 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:04] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:21:04] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/250 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:05] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:21:05] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:21:05] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-29 03:21:05] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:21:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/250 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:21:06] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:21:06] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:21:06] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/250 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/250 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 22 (OVERLAPS) 0/250 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 255 constraints, problems are : Problem set: 0 solved, 119 unsolved in 14704 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 102/102 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, 102/125 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:21:09] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 03:21:09] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 03:21:09] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/250 variables, 130/260 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 119/379 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:10] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:21:13] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:15] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:18] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:23] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/250 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 03:21:27] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:31] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-29 03:21:33] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:21:33] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 2/390 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 390 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 118/118 constraints]
After SMT, in 44741ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 44742ms
Starting structural reductions in LTL mode, iteration 1 : 130/137 places, 120/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44958 ms. Remains : 130/137 places, 120/127 transitions.
[2024-05-29 03:21:38] [INFO ] Flatten gal took : 16 ms
[2024-05-29 03:21:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:21:38] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-29 03:21:38] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:21:38] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:21:38] [INFO ] Time to serialize gal into /tmp/CTLFireability7243626393915722310.gal : 1 ms
[2024-05-29 03:21:38] [INFO ] Time to serialize properties into /tmp/CTLFireability571384596456094979.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/CTLFireability7243626393915722310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability571384596456094979.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,5.30141e+12,29.0953,759680,2,48364,5,2.27526e+06,6,0,642,5.32539e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 03:22:08] [INFO ] Flatten gal took : 2 ms
[2024-05-29 03:22:08] [INFO ] Applying decomposition
[2024-05-29 03:22:08] [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/graph10681905119562343721.txt' '-o' '/tmp/graph10681905119562343721.bin' '-w' '/tmp/graph10681905119562343721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10681905119562343721.bin' '-l' '-1' '-v' '-w' '/tmp/graph10681905119562343721.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:22:08] [INFO ] Decomposing Gal with order
[2024-05-29 03:22:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:22:08] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:22:08] [INFO ] Flatten gal took : 15 ms
[2024-05-29 03:22:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:22:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17449050019128541450.gal : 2 ms
[2024-05-29 03:22:08] [INFO ] Time to serialize properties into /tmp/CTLFireability13331848639443742447.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/CTLFireability17449050019128541450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13331848639443742447.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.30141e+12,6.25566,144096,2790,45,218169,473,381,421212,50,2601,0


Converting to forward existential form...Done !
original formula: (AX(AF((((AF(((i1.u9.p21==1)&&(i3.i1.u21.p57==1))) + E((i2.i1.u16.p46==1) U ((i3.i0.u13.p30==1)&&(i5.u43.p120==1)))) + ((i2.i1.u16.p46==1...841
=> equivalent forward existential formula: ([FwdG(EY(Init),!((((!(EG(!(((i1.u9.p21==1)&&(i3.i1.u21.p57==1))))) + E((i2.i1.u16.p46==1) U ((i3.i0.u13.p30==1)...3171
Reverse transition relation is NOT exact ! Due to transitions t45, t48, t74, t77, t80, i0.i0.u1.t84, i0.i2.u6.t83, i1.u7.t82, i2.i0.u10.t79, i2.i1.t71, i2....691
Detected timeout of ITS tools.
[2024-05-29 03:22:38] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:22:38] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:22:38] [INFO ] Applying decomposition
[2024-05-29 03:22:38] [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/graph1435960826315614848.txt' '-o' '/tmp/graph1435960826315614848.bin' '-w' '/tmp/graph1435960826315614848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1435960826315614848.bin' '-l' '-1' '-v' '-w' '/tmp/graph1435960826315614848.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:22:38] [INFO ] Decomposing Gal with order
[2024-05-29 03:22:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:22:38] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 03:22:38] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:22:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 03:22:38] [INFO ] Time to serialize gal into /tmp/CTLFireability9665658203907525174.gal : 2 ms
[2024-05-29 03:22:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7897608407689389970.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/CTLFireability9665658203907525174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7897608407689389970.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,7.9721e+12,4.5604,113820,3380,82,171616,506,361,396232,54,3192,0


Converting to forward existential form...Done !
original formula: AF((A(EX(((((i3.i0.u15.p35==1)&&(i3.i1.u20.p58==1))||(i4.u25.p68==1)) * AF((i0.i3.u4.p9==1)))) U (i1.i1.u17.p38==1)) + (!(A(EF((i4.u25.p6...262
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((i1.i1.u17.p38==1)) U (!(EX(((((i3.i0.u15.p35==1)&&(i3.i1.u20.p58==1))||(i4.u25.p68==1)) * ...529
Reverse transition relation is NOT exact ! Due to transitions t53, t56, t80, t83, i0.t86, i0.i1.u6.t89, i0.i2.u7.t88, i1.i0.u10.t85, i1.i1.t77, i1.i1.u17.t...814
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-29 03:29:09] [INFO ] Applying decomposition
[2024-05-29 03:29:09] [INFO ] Flatten gal took : 7 ms
[2024-05-29 03:29:09] [INFO ] Decomposing Gal with order
[2024-05-29 03:29:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:29:09] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-29 03:29:09] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:29:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2024-05-29 03:29:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10389356105031380417.gal : 2 ms
[2024-05-29 03:29:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7105818949798277404.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/CTLFireability10389356105031380417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7105818949798277404.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,7.9721e+12,183.52,4389008,31087,312,8.209e+06,1356,220,3.27042e+07,94,17996,0


Converting to forward existential form...Done !
original formula: AF((A(EX(((((i0.i1.i0.i0.i0.i0.i1.u19.p35==1)&&(i0.i1.i0.u22.p58==1))||(i0.i1.u23.p68==1)) * AF((i0.i1.i0.i0.i0.u57.p9==1)))) U (i0.i1.i0...348
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((i0.i1.i0.i0.i0.u20.p38==1)) U (!(EX(((((i0.i1.i0.i0.i0.i0.i1.u19.p35==1)&&(i0.i1.i0.u22.p5...695
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.t14, i0.i1.u23.t64, i0.i1.u...1209
ITS-tools command line returned an error code 137
[2024-05-29 03:40:15] [INFO ] Flatten gal took : 17 ms
[2024-05-29 03:40:15] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-29 03:40:15] [INFO ] Transformed 137 places.
[2024-05-29 03:40:15] [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:40:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12239001718720579451.gal : 1 ms
[2024-05-29 03:40:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17309849087501956110.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12239001718720579451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17309849087501956110.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,7.9721e+12,20.8709,500588,2,76357,5,1.57387e+06,6,0,677,3.46348e+06,0


Converting to forward existential form...Done !
original formula: AF((A(EX(((((p35==1)&&(p58==1))||(p68==1)) * AF((p9==1)))) U (p38==1)) + (!(A(EF((p64==1)) U AF(((p19==1)&&(p43==1))))) * EX(AG(((p100==1...173
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!((p38==1)) U (!(EX(((((p35==1)&&(p58==1))||(p68==1)) * !(EG(!((p9==1))))))) * !((p38==1)))) ...382
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t18, t19, t20, t21, t22, t23, t24, t25, ...414
ITS-tools command line returned an error code 137
Total runtime 2960007 ms.

BK_STOP 1716954662443

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="CTLFireability"
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 CTLFireability"
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-171683761000378"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;